In [6]:

    

int(3.2)


    

    
Out[6]:





3

In [2]:

    

function s (p, q, n):
    t :: Int, m :: Int = 1, 1
    for a in r1:int ((log (n))/(log (p)) + 1.0)
        t *= p
        b = int ((log (n//t))/(log (q)))
        if b < 1
            break
        end
        if p^a*q^b > m
            m = p^a*q^b
        end
    end
    return m 
end
    
function sol357(n :: Int)
    primeso = sieve (n)
    total = 0 
    for i in range (len (primes)):
        for j in range (i+1, len (primes)):
            p, q = primes[i], primes[j]
            if p*q > n:
                break
            else
                total += s (p, q, n)
                total
            end


    

    
Out[2]:





25-element Array{Int64,1}:
  2
  3
  5
  7
 11
 13
 17
 19
 23
 29
 31
 37
 41
 43
 47
 53
 59
 61
 67
 71
 73
 79
 83
 89
 97

In [1]:

    

include("Common.jl")


    

    
Out[1]:





ispsqr (generic function with 1 method)