Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2407.05068

On the Simple Divisibility Restrictions by Polynomial Equation a n+bn=cn Itself in Fermat Last Theorem for Integer/Complex/Quaternion Triples

Sandor Kristyan
View original source ↗Read source document ↗Export metadata ↓

Abstract

The divisibility restrictions in the famous equation a n+bn=cn in Fermat Last Theorem (FLT, 1637) is analyzed how it selects out many triples to be Fermat triple (i.e. solutions) if n greater than 2, decreasing the cardinality of Fermat triples. In our analysis, the restriction on positive integer (PI) solutions ((a,b,c,n) up to the point when there is no more) is not along with restriction on power n in PI as decreasing sets {PI } containing {odd} containing {primes} containing {regular primes}, etc. as in the literature, but with respect to exclusion of more and more c in PI as increasing sets {primes p} in {p k} in {PI}. The divisibility and co-prime property in Fermat equation is analyzed in relation to exclusion of solutions, and the effect of simultaneous values of gcd(a,b,c), gcd(a+b,cn), gcd(c-a,bn) and gcd(c-b,an) on the decrease of cardinality of solutions is exhibited. Again, our derivation focuses mainly on the variable c rather than on variable n, oppositely to the literature in which the FLT is historically separated via the values of power n. Among the most famous are the known, about 2500 years old, existing Pythagorean triples (a,b,c,n=2) and the first milestones as the proved cases (of non-existence as n=3 by Gauss and later by Euler (1753) and n=4 by Fermat) less than 400 years ago. As it is known, Wiles has proved the FLT in 1995 in an abstract roundabout way. The n<0, n:=1/m, as well as complex and quaternion (a,b,c) cases focusing on Pythagoreans are commented. Odd powers FLT over quaternions breaks.

Explore related subjects

math.GM

Keep this discovery

BibTeXRIS

Sandor Kristyan. 2024-07-06. On the Simple Divisibility Restrictions by Polynomial Equation a n+bn=cn Itself in Fermat Last Theorem for Integer/Complex/Quaternion Triples. https://arxiv.org/abs/2407.05068

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Average Chord Lengths in a Triangle

Let $P$ be a point inside a triangle $T$. We consider the average length of the chords of $T$ through $P$, where the direction of the chord is chosen uniformly. An elementary formula is obtained in terms of the distances from $P$ to the sides and vertices of the triangle. Several classical triangle centers give especially simple specializations. For example, if $I$ is the incenter, then \[ M_T(I)=\frac{2r}{\pi} \log\left(\cot\frac A4\cot\frac B4\cot\frac C4\right). \] Our main result is the sharp inequality \[ M_T(P)\le \frac{p}{\pi\sqrt3}\log(2+\sqrt3), \] valid simultaneously for every triangle of perimeter $p$ and every interior point $P$. Thus, among all such pairs $(T,P)$, the largest possible average chord length occurs only when $T$ is equilateral and $P$ is its center. The proof is an elementary symmetrization argument. We close with brief remarks relating the problem to the radial center of a convex body, the electrostatic potential center of a triangle, and dual quermassintegrals.

math.GM↗
arXiv2026

A Proof of Liu's Conjecture on the Fundamental Triangle Inequality

Let $a,b,c$ be the side lengths of a triangle, and let $R$ and $r$ denote its circumradius and inradius, respectively. We prove a conjecture of Liu stating that \[\sum_{\mathrm{cyc}} \left(\frac{a(b+c-a)}{bc}\right)^k \geq 2+\left(\frac{2r}{R}\right)^k,~~k>1, \] with the reverse inequality for $0<k<1$. The proof reduces the problem to three positive variables with fixed sum and product. We also determine the equality cases.

math.GM↗