A Conjecture that Must be as Hard as Fermat's Last Theorem
Julien Laurendeau
Abstract
Julien Laurendeau
Abstract
I will here state a conjecture of my own that will normally be so hard to prove as the Beal conjecture and Fermat’s last theorem.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
I will here state a conjecture of my own that will normally be so hard to prove as the Beal conjecture and Fermat’s last theorem.
Key concepts: Fermat's Last Theorem, Conjecture, Mathematics, Number theory, Wieferich prime, Combinatorics, Regular prime, Fermat number