use diophantinePrimes.frink

var a
var b
var c
var d
var e
var f
var g
var h
var i
var j
var k
var l
var m
var n
var o
var p
var q
var r
var s
var t
var u
var v
var w
var x
var y
var z
var prime
var largest = -10^1000.

do
{
   for char = "a" to "z"
   {
//      if char == "k" or char == "w" or char == "z" or char == "h" or char == "j"
      /*
      if char == "f"
         eval["$char = random[0,8]"]
      else
         if char =="l" or char == "o" or char == "u"
            eval["$char = random[0, 8]"]
         else
            eval["$char = floor[abs[randomGaussian[0,1]]]"]
         */
      if char == "u" or char == "y" or char == "k" or char == "e" or char == "a" or char == "p"
         eval["$char = random[0,2]"]
      else
         eval["$char = floor[abs[randomGaussian[0, 10]]]"]
//      println["$char = " + eval[char]]
   }

   prime = prime[a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,u,v,w,x,y,z]
   //println["prime = $prime\n"]
   if prime > largest
   {
      largest = prime
      println["largest is $largest"]
      for char = "a" to "z"
      {
         println["$char = " + eval[char]]
      }
   }

} until prime > 0

println[prime]
if isPrime[prime]
   println["Verified."]
else
{
   println["ERROR: "]
   println[factor[prime]]
}