Eliminates five impostor kernels for unitary perfect numbers via three reproducible filters for seed exponents up to 10000 and computationally bounds the set H_even up to 50000 with explicit undecided lists, while reducing the remaining problem to cyclotomic divisors.
The On-Line Encyclopedia of Integer Sequences,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.NT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Bounded-box reductions in the Subbarao-Warren problem for unitary perfect numbers
Eliminates five impostor kernels for unitary perfect numbers via three reproducible filters for seed exponents up to 10000 and computationally bounds the set H_even up to 50000 with explicit undecided lists, while reducing the remaining problem to cyclotomic divisors.