﻿ Fermat's Last Theorem and Related Problems

# Fermat's Last Theorem and Related Problems

© December 2013, Darrell Cox.  An updated version of this article (as of  January, 2018) is at newfer The mathematical background needed to read this article is usually elementary.  A few prerequisites are: A prime p divides xp-x where x is a natural number (Fermat's "little" theorem).  If x and y are relatively prime natural numbers, then xφ(y)≡1(mod y) where φ(y) is Euler's "phi" function.  The greatest common divisor of natural numbers x and y will be denoted by gcd(x , y).  A more succinct way of saying that a natural number x is congruent to the pth power of a natural number modulo a natural number y is to say that x is a  pth power modulo y.

#### Variants of Fermat's Last Theorem

Let a, b, and c be natural numbers relatively prime in pairs and let p be an odd prime.  Every prime factor of (ap+bp)/(a+b) other than p is of the form pk+1.  p (and no higher power of p) divides (ap+bp)/(a+b) if and only if p divides a+b.  Let q be a natural number.  q will be said to be a pth power with respect to (ap+bp)/(a+b) if q(f-1)/p≡1(mod f) for every prime factor f, fp, of (ap+bp)/(a+b).  Let [(ap+bp)/(a+b)] denote (ap+bp)/(a+b)/p if p divides a+b, or (ap+bp)/(a+b) otherwise.  Similarly, let [a+b] denote (a+b)/p if p divides a+b, or a+b otherwise.  The following two conjectures are the main topic of this article;

(1)  If p>3, there do not exist a and b such that [(ap+bp)/(a+b)] is a pth power.

(2)  If p>3, there do not exist a and b such that [(ap+bp)/(a+b)] is a pth power, 2p does not divide a, b, a-b, or a+b, and a, b, a-b, or [a+b] is a pth power.

If the first conjecture is true, there are no solutions of Fermat's equation ap+bp=cp (which, of course, is already known).  The second conjecture encompasses the first case of Fermat's Last Theorem (where p does not divide abc).  (In 1810, Barlow proved that ap+bp=cp only if [(ap+bp)/(a+b)] is a pth power.)  Let T be a natural number.  Since a, b, and T are not symmetrical in the equation [(ap+bp)/(a+b)]=Tp, it is not obvious how to apply the theory of elliptic curves to these problems.  The "pth power w.r.t." concept and the identity ap+bp=(ap-bp)+2bp play a central role in proving these conjectures.  For example, if p divides a+b and (ap+bp)/(a+b)/p is a pth power, then p(a+b)/2 is a pth power w.r.t. (ap-bp)/(a-b) (this is a succinct way of saying that (p(a+b))(f-1)/p≡2(f-1)/p(mod f) for every prime factor f, fp, of (ap-bp)/(a-b)).  If p is not a pth power modulo a prime f of the form pk+1, then, for example, if f does not divide a+b, (px(a+b))(f-1)/p≡1(mod f), 0≤x<p, has a solution (x defines a congruence class).  Furthermore, if 2 is not a pth power modulo f, then, for example, (2y(a+b))(f-1)/p≡1(mod f), 0≤y<p, has a solution and a+b can be eliminated from the congruences.  The objective in the following is to eliminate a, b, a-b, and a+b from certain congruences so that congruence relationships involving only 2 and p are obtained.  When p=3, there do exist a and b such that [(ap+bp)/(a+b)] is a pth power and many properties of such a and b, among them reformulated versions of the classical Furtwängler and Vandiver theorems for Fermat's equation, can be empirically derived.  In the following, these "propositions" are stated as if they were true for all p.  One justification for doing this is the first conjecture above.  Also, more properties of hypothetical solutions of Fermat's equation are shared by solutions of the equation [(ap+bp)/(a+b)]=Tp, p=3.   For example, it can be easily proved that ap+bp=cp implies 2 is a pth power w.r.t. (ap-bp)/(a-b).  Based on empirical evidence collected for p=3, if [(ap+bp)/(a+b)] is a pth power and 2p divides a-b or a+b, then 2 is a pth power w.r.t. (ap-bp)/(a-b) (although there is no apparent reason why this should be true).

#### Congruence Properties of Prime Factors of [(ap-bp)/(a-b)] when [(ap+bp)/(a+b)] is a pth Power

The following propositions are based on data collected for p=3;

(3)  If [(ap+bp)/(a+b)] is a pth power and 2p does not divide a, b, a-b, or a+b, then 2 and p are not pth powers w.r.t. (ap-bp)/(a-b).

(4)  If [(ap+bp)/(a+b)] is a pth power, 2p does not divide a, b, a-b, or a+b, and f is a prime factor of [(ap-bp)/(a-b)], then 2 is a pth power modulo f if and only if f is of the form p2k+1.

By these two propositions, if [(ap+bp)/(a+b)] is a pth power and 2p does not divide a, b, a-b, or a+b, then there is at least one prime factor of [(ap-bp)/(a-b)] not of the form p2k+1.  In 1912, Furtwängler proved that if ap+bp=cp, q divides a and p does not divide ac, or q divides b and p does not divide bc, then qp-1≡1(mod p2).  (Proofs of this theorem use the condition that a+b must be a pth power and it is not obvious how to prove a reformulated version of the theorem without using this condition.)  Furtwängler also proved that if ap+bp=cp, q divides a-b or a+b, and p does not divide a-b or a+b, then qp-1≡1(mod p2).  Note that if p does not divide a natural number d, then dp(p-1)≡1(mod p2) by Euler's theorem.  Then if qp-1≡1(mod p2), q is a pth power modulo p2.  The reformulated version of Furtwängler's theorems is;

(5)  If [(ap+bp)/(a+b)] is a pth power and 2 does not divide a, then p does not divide a and every prime factor of a is a pth power modulo p2.  If [(ap+bp)/(a+b)] is a pth power, 2 divides a, and p does not divide a, then a/2 is a pth power modulo p2.  Analogous results hold for b.  If [(ap+bp)/(a+b)] is a pth power and 2 does not divide a-b, then p does not divide a-b and every prime factor of a-b is a pth power modulo p2.  If [(ap+bp)/(a+b)] is a pth power and 2 does not divide a+b, then p2 does not divide a+b and every prime factor of a+b other than p (if p divides a+b) is a pth power modulo p2.

The peculiar form of Furtwängler's second theorem, that is, the condition that p not divide a-b or a+b, makes sense when viewed from this perspective; 2 divides a-b if and only if 2 divides a+b.  This proposition implies that if [(ap+bp)/(a+b)] is a pth power, p divides a, b, a-b, or a+b, and 2p does not divide a, b, a-b, or a+b, then 2 divides a or b, and p divides a+b.   Note that this proposition implies "split" 2 and p are not possible when ap+bp=cp, p divides c, since p2 cannot divide a+b in this case.  (By Barlow's formulas, p(a+b) must be a pth power when ap+bp=cp, p divides c.)  The requirement that 2p divide a+b could be said to be a characteristic property of the equation ap+bp=cp, p divides c.  A related proposition is;

(6)  If [(ap+bp)/(a+b)] is a pth power, then p2 divides a if 2p divides a, p2 divides b if 2p divides b, p2 divides a-b if 2p divides a-b, or p3 divides a+b if 2p divides a+b.

In the following, p/2 will be said to be a pth power modulo a prime f if p(f-1)/p≡ 2(f-1)/p(mod f).  More propositions are;

(7)  If [(ap+bp)/(a+b)] is a pth power, 2 divides a or b, and f is a prime factor of [(ap-bp)/(a-b)] not of the form p2k+1, then exactly one of 2p, p, or p/2 is a pth power modulo f.

(8)  If [(ap+bp)/(a+b)] is a pth power, p divides a+b, and f is a prime factor of [(ap-bp)/(a-b)] of the form p2k+1, then pa, pb, p2(a-b), and p(a+b) are pth powers modulo f.  If [(ap+bp)/(a+b)] is a pth power, p divides a, b, or a-b, and f is a prime factor of [(ap-bp)/(a-b)] of the form p2k+1, then a, b, p(a-b), and a+b are pth powers modulo f.

Note that p is not precluded from being a pth power modulo f in Proposition (8).  If [(ap+bp)/(a+b)] is a pth power and 2p does not divide a, b, a-b, or a+b, there is apparently nothing to prevent p from being a pth power modulo every prime factor of [(ap-bp)/(a-b)] not of the form p2k+1.  By these propositions, if [(ap+bp)/(a+b)] is a pth power, 2p does not divide a, b, a-b, or a+b, and p is a pth power modulo every prime factor of [(ap-bp)/(a-b)] not of the form  p2k+1, then a, b, a-b, and [a+b] are not pth powers.  (By Proposition (3), there would be at least one prime factor f of [(ap-bp)/(a-b)] of the form p2k+1 such that p was not a pth power modulo f.  Then by Proposition (8), a, b, a-b, or [a+b] couldn't be a pth power.)  More propositions are;

(9)  If [(ap+bp)/(a+b)] is a pth power, 2 divides a, p does not divide a,  f is a prime factor of [(ap-bp)/(a-b)] not of the form  p2k+1, and p/2 is a pth power modulo f, then  pa, p2b, p(a-b), and a+b are pth powers modulo f.  If [(ap+bp)/(a+b)] is a pth power, 2 divides a, p does not divide a,  f is a prime factor of [(ap-bp)/(a-b)] not of the form p2k+1, and 2p is a pth power modulo f, then pa, b, a-b, and p2(a+b) are pth powers modulo f.  Analogous results hold for b.

(10)  If [(ap+bp)/(a+b)] is a pth power, 2 divides a, and p does not divide a, then pa, 2pb, 22p2(a-b), and 22p(a+b) are pth powers w.r.t. (ap-bp)/(a-b).  Also, either 2p is a pth power w.r.t. (ap-bp)/(a-b) or none of 2p, p, p/2, or 2 is a pth power w.r.t. (ap-bp)/(a-b) (if [(ap-bp)/(a-b)] has only one distinct prime factor, then [(ap-bp)/(a-b)] is prime and 2p is a pth power w.r.t. (ap-bp)/(a-b)).  Analogous results hold for b.

Note that if 2p is a pth power w.r.t. (ap-bp)/(a-b) in Proposition (10), then a/2, b, a-b, and [a+b] are pth powers w.r.t. (ap-bp)/(a-b).  Since Propositions (8), (9), and 10 are based solely on data collected for p=3, their form is sometimes ambiguous in that the p2 and 22 factors might be pp-1 and 2p-1 instead.  If p(a+b)/2 is a pth power w.r.t. [(ap-bp)/(a-b)] (as implied by a second-case solution of Fermat's equation, p divides c, p3), f is a prime factor of [(ap-bp)/(a-b)], and 2p is a pth power modulo f, then p2(a+b) is a pth power modulo f, so the p2 factor of a+b in Proposition (9) is unambiguous.  Propositions (9) and (10) are consistent when p is not a pth power modulo f only if 8 is a pth power modulo f, but 8 can be a pth power modulo f only if p=3 (2f-1≡1(mod f) and (23)(f-1)/p≡1(mod f), p≠3, implies 2(f-1)/p≡1(mod f) [since in this case, the greatest common divisor of f-1 and 3(f-1)/p is (f-1)/p], a contradiction).  This follows from eliminating b, a-b, and a+b from the congruences if 2 divides a, or eliminating a, a-b, and a+b from the congruences if 2 divides b.  If a 2p-1p factor of the a+b term in Proposition (10) had been used, some inconsistency for p>3 could have been avoided (this implies p/2, 22p, and 2p-1p are pth powers modulo f if p/2 is a pth power modulo f, or 2p, 22p2, and 2p-1/p are pth powers modulo f if 2p is a pth power modulo f).  However, using a 2 p-1p p-1, 22p p-1, 2p-1p2 , or 22p2 factor of the a-b term in Proposition (10) implies that 8 is a pth power modulo f, a contradiction for p>3.  This may just mean that one (or both) of the propositions is specific to p=3.  It's plausible that the maximum p exponent used in Proposition (9) is related to the number of the terms a, b, a-b, and a+b (and not to the p value itself).  If p is not a pth power modulo f, then, for example, (px(a-b))(f-1)/p≡1(mod f), 0≤x<p, has a solution, so Proposition (9) should remain the same for p>3.  If it's granted that 2p should be a pth power modulo f some of the time (note that this implies that p is not a pth power modulo f), then Proposition (10) should remain the same for p>3.  (In this case, eliminating b, a-b, and a+b from the congruences if 2 divides a, or eliminating a, a-b, and a+b from the congruences if 2 divides b, gives 2p, 22p2, and p/22 are pth powers modulo f.  Note that 22p2 is the square of 2p; x=2 is the only possible solution of [2xp2(a-b)](f-1)/p≡1(mod f) when x=1 is the solution of (2xpa)(f-1)/p≡1(mod f), 2 divides b, or (2xpb)(f-1)/p≡1(mod f), 2 divides a.)  Other propositions are;

(11)  If [(ap+bp)/(a+b)] is a pth power, 2 divides a, f is a prime factor of [(ap-bp)/(a-b)] not of the form p2k+1, and p is a pth power modulo f, then a, 2b, 22(a-b), and 22(a+b) (and not 2) are pth powers modulo f.  Analogous results hold for b.  If [(ap+bp)/(a+b)] is a pth power, 2 divides a-b or a+b, f is a prime factor of [(ap-bp)/(a-b)] not of the form p2k+1, and p is a pth power modulo f, then a-b, a+b, and 2 (and not a or b) are pth powers modulo f.

(12)  If [(ap+bp)/(a+b)] is a pth power, then a is a pth power w.r.t. (ap-bp)/(a-b) if 2p divides a, or b is a pth power w.r.t. (ap-bp)/(a-b) if 2p divides b, or p(a-b) and a+b are pth powers w.r.t. (ap-bp)/(a-b) if 2p divides a-b, or p2(a-b) and p(a+b) are pth powers w.r.t. (ap-bp)/(a-b) if 2p divides a+b.

(13)  If [(ap+bp)/(a+b)] is a pth power and 2p divides a-b or a+b, then 2 is a pth power w.r.t. (ap-bp)/(a-b).

(14)  If [(ap+bp)/(a+b)] is a pth power, 2p divides a, f is a prime factor of [(ap-bp)/(a-b)] not of the form p2k+1, and p/2 is a pth power modulo f, then a, pb, a-b, and p2(a+b) are pth powers modulo f.  If [(ap+bp)/(a+b)] is a pth power, 2p divides a, f is a prime factor of [(ap-bp)/(a-b)] not of the form p2k+1, and 2p is a pth power modulo f, then a, p2b, p2(a-b), and p(a+b) are pth powers modulo f.  Analogous results hold for b.  If [(ap+bp)/(a+b)] is a pth power, 2p divides a-b, f is a prime factor of [(ap-bp)/(a-b)] not of the form p2k+1, and p is not a pth power modulo f, then (1) pa, p2b, p(a-b), and a+b are pth powers modulo f, or (2) p2a, pb, p(a-b), and a+b are pth powers modulo f.  If [(ap+bp)/(a+b)] is a pth power, 2p divides a+b, f is a prime factor of [(ap-bp)/(a-b)] not of the form p2k+1, and p is not a pth power modulo f, then (1) a, p2b, p2(a-b), and p(a+b) are pth powers modulo f, or (2) p2a, b, p2(a-b), and p(a+b) are pth powers modulo f.

(15)  If [(ap+bp)/(a+b)] is a pth power, 2p divides a or b, [(ap-bp)/(a-b)] has two distinct prime factors, and neither distinct prime factor is of the form p2k+1, then [(ap-bp)/(a-b)] is of the form p2k+1, and (1) 2p is a pth power modulo both distinct prime factors, or (2) p is a pth power modulo both distinct prime factors, or (3) p/2 is a pth power modulo both distinct prime factors.  If [(ap+bp)/(a+b)] is a pth power, 2p divides a-b or a+b, [(ap-bp)/(a-b)] has two distinct prime factors, and neither distinct prime factor is of the form p2k+1, then [(ap-bp)/(a-b)] is of the form p2k+1.

In this section, it is assumed that [(ap-bp)/(a-b)] can't be a pth power when [(ap+bp)/(a+b)] is a pth power.  (As will be shown, the congruence properties of the prime factors of [(ap+bp)/(a+b)] when [(ap+bp)/(a+b)] is a pth power are similar to the congruence properties of the prime factors of [(ap-bp)/(a-b)] when [(ap+bp)/(a+b)] is a pth power, but are not the same.)

Let T be a natural number.  If p=3, every prime factor of T is of the form pk+1, and T has n such distinct prime factors, then Tp or pTp has exactly pn representations of the form (ap+bp)/(a+b).  Proving the first conjecture when p divides a+b would entail proving that if one representation of pTp of the form (ap+bp)/(a+b) exists, then other representations exist and that 2 and p split for some of these representations.  There is little evidence that there would exist different representations of pTp of the form (ap+bp)/(a+b) for p>3.  Even if there were a representation ((a')p+(b')p)/(a'+b') with split 2 and p, how to deal with the case where p was a pth power modulo every prime factor of [((a')p-(b')p)/(a'-b')] not of the form p2k +1 is unknown.

#### Congruence Properties of Prime [(ap-bp)/(a-b)] when [(ap+bp)/(a+b)] is a pth Power

In this section, more empirical evidence in support of Propositions (8), (12), and (13) is given. The following propositions are based on data collected for p=3, 5, 7, and 11;

(16)  If p>3, p2 divides a, b, a-b, or a+b, [(ap+bp)/(a+b)] and [(ap-bp)/(a-b)] are primes of the form p2k+1, and 2 is a pth power modulo [(ap+bp)/(a+b)] or [(ap-bp)/(a-b)], then [(ap-bp)/(a-b)] is a pth power modulo [(ap+bp)/(a+b)] and [(ap+bp)/(a+b)] is a pth power modulo [(ap-bp)/(a-b)].  An analogous result holds for p=3 if p2 divides a or b or p3 divides a-b or a+b.

(17)  If [(ap-bp)/(a-b)] is prime, qp-1≡1(mod p2), and q divides a, b, a+b, or a-b, then q is a pth power modulo [(ap-bp)/(a-b)].

(18)  If p>3, [(ap-bp)/(a-b)] is prime, and p2 divides a, b, a+b, or a-b, then p is a pth power modulo [(ap-bp)/(a-b)].  If p=3, [(ap-bp)/(a-b)] is prime, and p2 divides a, b, or a+b or p3 divides a-b, then p is a pth power modulo [(ap-bp)/(a-b)].

(19)  If [(ap-bp)/(a-b)] is prime, p does not divide q, p divides a and q divides a, or p divides b and q divides b, or p divides a+b and q divides a+b or a-b, then q is a pth power modulo [(ap-bp)/(a-b)].  If p>3, [(ap-bp)/(a-b)] is prime, p does not divide q, p divides a-b, and q divides a+b or a-b, then q is a pth power modulo [(ap-bp)/(a-b)].  If p=3, [(ap-bp)/(a-b)] is prime, p does not divide q, p2 divides a-b, and q divides a+b or a-b, then q is a pth power modulo [(ap-bp)/(a-b)].

(20)  If p>3, [(ap-bp)/(a-b)] is a prime of the form p2k+1, and p2 divides a, b, a+b, or a-b, then a, b, a+b, a-b, and p are pth powers modulo [(ap-bp)/(a-b)].  If p=3, [(ap-bp)/(a-b)] is a prime of the form p2k+1, and p2 divides a, b, or a+b or p3 divides a-b, then a, b, a+b, a-b, and p are pth powers modulo [(ap-bp)/(a-b)].

Propositions (17), (18), and (19) and Propositions (5) and (6) lead to the following proposition;

(21)  If [(ap+bp)/(a+b)] is a pth power, 2p divides a, b, a-b, or a+b, and [(ap-bp)/(a-b)] is prime, then every factor of a, b, a-b, and a+b is a pth power modulo [(ap-bp)/(a-b)] (note that this implies [(ap-bp)/(a-b)] is a prime of the form p2k+1).

Based on data collected for p=3, generalized versions of Propositions (17), (18), and (19) are true when [(ap-bp)/(a-b)]=Uk where U is a prime and p does not divide k.  (The propositions would be modified so that the modulus would be U instead of [(ap-bp)/(a-b)].)  This gives the following proposition;

(22)  If [(ap+bp)/(a+b)] is a pth power, 2p divides a, b, a-b, or a+b, and [(ap-bp)/(a-b)]=Uk where U is a prime and p does not divide k, then every factor of a, b, a-b, and a+b is a pth power modulo U.

#### Wieferich's Criterion and the "pth Power with Respect to" Concept

In 1909, Wieferich proved that if ap+bp=cp, p does not divide abc, then 2 p-1≡1(mod p2). Wieferich derived this criterion from very complicated formulas; a simpler approach is to employ the "pth power w.r.t." concept.  The following proposition is based on data collected for p=3, 5, 7, and 11;

(23)  If p>3, qp-1≠1(mod p2), and q is a pth power w.r.t. (ap+bp)/(a+b), then p divides a if q divides a, p divides b if q divides b, or p divides a-b or a+b if q divides a-b or a+b. If p=3, qp-1≠1(mod p2), and q is a pth power w.r.t. (ap+bp)/(a+b), then p divides a-b or a+b if q divides a-b or a+b.

This proposition precludes first-case solutions of Fermat's equation except when 2p-1≡1(mod p2) or p=3 since ap+bp=cp implies cp+bp divides ap+2bp, cp+ap divides 2ap+bp, and ap-bp divides cp-2ap and hence that 2 is a pth power w.r.t. (cp+bp)/(c+b), (cp+ap)/(c+a), and (ap-bp)/(a-b).  (If ap+bp=cp, one of a, b, and c must be even.)  Mirimanoff proved that a first-case solution of Fermat's equation implies that 3p-1≡1(mod p2).  The probability that a root of the congruence xp-1≡1(mod p2), 0<x<p2, is one larger than another root is 1/p (since there are p-1 roots having p(p-1) possible values).  There then shouldn't be any p such that 3p-1≡2p-1≡1(mod p2) since the sum of (1/p)(1/p) over all p converges and the only p less than 3x109 such that 2p-1≡1(mod p2) are 1093 and 3511, and 3p-1≠1(mod p2) for either of these p.

Let ζ be a primitive pth root of unity and K=Q(ζ), a cyclotomic field of degree p-1 over Q.  Let λ denote 1-ζ.  The following proposition follows from the Chinese remainder theorem (and has also been confirmed using data collected for p=3);

(24)  q is a pth power w.r.t. (ap+bp)/(a+b) if and only if q is congruent to the pth power of an integer modulo a+ζb, q is congruent to the pth power of an integer modulo a2b , q is congruent to the pth power of an integer modulo a3b , ..., and q is congruent to the pth power of an integer modulo ap-1b (these are integers in K).

#### Barlow's Formulas and the "pth Power with Respect to" Concept

Barlow's formulas implied by a first-case solution of Fermat's equation are (cp-bp)/(c-b)=Rp, (cp-ap)/(c-a)=Sp, (ap+bp)/(a+b)=Tp, c-b=rp, c-a=sp, and a+b=tp where rR=a, sS=b, tT=c, and gcd(r, R)=gcd(s, S)=gcd(t, T)=1.  Then a divides Sp-cp-1 and Tp-bp-1 and hence c(f-1)/p≡1(mod f) and b(f-1)/p≡1(mod f) for every prime factor f of R.  (Note that c(f-1)/pb(f-1)/p(mod f) and cpbp(mod f) so that every prime factor of (cp-bp)/(c-b) must be of the form p2k+1 [first proved by Sophie Germain].)  Analogous results hold for b and c.  There can be first-case solutions of Fermat's equation only if c, b, and c-b are pth powers w.r.t. (cp-bp)/(c-b), c, a, and c-a are pth powers w.r.t. (cp-ap)/(c-a), a, b, and a+b are pth powers w.r.t. (ap+bp)/(a+b), and every prime factor of (cp-bp)/(c-b), (cp-ap)/(c-a), and (ap+bp)/(a+b) is of the form p2k+1.  Also, r divides sp-tp, s divides rp-tp, and t divides rp+sp.  If n>2, [(xn+yn)1/n-x]1/n+[(xn+yn)1/n-y]1/n>(x+y)1/n where x and y are positive real numbers, therefore r+s>t>r, s and hence each of r, s, and t has a prime factor of the form pk+1.  Also, (ap+bp)/(a+b)=(a+b)(ap-2-2ap-3b+3ap-4b2-...-(p-1)bp-2)+pbp-1 so that pbp-1Tp(mod a+b).

Barlow's formulas implied by a second-case solution of Fermat's equation where p divides c are (cp-bp)/(c-b)=Rp, (cp-ap)/(c-a)=Sp, (ap+bp)/(a+b)=pTp, c-b=rp, c-a=sp, and a+b=(pkt)p/p where rR=a, sS=b, pktT=c, and gcd(r, R)=gcd(s, S)=gcd(pkt, T)=1.  Then c divides Rp-bp-1 and Sp-ap-1 and hence b(f-1)/p≡1(mod f) and a(f-1)/p≡1(mod f) for every prime factor f of T.  Also, b divides pTp-ap-1 and Rp- cp-1 and hence (pa)(f-1)/p≡1(mod f) and c(f-1)/p≡1(mod f) for every prime factor f of S.  Analogous results hold for a.  There can be second-case solutions of Fermat's equation where p divides c only if c, pb, and c-b are pth powers w.r.t. (cp-bp)/(c-b), c, pa, and c-a are pth powers w.r.t. (cp-ap)/(c-a), a, b, and p(a+b) are pth powers w.r.t. (ap+bp)/(a+b), and every prime factor of (ap+bp)/(a+b)/p is of the form p2k+1 (based on these formulas, the prime factors of (cp-bp)/(c-b) and (cp-ap)/(c-a) are not necessarily of the form p2k+1).  (The requirement that every prime factor of (ap+bp)/(a+b)/p be of the form p2k+1 could be said to be another characteristic property of the equation ap+bp=cp, p divides c.)  Also, p divides ap-2-2ap-3b+3ap-4b2-...-(p-1)bp-2 so that bp-1Tp(mod a+b) (this is relevant to fractional ideals to be discussed in the next section).  The following proposition is based on data collected for p=3, 5, 7, and 11;

(25)  If p>3, a is a pth power w.r.t. (ap+bp)/(a+b), and p does not divide a, then ap-1≡1(mod p2).  If p=3, a is a pth power w.r.t. (ap+bp)/(a+b), and p divides b or a-b or p2 divides a+b, then ap-1≡1(mod p2).  Analogous results hold for b.  If a-b is a pth power w.r.t. (ap+bp)/(a+b) and p does not divide a-b or a+b, then (a-b)p-1≡1(mod p2).  Analogous results hold for a+b.

Proposition (25) shows that a second-case solution of Fermat's equation where p divides c implies ap-1≡1(mod p2) and bp-1≡1(mod p2) (avoiding the constraint that p not divide c in Furtwängler's first theorem).

#### Furtwängler's Theorems and Hasse's Reciprocity Law

This section requires some familiarity with algebraic number theory. In the following, the brackets "{}" denote the pth power residue symbol. Hasse used one of his reciprocity laws to give a more systematic proof of Furtwängler's theorems. Hasse's reciprocity law is; {β/α}{α/β}-1Tr(η) where η=((β-1)/p)((α-1)/λ) for all α, β in Q(ζ) with gcd(α, β)=1, α≡1(mod λ), β≡1(mod p), and where Tr denotes the trace from Q(ζ) to Q. Setting α to (ab)/(a+b) and β to qp-1 where q divides b gives {qp-1/[(ab)/(a+b)]}=ζ-u(p-1)b/(a+b) where u=(qp-1-1)/p since α=1-bλ/(a+b)≡1(mod λ) and α≡1(mod q).  If ap+bp=cp, p does not divide c, then α is the pth power of an ideal and hence {β/α}=1 for all β in Q(ζ) that are prime to α. Then if p does not divide b, p must divide u.

The question of which of (qp-1-1)/p and a+b is divisible by the largest power of p can be avoided by considering the reciprocal of α.  ((a2b)/(ab))((a3b)/(a2b))···((a+ζpb)/(a+ζp-1b))=(a+b)/(ab).  Let d(m, n) denote m "choose" n (a binomial coefficient).  Let f1 denote d(1, 0)ap-2-d(2, 1)ap-3b+d(3, 2)ap-4b2-...-d(p-1, p-2)bp-2, f2 denote d(2, 0)ap-3-d(3, 1)ap-4b+d(4, 2)ap-5b2-...+d(p-1, p-3)bp-3, f3 denote d(3, 0)ap-4-d(4, 1)ap-5b+d(5, 2)ap-6b2-...-d(p-1, p-4)bp-4, ..., and fp-1 denote d(p-1, 0).  Collecting terms in the product (1-bλζ/(ab))(1-bλζ2/(a2b))···(1-bλζp-1/(ap-1b)) gives (a+b)/(ab)=1+(bλf1+b2λ2f2+...+bp-1λp-1fp-1)/((ap+bp)/(a+b)).  Tr(1)=p-1 and Tr(λk)=p.  Set α to (a+b)/(ab).  Substituting for Tr(1), Tr(λ), Tr(λ2), ..., Tr(λp-2) and collecting terms gives Tr((α-1)/λ)=b((p-1)ap-2-(p-2)ap-3b+(p-3)ap-4b2-...-bp-2)/((ap+bp)/(a+b)).  Setting β to qp-1 where q divides b gives {qp-1/[(a+b)/(ab)]}=ζuv where v=b((p-1)ap-2-(p-2)ap-3b+(p-3)ap-4b2-...-bp-2)/((ap+bp)/(a+b)).  If p divides a+b, then p also divides (ap+bp)/(a+b).  (p-1)ap-2-(p-2)ap-3b+(p-3)ap-4b2-...-bp-2 is congruent to -(a+b)p-2 modulo p, therefore if p divides a+b, then 1/p does not divide v.  By Proposition (25), if ap+bp=cp, p divides c, then bp-1≡1(mod p2) and hence {bp-1/[(a+b)/(ab)]}=1.

p=(1-ζ)(1-ζ2)(1-ζ3)···(1-ζp-1) and the ideals [1-ζ], [1-ζ2], [1-ζ3], ..., [1-ζp-1] are equal.  If p divides a+b and (ap+bp)/(a+b)/p is a pth power, then ((a2b)/(1-ζ2))/((ab)/(1-ζ)), ((a3b)/(1-ζ3))/((a2b)/(1-ζ2)), ((a4b)/(1-ζ4)/((a3b)/(1-ζ3)), ..., ((ap-1b)/(1-ζp-1))/((ap-2b)/(1-ζp-2)) are pth powers of fractional ideals and hence (a2b)/(ab), (a3b)/(a2b), (a4b)/(a3b), ..., (ap-1b)/(ap-2b) are pth powers of fractional ideals.  Furthermore, (ai+1b)/(a+ζib)=1-bλζi/(a+ζib)=αi≡1(mod λ), i=1, 2, 3, ..., p-2, and hence {β/αi}=1 for all β in Q(ζ) that are prime to αi.  Tr(-bζ/(ab))+Tr(-bζ2/(a2b))+Tr(-bζ3/(a3b))+...+Tr(-bζp-1/(ap-1b))=b(ap-2-2ap-3b+3ap-4b2-...-(p-1)bp-2)/((ap+bp)/(a+b)), therefore if p divides a+b and (ap+bp)/(a+b)/p is a pth power, then {qp-1/[(a+b)/(ap-1b)]}=ζuw where w=b(ap-2-2ap-3b+3ap-4b2-...-(p-1)bp-2)/((ap+bp)/(a+b)).  ap-2-2ap-3b+3ap-4b2-...-(p-1)bp-2 is congruent to (a+b)p-2 modulo p, therefore 1/p does not divide w.  By Proposition (25), if ap+bp=cp, p divides c, then bp-1≡1(mod p2) and hence {bp-1/[(a+b)/(ap-1b)]}=1.  The following proposition is based on data collected for p=3;

(26)  If 2 divides b, p divides a+b, and (ap+bp)/(a+b)/p is a pth power, then p2 divides (p-1)ap-2-(p-2)ap-3b+(p-3)ap-4b2-...-bp-2 and p3 divides bp-2-2bp-3a+3bp-4a2-...-(p-1)ap-2.  If 2p divides a+b and (ap+bp)/(a+b)/p is a pth power, then p2 does not divide (p-1)ap-2-(p-2)ap-3b+(p-3)ap-4b2-...-bp-2 or bp-2-2bp-3a+3bp-4a2-...-(p-1)ap-2.

#### Vandiver's Theorem

In 1919, Vandiver proved that if ap+bp=cp, p divides c, then p3 divides c, ap-1≡1(mod p3), and bp-1≡1(mod p3).  When a is odd, Vandiver's theorem gives a necessary condition for a factor of a to be a pth power w.r.t. (ap+bp)/(a+b) (based on data collected for p=3).  Analogous results hold for b, a-b, and a+b.  The following proposition is based on data collected for p=3;

(27)  If [(ap+bp)/(a+b)]=Tp and T=Uk where U is a prime and p does not divide k, 2p divides a, b, a-b, or a+b, 2 does not divide a, q divides a, and qp-1≡1(mod p3), then q is a pth power w.r.t. (ap+bp)/(a+b).  If [(ap+bp)/(a+b)] is a pth power, 2p divides a, b, a-b, or a+b, 2 does not divide a, and q divides a, then q is a pth power w.r.t. (ap+bp)/(a+b) only if qp-1≡1(mod p3).  Analogous results hold for b, a-b, and a+b.  If [(ap+bp)/(a+b)]=Tp and T=Uk where U is a prime and p does not divide k, 2 divides a, p does not divide a, q divides a, and every prime factor of q is a pth power modulo p2, then q is a pth power w.r.t. (ap+bp)/(a+b).  Analogous results hold for b.  If [(ap+bp)/(a+b)]=Tp and T=Uk where U is a prime and p does not divide k, p divides a+b, 2 does not divide a+b, q divides a+b, and qp-1≡1(mod p3), then q is a pth power w.r.t. (ap+bp)/(a+b).  If [(ap+bp)/(a+b)] is a pth power, p divides a+b, 2 does not divide a+b, q divides a+b, and p does not divide q, then q is a pth power w.r.t. (ap+bp)/(a+b) only if qp-1≡1(mod p3).

#### Euler's Theorem and "Split" 2 and p

Euler proved that every prime of the form 6k+1 can be represented by x2+3y2.  Let T be a natural number and x, y, and z be integers.  If p=3, every prime factor of T is of the form 6k+1, and T has n such distinct prime factors, then Tp or pTp has exactly pn representations of the form (ap+bp)/(a+b).  All representations of pTp must be of the same type, that is, if (ap+bp)/(a+b) is one representation, then p divides a+b, and if ((a')p+(b')p)/(a'+b') is another representation, then p must divide a'+b'.  Representations of Tp can be of different types, that is, p can divide a, b, or a-b.  Suppose p=3, (ap+bp)/(a+b) is a representation of pTp, and 2 and p are common factors of a+b.  When p=3 and x+y=z, (xp-yp)/(x-y)=(zp+yp)/(z+y)=(zp+xp)/(z+x), so 2 must divide b' where b'=a-b and a'=a for the representation ((a')p+(b')p)/(a'+b') of pTp (and p must divide a'+b') and 2 must divide a'' where a''=a-b and b''=-b for the representation ((a'')p+(b'')p)/(a''+b'') of pTp (and p must divide a''+b'').

#### A Generalization of Vandiver's Theorem

There is some evidence that if there is one representation [(ap+bp)/(a+b)] of Tp for p>3, there must be other representations.  If ap+bp=cp, p divides c, and every prime factor of (cp-bp)/(c-b) and (cp-ap)/(c-a) is of the form p2k+1, then p3 divides c by Barlow's formulas (since ap+bp+a+b-2c=rp(Rp-1)+sp(Sp-1)).  Vandiver's theorem suggests that no prime factor of (cp-bp)/(c-b) or (cp-ap)/(c-a) can just be of the form pk+1.  Vandiver's theorem can be reformulated so that it is applicable to the problem of determining if [(ap+bp)/(a+b)] can be a pth power.  The following proposition is based on data collected for p=3;

(28)  If [(ap+bp)/(a+b)]=Tp where every prime factor of T is of the form p2k+1, p3 divides a, b, or a-b or p4 divides a+b, and 2 does not divide a, then ap-1≡1(mod p3).  If [(ap+bp)/(a+b)]=Tp where T has only one distinct prime factor, this prime factor is of the form p2k+1, p3 divides a, b, or a-b or p4 divides a+b or p3 divides a', b', or a'-b' or p4 divides a'+b' for some representation [((a')p+(b')p)/(a'+b')] of Tp, and 2 does not divide a, then ap-1≡1(mod p3).  Analogous results hold for b and a-b.  If [(ap+bp)/(a+b)]=Tp where every prime factor of T is of the form p2k+1, p3 divides a, b, or a-b or p4 divides a+b, and 2 does not divide a+b, then [(a+b)/p]p-1≡1(mod p3) if p divides a+b, or (a+b)p-1≡1(mod p3) if p does not divide a+b.  If [(ap+bp)/(a+b)]=Tp where T has only one distinct prime factor, this prime factor is of the form p2k+1, p3 divides a, b, or a-b or p4 divides a+b or p3 divides a', b', or a'-b' or p4 divides a'+b' for some representation [((a')p+(b')p)/(a'+b')] of Tp, and 2 does not divide a+b, then [(a+b)/p]p-1≡1(mod p3) if p divides a+b, or (a+b)p-1≡1(mod p3) if p does not divide a+b.  If [(ap+bp)/(a+b)]=Tp where every prime factor of T is of the form p2k+1, 2 divides a, and p does not divide a, then (a/2)p-1≡1(mod p3).  Analogous results hold for b.  If [(ap+bp)/(a+b)]=Tp where every prime factor of T is of the form p2k+1, 2 does not divide a, and p divides a+b, then ap-1≡1(mod p3).  Analogous results hold for b and a-b.

#### Congruence Properties of Prime Factors of [(ap+bp)/(a+b)] when [(ap+bp)/(a+b)] is a pth Power

That the reformulation of Vandiver's theorem depends on different representations [(ap+bp)/(a+b)] of Tp is some indication that different representations must exist for p>3 (if there are any representations).  Whether p is a pth power w.r.t. (ap+bp)/(a+b) is of importance to Vandiver's theorem. The following propositions are based on data collected for p=3;

(29)  If [(ap+bp)/(a+b)]=Tp and T=Uk where U is a prime and p does not divide k, then p is a pth power w.r.t. (ap+bp)/(a+b) if and only if p3 divides a, b, or a-b or p4 divides a+b or p3 divides a', b', or a'-b' or p4 divides a'+b' for some representation [((a')p+(b')p)/(a'+b')] of Tp.  If [(ap+bp)/(a+b)]=Tp and T=Uk where U is a prime and p divides k, then p is not a pth power w.r.t. (ap+bp)/(a+b).  If [(ap+bp)/(a+b)]=Tp where T has two distinct prime factors, 2p divides a, b, a-b, or a+b, and p is a pth power w.r.t. (ap+bp)/(a+b), then p3 divides a, b, or a-b or p4 divides a+b.

(30)  If [(ap+bp)/(a+b)] is a pth power, then pp-1a is a pth power w.r.t. (ap+bp)/(a+b) if 2p divides a, pp-1b  is a pth power w.r.t. (ap+bp)/(a+b) if 2p divides b, pp-1(a-b) and a+b are pth powers w.r.t. (ap+bp)/(a+b) if 2p divides a-b, or a-b and p(a+b) are pth powers w.r.t. (ap+bp)/(a+b) if 2p divides a+b.

(31)  If [(ap+bp)/(a+b)] is a pth power, 2 divides a, and p does not divide a, then a is a pth power w.r.t. (ap+bp)/(a+b).  Analogous results hold for b.

(32)  If [(ap+bp)/(a+b)] is a pth power, f is a prime factor of [(ap+bp)/(a+b)] of the form p2k+1, and p is not a pth power modulo f, then (1) pp-1a, pp-1b, pp-1(a-b), and a+b are pth powers modulo f if p divides a, b, or a-b, or (2) a, b, a-b, and p(a+b) are pth powers modulo f if p divides a+b.  If [(ap+bp)/(a+b)] is a pth power, f is a prime factor of [(ap+bp)/(a+b)] of the form p2k+1, and p is a pth power modulo f, then a, b, a-b, and a+b are pth powers modulo f.

(33)  If [(ap+bp)/(a+b)] is a pth power,  f is a prime factor of [(ap+bp)/(a+b)] not of the form p2k+1, and p is not a pth power modulo f, then (1) pp-1a, b, p(a-b), and pp-1(a+b), or pp-1a, pb, a-b, and p(a+b) are pth powers modulo f if 2p divides a, or (2) a, pp-1b, p(a-b), and pp-1(a+b), or pa, pp-1b, a-b, and p(a+b) are pth powers modulo f if 2p divides b, or (3) a, pb, pp-1(a-b), and a+b, or pa, b, pp-1(a-b), and a+b are pth powers modulo f if 2p divides a-b, or (4) pa, pp-1b, a-b, and p(a+b), or pp-1a, pb, a-b, and p(a+b) are pth powers modulo f if 2p divides a+b.

(34)  If [(ap+bp)/(a+b)] is a pth power, 2 divides a, p does not divide a, f is a prime factor of [(ap+bp)/(a+b)] not of the form p2k+1, and p is not a pth power modulo f, then a, pb, pp-1(a-b), and a+b, or a, pp-1b, p(a-b), and pp-1(a+b) are pth powers modulo f.  Analogous results hold for b.

Since Propositions (30), (32), (33), and (34) are based solely on data collected for p=3, their form is ambiguous in that the p exponents might be 2 instead of p-1.  Congruence properties of the prime factors of [(ap-bp)/(a-b)] when [(ap+bp)/(a+b)] is a pth power appear to determine the form of Propositions (30), (32), (33), and (34).  (Propositions (30), (32), (33), and (34) can be transformed into Propositions (12), (8), (14), and (9) respectively by multiplying the a, b, a-b, and a+b terms by p and switching the a+b and a-b terms [and of course the moduli bases].  This is just an attempt to find a simple relationship between the congruence properties of the prime factors of [(ap+bp)/(a+b)] and [(ap-bp)/(a-b)] when [(ap+bp)/(a+b)] is a pth power and has no apparent logical basis.)

(35)  If [(ap+bp)/(a+b)] is a pth power, f is a prime factor of [(ap+bp)/(a+b)] not of the form p2k+1, and p is a pth power modulo f, then (1) a (and not b, a-b, or a+b) is a pth power modulo f if 2 divides a, or (2) b (and not a, a-b, or a+b) is a pth power modulo f if 2 divides b, or (3) a-b and a+b (and not a or b) are pth powers modulo f if 2 divides a-b or a+b.

As shown previously, ap+bp=cp, p divides c, implies c, pb, and c-b are pth powers w.r.t. (cp-bp)/(c-b), c, pa, and c-a are pth powers w.r.t. (cp-ap)/(c-a), and 2 and p are common factors of c (if the reformulated version of Furtwängler's theorem is accepted).  Then by Propositions (33) and (35), every prime factor of (cp-bp)/(c-b) and (cp-ap)/(c-a) must be of the form p2k+1. (Substituting c for a and -b for b in Proposition (33) gives pp-1c, -b, p(c+b), and pp-1(c-b), or pp-1c, -pb, c+b, and p(c-b) are pth powers modulo f [a prime factor of (cp-bp)/(c-b)] if 2p divides c and p is not a pth power modulo f [a contradiction].  Substituting c for a and -b for b in Proposition (35) gives c [and not c-b] is a pth power modulo f if 2p divides c and p is a pth power modulo f [a contradiction].  Analogous results follow by substituting c for a and -a for b in Propositions (33) and (35).)  Furthermore, by Proposition (32), p must be a pth power w.r.t. (cp-bp)/(c-b) and (cp-ap)/(c-a).  As shown previously, ap+bp=cp, p divides c, implies a, b, and p(a+b) are pth powers w.r.t. (ap+bp)/(a+b), and every prime factor of [(ap+bp)/(a+b)] is of the form p2k+1. This gives the following proposition;

(36)  If ap+bp=cp where p divides c, then every prime factor of (cp-bp)/(c-b) is of the form p2k+1 and c, b, c-b, c+b, and p are pth powers w.r.t. (cp-bp)/(c-b).  Analogous results hold for (cp-ap)/(c-a).  If ap+bp=cp where p divides c, then every prime factor of [(ap+bp)/(a+b)] is of the form p2k+1 and a, b, a-b, and p(a+b) are pth powers w.r.t. (ap+bp)/(a+b).

More evidence for the above proposition is given by the following three propositions (based on data collected for p=3, 5, and 7);

(37)  If every prime factor of [(ap+bp)/(a+b)] is of the form p2k+1 and p2 divides a, b, a-b, or a+b, then ap-1≡1(mod p2) if p does not divide a, bp-1≡1(mod p2) if p does not divide b, and (a-b)p-1≡1(mod p2) and (a+b)p-1≡1(mod p2) if p does not divide a-b or a+b.

(38)  If a, pb, and a+b are pth powers w.r.t. (ap+bp)/(a+b) and p2 divides a, then b, a+b, and a-b are pth powers modulo p2.  If p=3 or 5,  a, pb, and a+b are pth powers w.r.t. (ap+bp)/(a+b), and p2 divides a, b, a-b, or a+b, then a-b is a pth power w.r.t. (ap+bp)/(a+b) if and only if p is a pth power w.r.t. (ap+bp)/(a+b).

(39)  If a, b, and p(a+b) are pth powers w.r.t. (ap+bp)/(a+b) and p2 divides a or b, then a+b and a-b are pth powers modulo p2.  If p=3, a, b, and p(a+b) are pth powers w.r.t. (ap+bp)/(a+b), and p2 divides a, b, a-b, or a+b, then a-b is a pth power w.r.t. (ap+bp)/(a+b).

Substituting c for a and -b for b in Proposition (14) gives p2(c-b) is a pth power modulo f (a prime factor of (cp+bp)/(c+b) not of the form p2k+1) if 2p divides c and p/2 is a pth power modulo f, or p(c-b) is a pth power modulo f if 2p divides c and 2p is a pth power modulo f.  Then if c-b is a pth power, p must be a pth power modulo f and hence by Proposition (7), 2 cannot be a pth power modulo f (otherwise, 2p would be a pth power modulo f).  As shown previously, ap+bp=cp implies 2 is a pth power w.r.t. (cp+bp)/(c+b). This gives the following proposition;

(40)  If ap+bp=cp where p divides c, then every prime factor of (cp+bp)/(c+b) is of the form p2k+1 and c, b, p(c+b) and c-b are pth powers w.r.t. (cp+bp)/(c+b).  Analogous results hold for (cp+ap)/(c+a).

The following proposition is based on data collected for p=3;

(41)  If [(ap+bp)/(a+b)] is a pth power and f is a prime factor of [(ap+bp)/(a+b)], then at least one of 2p, 2, p, or p/2 is a pth power modulo f.

The following propositions are based on data collected for p=3, 5, and 7;

(42)  If p is a pth power w.r.t. (ap+bp)/(a+b), then p2 divides a if p divides a, p2 divides b if p divides b, or p2 divides a-b if p divides a-b.  If p>3 and p is a pth power w.r.t. (ap+bp)/(a+b), then p2 divides a+b if p divides a+b.  If p=3 and p is a pth power w.r.t. (ap+bp)/(a+b), then p3 divides a+b if p2 divides a+b.

When p is a pth power w.r.t. (ap+bp)/(a+b) and [(ap+bp)/(a+b)] is not prime, the "small" prime factors of [(ap+bp)/(a+b)] are not of the form p2k+1.  For example, of the 2517 prime factors (not necessarily distinct) of [(ap+bp)/(a+b)] for the 1175 (a, b) such that p is a pth power w.r.t. (ap+bp)/(a+b), [(ap+bp)/(a+b)] is not prime, and 1000≥a>b≥1 for p=7, only 214 prime factors are of the form p2k+1 and the smallest of these prime factors is 15877.  When p=3 and p is a pth power w.r.t. (ap+bp)/(a+b), the three smallest prime factors of [(ap+bp)/(a+b)] of the form p2k+1 are 73, 271, and 307.

(43)  If p=3, a, b, a-b, and a+b are pth powers w.r.t. (ap+bp)/(a+b), p2 divides a, b, a-b, or a+b, and [(ap+bp)/(a+b)] is not prime, then every prime factor of [(ap+bp)/(a+b)] equals [((a')p+(b')p)/(a'+b')] where p2 divides a', b', a'-b', or a'+b'.  (The smallest possible prime factor of [(ap+bp)/(a+b)] satisfying these conditions is 73; the requirement that p2 divides a', b', a'-b', or a'+b' eliminates about 2/3 of the primes of the form p2k+1 from consideration.)

For the 13208764 (a, b) such that 50000a>b≥1, a, b, a-b, and a+b are pth powers w.r.t. (ap+bp)/(a+b), and p2 divides a, b, a-b, or a+b for p=3, the numbers of instances where [(ap+bp)/(a+b)] has 1, 2, 3, and 4 prime factors (not necessarily distinct) are 12585008, 615167, 8518, and 71 respectively.  [(ap+bp)/(a+b)] is a square in 624 instances, a cube in 27 instances, and a fourth power in 3 instances.  For larger upper bounds of the a, b values, the proportions of the numbers of instances where [(ap+bp)/(a+b)] has 2, 3, and 4 prime factors increase, so there should eventually be a value of [(ap+bp)/(a+b)] having 5 or more prime factors.

(44)  If p=3, a, b, a-b, and p(a+b) are pth powers w.r.t. (ap+bp)/(a+b), p is not a pth power w.r.t. (ap+bp)/(a+b), p2 divides a, b, a-b, or a+b, and [(ap+bp)/(a+b)] is not prime, then every prime factor of [(ap+bp)/(a+b)] equals [((a')p+(b')p)/(a'+b')] where
p2 does not divide a', b', a'-b', or a'+b'.

For the 1316973 (a, b) such that 25000a>b≥1, a, b, a-b, and p(a+b) are pth powers w.r.t.(ap+bp)/(a+b), p is not a pth power w.r.t. (ap+bp)/(a+b), and p2 divides a, b, a-b, or a+b for p=3, the numbers of instances where [(ap+bp)/(a+b)] has 1, 2, 3, 4, 5, and 6 prime factors are 712815, 573912, 29149, 1002, 88, and 7 respectively.  [(ap+bp)/(a+b)] is a square in 112 instances, a cube in 9 instances, and a fourth power in 2 instances.

If p=5, 5000≥a>b≥1, a, b, a-b, and a+b are pth powers w.r.t. (ap+bp)/(a+b), and p2 divides a, b, a-b, or a+b, then [(ap+bp)/(a+b)] has at most two prime factors.  If p=7, 500≥a>b≥1, a, b, a-b, and a+b are pth powers w.r.t. (ap+bp)/(a+b), and p2 divides a, b, a-b, or a+b, then [(ap+bp)/(a+b)] is prime.  If p=5, 5000≥a>b≥1, a, b, a-b, and p(a+b) are pth powers w.r.t. (ap+bp)/(a+b), p is not a pth power w.r.t. (ap+bp)/(a+b), and p2 divides a, b, a-b, or a+b, then [(ap+bp)/(a+b)] has at most three prime factors.  If p=7 and 500≥a>b≥1, there do not exist (a, b) such that a, b, a-b, and p(a+b) are pth powers w.r.t. (ap+bp)/(a+b), p is not a pth power w.r.t. (ap+bp)/(a+b), and p2 divides a, b, a-b, or a+b.  For p=5, the prime factors of [(ap+bp)/(a+b)] when a, b, a-b, a+b are pth powers w.r.t. (ap+bp)/(a+b) and p2 divides a, b, a-b, or a+b are different from the prime factors of [(ap+bp)/(a+b)] when a, b, a-b, and p(a+b) are pth powers w.r.t. (ap+bp), p is not a pth power w.r.t. (ap+bp)/(a+b), and p2 divides a, b, a-b, or a+b, the same as for p=3.  For p=3, this was due to the representations of the prime factors.  This is some indication that representations (of the form [(ap+bp)/(a+b)]) of the prime factors are still relevant for p>3.  A table giving the factorization of [(ap+b)/(a+b)] when a, b, a-b, and a+b are pth powers w.r.t. (ap+bp)/(a+b) and p2 divides a, b, a-b, or a+b for p=5 is out43p5.  For p=5 and 5000≥a>b≥1, there are 25287 prime values of [(ap+bp)/(a+b)] where the (a, b) values satisfy these conditions.  A table giving the factorization of [(ap+b)/(a+b)] when a, b, a-b, and p(a+b) are pth powers w.r.t. (ap+bp)/(a+b), p is not a pth power w.r.t. (ap+bp)/(a+b), and p2 divides a, b, a-b, or a+b for p=5 is out44p5.  There are no prime values of [(ap+bp)/(a+b)] where the (a, b) values satisfy these conditions.

#### References

1810 Barlow, P.
Demonstration of a curious numerical proposition. J. Nat. Phil. Chem. and Arts, 27, 1810, 193-205.

1909 Wieferich, A.
Zum Letzten Fermat'schen Theorem. J. reine u. angew. Math. 136, 1909, 293-302.

1911 Mirimanoff, D.
Sur le dernier théorème de Fermat. J. reine u. angew. Math., 139, 1911, 309-324.

1912 Furtwängler, P.
Letzter Fermatschen Satz und Eisensteins'ches Reziprozitätsgesetz. Sitzungsber, Akad. d. Wiss. Wein., Abt. IIa, 121, 1912, 589-592.

1919 Vandiver, H. S.
A property of cyclotomic integers and its relation to Fermat's last theorem. Annals of Math., 21, 1919, 73-80.

1970 Hasse, H.
Bericht über neuere Undersuchungen und Probleme aus der Theorie der algebraischen Zahlkörper. Teil I: Klassenkörperietheorie. Teil Ia: Beweise zu Tiel I; Teil II: Reziprozitätsgesetz. 3. Aufl.. Wurzburg Wien: Physika-Verlag. 204 pp. Jbuch 52-150; 53, 143; 46-165

Software

The above propositions were confirmed using MSVC++™ and C and assembly language code for the TMS320C64™ digital signal processing chip.  Readers may copy and modify the software in this section.  No guarantee is made that it is error-free.

Use test1p to find solutions of [(a3+b3)/(a+b)]=T3.  Subroutines used are bigbigd, bigbigp, bigbigq, bigbigs, bigprod, bigresx, carry, comfact, depower, differ, dloop, dummy, eloop, euclid, furcond, furtest, hugeprod, hugeres, lmbd, midprod, product, quotient, search, search1, lshift, sum, newprod, and table0a.  The main use of this C program is to debug the corresponding TMS320C64 assembly language; the program is too slow to be practical.  (The C64 assembly language [with a C driver, batch file, and link-control file] is at c64asm.)  To reduce execution time, the "weak" Furtwängler conditions are assumed to be applicable.  A simpler program without this stipulation is test1r.  A prime look-up table used is table0c.  Solutions of [(a3+b3)/(a+b)]=T3 are given in table3b, table4b, table6b, and table7b.  An entry gives (a, b) and the number of distinct prime factors of [(a3+b3)/(a+b)].  An improved program for finding solutions of [(a3+b3)/(a+b)=T3 is test0n.  Include files are table0an and table2n.  More solutions of [(a3+b3)/(a+b)]=T3 are given at table9n , table8n, and table11a.  Use prop32e to verify propositions concerning linear combinations of a and b.  A prime look-up table used is tablel9.  Use prop32fn to verify these propositions for a larger dynamic range of linear combinations of a and b.  New subroutines used are bignewp and hugeresx.  Use newprop to check coverage of generators of solutions of [(a3+b3)/(a+b)]=T3.  A 64-bit OS is required.  Use prop5a, prop5b, and prop5c to verify Proposition 5.  A prime look-up table used is table10.  Use prop6 to verify Propositions 3, 6, 12, and 13.  Use prop8 to verify Propositions 3, 4, 7, 8, 9, 11, 12, 13, 14, and 15.  Look-up tables used are table4a, table6a, and table7a.  Use prop10 to verify Propositions 10 and 11.  Use prop16 to verify Proposition 16.  Use prop17 to verify Proposition 17.  A prime look-up table used is table9.  Use prop18 to verify Proposition 18.  Use prop19 to verify Proposition 19.  Use prop20 to verify Proposition 20.  Use prop22a, prop22a1, prop22a2, prop22a3, prop22b, prop22b1, prop22b2, prop22b3, prop22c, prop22c1, prop22c2, and prop22c3 to verify Proposition 22.  Look-up tables used are table92table94 and table95.  Use prop23a and prop23b to verify Proposition 23.  Prime look-up tables used are table11 and table12.  Use prop24 to verify Proposition 24.  Use prop25 to verify Proposition 25.  Use prop18q to verify Proposition 26.  Use prop28a, prop28b, prop28c, prop28d, prop28e, and prop28f to verify Propositions 27 and 28.  A prime look-up table used is table0b.  Use prop32a, prop32b, and prop32c to verify Propositions 26, 29, 30, 31, 32, 33, 34, 35, and 41.   Use prop37 to verify Proposition 37.  Use prop38a and prop38b to verify Proposition 38.  Use prop39a and prop39b to verify Propositions 39.  Use prop42 to verify Proposition 42.  Use prop43  to verify Proposition 43.  Use prop44 to verify Proposition 44.