How to resolve the algorithm First power of 2 that has leading decimal digits of 12 step by step in the BASIC256 programming language

Published on 12 May 2024 09:40 PM
#Basic256

How to resolve the algorithm First power of 2 that has leading decimal digits of 12 step by step in the BASIC256 programming language

Table of Contents

Problem Statement

(This task is taken from a   Project Euler   problem.) (All numbers herein are expressed in base ten.)

27   =   128   and   7   is the first power of   2   whose leading decimal digits are   12. The next power of   2   whose leading decimal digits are   12   is   80, 280   =   1208925819614629174706176.

Define     p(L,n)     to be the nth-smallest value of   j   such that the base ten representation of   2j   begins with the digits of   L .

You are also given that:

Let's start with the solution:

Step by Step solution about How to resolve the algorithm First power of 2 that has leading decimal digits of 12 step by step in the BASIC256 programming language

Source code in the basic256 programming language

global FAC
FAC = 0.30102999566398119521373889472449302677

print p(12, 1)
print p(12, 2)
print p(123, 45)
print p(123, 12345)
print p(123, 678910)
end

function p(L, n)
    cont = 0 : j = 0
    LS = string(L)
    while cont < n
        j += 1
        x = FAC * j
        if x < length(LS) then continue while
        y = 10^(x-int(x))
        y *= 10^length(LS)
        digits = string(y)
        if left(digits,length(LS)) = LS then cont += 1
    end while
    return j
end function

You may also check:How to resolve the algorithm Order two numerical lists step by step in the Ela programming language
You may also check:How to resolve the algorithm 100 prisoners step by step in the Crystal programming language
You may also check:How to resolve the algorithm Text processing/Max licenses in use step by step in the Go programming language
You may also check:How to resolve the algorithm A+B step by step in the Ruby programming language
You may also check:How to resolve the algorithm Sleeping Beauty problem step by step in the Wren programming language