View or download largestTweetablePrime.frink in plain text format
base = 64
n=base^140-1
while ! isPrime[n]
{
println[base[n,base]]
n = n - 2
}
s = base[n, base]
println[s]
println[length[s]]
n2 = parseInt[s, base]
println[isPrime[n2]]
parseInt[repeat["/",140], 64]
View or download largestTweetablePrime.frink in plain text format
This is a program written in the programming language Frink.
For more information, view the Frink
Documentation or see More Sample Frink Programs.
Alan Eliasen was born 18077 days, 8 hours, 2 minutes ago.