No label defined (Q4277682)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 496031
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 496031 |
Statements
9 February 1994
0 references
Collatz function
0 references
\(3x+1\)-conjecture
0 references
set of primes
0 references
distinct prime factors
0 references
iteration
0 references
0.7338880896568298
0 references
0.7329775094985962
0 references
Following Euclid's proof of the infinitude of primes, define a function \(f\) which takes a set of primes \(\{p_ 1, \dots, p_ n\}\) to the set of distinct prime factors of \(p_ 1 \cdots p_ n + 1\). The author conjectures that under the iteration of \(f\) any set of primes converges to the cycle \(\{2\}\), \(\{3\}\), and gives a proof in the addendum (bibliographic data given below). He also gives a program written with the Mathematica computer system to compute the number of steps required for convergence. It easily follows from the proof that this is \(O(\log (p_ 1 \cdots p_ n))\). A quick reference is made to the similar, but more difficult, problem of the Collatz or \(3n+1\) sequence [see e.g. \textit{J. C. Lagarias}, Am. Math. Mon. 92, 3-23 (1985; Zbl 0566.10007)].
0 references