Are All Triperfect Numbers Even?/Progress/Prime Factors
Jump to navigation
Jump to search
Theorem
An odd triperfect number has:
- at least $11$ distinct prime factors
- at least $32$ distinct prime factors if $3$ is not one of them.
Proof
 | This theorem requires a proof. You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof. To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{ProofWanted}} from the code.If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page. |
Sources
- Jan. 1982: Walter E. Beck and Rudolph M. Najar: A Lower Bound for Odd Triperfects (Math. Comp. Vol. 38, no. 157: pp. 249 – 251) www.jstor.org/stable/2007481
- 1986: David Wells: Curious and Interesting Numbers ... (previous) ... (next): $120$
- 1997: David Wells: Curious and Interesting Numbers (2nd ed.) ... (previous) ... (next): $120$