Statement
Setting (pp. 39--40 and 44). A solution of xxyy=zz is written in the
shape (4) (see
Lemma 1) with
pairwise coprime q0,q1,…,qn>1, where q0 divides x and z but
not y. Since min{αs,βs}<γs≤max{αs,βs},
the proof (p. 44) orders the indices so that, with integers
ai,bj,ci,cj≥0,
α0=γ0+a,αi=βi+ai,γi=βi+ci(i=1,…,t),
βj=αj+bj,γj=αj+cj(j=t+1,…,n),
and sets (16)
ai′=ai−ci,bj′=acjγ0+cj−bj,ci′=ci−aai−ciγ0.
Lemma 2 (pp. 43--44). If x,y,z do not have the same prime divisors,
then
x=AmBn,y=Bn−1,z=Am−1Bn,
where
A=mm−1,B=i=1∏tqici′j=t+1∏nqjbj′,m=aα0,n=α0α0/a−Baγ0γ0/aα0α0/a,
and (14)
α0=j=t+1∏nqjcj,γ0=q0ai=1∏tqiai−ci,α0−γ0=a.
The print uses the letter n both for the number of factors q1,…,qn
and for the exponent defined in the lemma.
Proof pointer
P. 44. Solving the relations of (4) for γ0, βi and αj
gives the system (15); the coprimality (α0,γ0)=1 then yields
the expressions for α0 and γ0 in (14). With the quantities
(16) and D=α0α0/a−Baγ0γ0/a the paper writes
every exponent of (4) in the form (17), and substituting (17) into (4)
gives (14).
Read depth
Claims checked: the statement, the notation it draws from the proof, and
the outline of the proof were read clause by clause on the page images of
the print. The algebra from (15) to (17) was not rederived. Nothing here is
independently reviewed.
Dependencies
None.
Source. V. A. Demʹjanenko, On a conjecture of A. Schinzel, Izv. Vysš.
Učebn. Zaved. Matematika 1975, no. 8 (159), 39--45; the edition read is
named on the
source card.
Bears on
- Problem 674: the
lemma describes the form a solution of xxyy=zz with x,y,z>1 would
take if x, y, z did not have the same prime divisors, as a step of
the paper's proof that this does not happen; it does not address whether
solutions exist.