Data update

This commit is contained in:
Ingy döt Net 2024-10-16 18:07:41 -07:00
parent 81fd053722
commit 52a6ef48dd
10248 changed files with 63654 additions and 6775 deletions

View file

@ -1,5 +1,6 @@
// Generate Chernick's Carmichael numbers. Nigel Galloway: June 1st., 2019
let fMk m k=isPrime(6*m+1) && isPrime(12*m+1) && [1..k-2]|>List.forall(fun n->isPrime(9*(pown 2 n)*m+1))
let fX k=Seq.initInfinite(fun n->(n+1)*(pown 2 (k-4))) |> Seq.filter(fun n->fMk n k )
let cherCar k=let m=Seq.head(fX k) in printfn "m=%d primes -> %A " m ([6*m+1;12*m+1]@List.init(k-2)(fun n->9*(pown 2 (n+1))*m+1))
[4..9] |> Seq.iter cherCar
open Open.Numeric.Primes
let fMk m k=Number.IsPrime(6UL*m+1UL) && Number.IsPrime(12UL*m+1UL) && [1..k-2]|>List.forall(fun n->Number.IsPrime(9UL*(pown 2UL n)*m+1UL))
let fX k=Seq.initInfinite(fun n->match k with 3->uint64(n+1) |_->uint64(n+1)*(pown 2UL (k-4)))|>Seq.filter(fun n->fMk n k)
let cherCar k=let m=Seq.head(fX k) in sprintf "m=%d primes-> %A " m ([6UL*m+1UL;12UL*m+1UL]@List.init(k-2)(fun n->9UL*(pown 2UL (n+1))*m+1UL))
[3..9] |> Seq.iter(fun g->printfn $"cherCar %d{g}: %s{cherCar g}")

View file

@ -0,0 +1,43 @@
include Settings
say version; say 'Chernick''s Carmichael numbers'; say
numeric digits 80
say Copies('-',80)
say 'n m(n) a(n)'
say Copies('-',80)
do n = 3 to 9
mp = 1
if n > 4 then
mp = 2**(n-4)
if n > 5 then
mp = mp*5
k = 0
do x = 1
k = k+1; m = mp*k; f.1 = 6*m+1
if \ IsPrime(f.1) then
iterate x
f.2 = 12*m+1
if \ IsPrime(f.2) then
iterate x
f = 2
do i = 1 to n-2
f = f+1; f.f = 2**i*9*m+1
if \ IsPrime(f.f) then
iterate x
end
a = 1
do i = 1 to f
a = a*f.i
end
say n Right(m,6) a
leave x
end
end
say Copies('-',80)
say Format(Time('e'),3,3) 'seconds'
say
exit
include Numbers
include Functions
include Abend