2013viXraRequires access

A Conjecture that Must be as Hard as Fermat's Last Theorem

Julien Laurendeau

Open publisher page 0 citations

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.

About this research paper

What this paper is about

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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Fermat's Last Theorem, Conjecture, Mathematics, Number theory, Wieferich prime, Combinatorics, Regular prime, Fermat number

Related papers

Back to paper searchBrowse research topicsOriginal source
A Conjecture that Must be as Hard as Fermat's Last Theorem — Research Paper | ScholarLens