Ch2.0.12 — Of the Transformation of the Formula into Squares, and higher Powers

Summary: Asks when can be made a perfect -th power for chosen integers . Even powers require (or knowledge of one representation case). Odd powers always work for any . The technique sets and reads off from rational and irrational parts. Yields explicit polynomial parametrizations for squares, cubes, biquadrates, and fifth powers, with worked examples like , , , and the subtle Pell-related case that escapes the basic parametrization.

Sources: chapter-2.0.12

Last updated: 2026-05-09


Setup and a Reduction (§181)

If is to be a square (or higher even power), the formula can typically be rewritten with leading coefficient . Example: , so by setting , it becomes with , . Henceforth focus on .


Squares: (§182–185)

Set and conjugate. Multiplying:

Reading parts:

For , take :

This recovers the parametrizations Euler had derived in ch1.4.5-pure-quadratic-equations and ch2.0.4-surd-rationalization by direct substitution . Either method gives the same .

Determinate cases (§185)

ParametrizationIdentity
,
,
or , etc.
,
or

When factors as , each factorization gives a parametrization — directly tied to the Type-I/Type-II decomposition from ch2.0.11-quadratic-form-factorization.

Need a Seed When (§186)

For , one must know a starting case . Then the substitution

converts into — exactly the Type II form, where the -coefficient has vanished. Then the general parametrization above applies with .


Cubes: (§187–193)

Now set and conjugate. Cubing:

Reading parts:

with .

Crucially, this works for any (no seed needed). Odd powers always succeed; even powers do not, in general — see §200 below.

Sums of Two Squares as Cubes (§188)

With : , . Example: gives : .

as a Cube (§189)

With : , . Euler’s table:

1180
21109
123518
31024
138072
328130
2315445

Question 1 (§192):

Solve in . Trying : gives , , so . Trying : gives , more carefully , so . The only solutions are () and ().

Question 2 (§193):

Use : , . Solve , requiring , so , , giving , . Hence the unique solution in integers.

Question 4 (§195–196): — A Subtle Failure

Setting : , . Forcing gives no integer (or even rational) solution. And yet works: .

The issue: when , the auxiliary form becomes , which can equal infinitely often (Pell, pell-equation: ; ; …). So the cube can be hidden as a Pell-multiple:

Splitting and reading parts gives a richer family. With we get the equation , which has many more solutions.

This explains the case and signals that for negative , the basic parametrization is incomplete. (§197 emphasizes this caveat.)


Biquadrates (Fourth Powers) (§198–200)

Set . Expanding:

For (): , .

21724
32119120

Even powers always require an existing square representation (so essentially ); see §200.


Fifth Powers (§201)

Set . Expanding:

For (): , .

Example: : , : .


Odd vs Even: The Asymmetry (§200–201)

Stated cleanly:

  • Even powers : becomes a -th power only if it is already reducible to a square; equivalently after reduction. A seed solution is needed when .
  • Odd powers : Always achievable for any via the -th-power-of-conjugate construction.

The reason: odd-power expansion never produces a constant term that must vanish independently; even-power expansion does, forcing seeded constraints.


Why the Method Is “Remarkable” (§191)

Euler dwells on the meta-point: the construction proves integer identities by manipulating imaginary quantities. He notes a caveat: the principle “if a product is a power, each factor is a power up to a unit” requires no nontrivial common divisors among the factors. For genuine imaginaries , this is automatic when . But when , the factors and are real and can share a divisor (e.g., when both are odd), so the method needs the modified ansatz , , giving .

This is an early instance of the failure of unique factorization — the same gap that subtly affects Euler’s proof of Fermat’s Last Theorem (see sum-of-two-cubes).


Method Summary Table

PowerAnsatz
2, scaled by (only when unseeded)
3
4, requires
5