A recursive integer map R (sigma on odds, halving on evens) is conjectured to reach 1 for all n; the paper proves this for a constructed family of primes but contains errors in a key lemma and in a supporting conjecture.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.NT 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
On a Recursive Integer Sequence Implying the Nonexistence of Odd Perfect Numbers
A recursive integer map R (sigma on odds, halving on evens) is conjectured to reach 1 for all n; the paper proves this for a constructed family of primes but contains errors in a key lemma and in a supporting conjecture.