Sometime these things take a while, so in order to ensure provenance and dates, here are a few snapshots of the in progress submission.
The publishing process has been a little more involved than I thought. Keeping the PROG element below for future reference.
One aspect that did not make it into the published version was the Conjecture that I added in an effort to unstick the process. I repeat it here so that it is not lost in old history.
Conjecture: There are NO Proth numbers of form pr=1+(-1+2^n)*2^(n+1) ), for which, working modulo pr the congruence -1== 2^(2*(1+2*n)) modulo pr is FALSE
Links and references:
- Published sequence A325914 [ oeis.org ] Proth primes
- sal683onetime (onetime encryption scheme)
- oeis.org - author search
No comments:
Post a Comment