REVIEW 1 cited by
10 conjectures in additive number theory
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Following an idea of Rowland we give a conjectural way to generate increasing sequences of primes using algorithms involving the gcd. These algorithms seem not so useless for searching primes since it appears we found sometime primes much more greater than the number of required iterations. In an other hand we propose new formulations of famous conjectures from the additive theory of numbers (the weak twin prime conjecture, the Polignac conjecture, the Goldbach conjecture or the very general Schinzel's hypothesis H). For the moment these are experimental results obtained using pari-gp.
Forward citations
Cited by 1 Pith paper
-
A New Primes-Generating Sequence
A recurrence-based sequence n^2 - n - 1 divided by a gcd with a recursive helper is observed to yield only 1s and primes for the first 10,000 terms, but the prime-only claim is unproven.
Discussion (0). Continue with ORCID to comment.