Find three times the sum of the absolute values of the rational numbers a , for which x 3 − x − a 3 is reducible over the rationals.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
It would be interesting if there is a way of handling x 3 + y 3 = 2 z 3 by working in Z(1), but that would probably be even bigger than the Z ( ϱ ) one.Nevertheless, I am curious if someone can provide me one.Also, I have been wondering if all the solutions of x p + y p = 2 z p are x=y=z,p>2.It is true for the cases p=3,4, but for bigger p we probably should work in cyclotomic fields, which are pretty complicated, so I don't think that would be possible, except maybe for regular primes.It looks close to FLT, so maybe it can be solved by elliptic curves as well?
We will work in the field Z ( − 3 ) , where the units are ± 1 , ± ϱ , ± ϱ 2 , N ( a + b ϱ ) = a 2 + a b + b 2 .
Theorem (You can skip this if you don't understand it): The equation ξ 3 + η 3 = 2 ζ 3 has no solutions in the ring Z [ − 3 + 1 / 2 ] with ξ η ζ = 0 , except ξ = η = ζ
P r o o f :We will consider the more general equation ξ 3 + η 3 + 2 ϵ ζ 3 = 0 , where epsilon is a unit.Let us call N ( ξ η ζ ) the h e i g h t of the solution ξ , η , ζ .The height is a positive number.A height of 1 is obtained when the numbers are ± 1 .Now let's assume the triple gives us the smallest height >1.Our three numbers are pairwise coprime.Now let us denote the numbers ξ + η , ϱ ξ + ϱ 2 η and ϱ 2 ξ + ϱ η by α , β , γ in some order.Then
α + β + γ = 0 and α β γ = − 2 ϵ ζ 3 .If δ is the gcd of alpha and beta, then ( δ α , δ β ) = 1 = ( δ α , δ γ ) = ( δ γ , δ β ) .
Thus δ α = ϵ 1 . ξ 1 3 , δ β = ϵ 2 η 1 3 , δ γ = 2 ϵ 3 ζ 1 3 and δ ζ = ξ 1 η 1 ζ 1 , where ξ 1 , η 1 , ζ 1 are pairwise coprime and the epsilons are units.Using the fact that α + β + γ = 0 and by multiplying by ϵ 1 − 1 , we arrive at
ξ 1 3 + ϵ 4 η 1 3 + 2 ϵ 5 ζ 3 = 0 .Observing modulo 2, we would have that a cube is congruent to a unit.But that is only possible when that unit is ± 1 .But ± 1 is a cube.Thus we have that
ξ 1 3 + ( ± η 1 ) 3 + 2 ϵ 5 ζ 3 = 0 .But that is an equation of the previous type.So we must have, by the minimality of the height of ξ η ζ , that either
N ( ξ 1 η 1 ζ 1 ) = N ( δ ζ ) ≥ N ( ξ η ζ ) or that N ( ξ 1 η 1 ζ 1 ) = N ( δ ζ ) = 1 .In the first case we will have that N ( ξ η δ ) = 1 making all the numbers ξ , η , δ units, but then ζ must be a unit too,so our minimal height would be 1, contrary to our hypothesis that it is >1.
Now let's observe the second case.Since δ ∣ α − ϱ β , δ ∣ α − ϱ 2 β , then it must divide ( 1 − ϱ ) ξ and ( 1 − ϱ ) η .But ( ξ , η ) = 1 , so delta is either a unit, or associated to the prime 1 − ϱ .But from N ( δ ζ ) = 1 , we have that ζ is associated with δ .But if ( 1 − ϱ ) divides ζ , it must be that ( 1 − ϱ ) 2 divides ζ , contrary to them being associates(this follows, because the cubic residues mod ( 1 − ϱ ) 4 are -1,0 and 1).So we have that δ and ζ are units, from which it follows that α and β are units.But then ( 1 − ϱ ) . ξ and ( 1 − ϱ ) . η are the sum of two units.But it is seen that this is only possible when ξ and η are units.But then our starting height must be 1, which is false.Thus the only solutions,where the three numbers are coprime and nonzero, are 1 , 1 , 1 and − 1 , − 1 , − 1 .Thus every nonzero solutions is obtained when the three numbers are equal.
Q . E . D
Now that we have finished proving this monstrosity, let's start with the problem (It starts now lol).Assume it is reducible.Then
x 3 − x − a 3 = ( x 2 + α . x + β ) ( x + γ )
Comparing coefficients, we get that α = − γ , β + α γ = − 1 and γ β = − a 3 .Thus β = α 2 − 1 and α β = a 3 .So we get that α ( α 2 − 1 ) = a 3 Now let's substitute α = n m and a = q p .We get the equation ( m 3 − m n 2 ) . q 3 = p 3 n 3 .But ( p , q ) = 1 , so q 3 ∣ n 3 , leading to q ∣ n .If q is not equal to n, but smaller, there would exist a prime s, dividing n, but not q.The prime s would divide m 3 − m n 2 , so s ∣ m , which is a contradiction, because ( m , n ) = 1 .So n = q and thus we have the equation m 3 − m n 2 = p 3 , where the triple is pairwise coprime.
( m − n ) m ( m + n ) = p 3
Case 1:m and n are incongruent modulo 2.Thus the three factors of the LHS are coprime, so
m − n = A 3 , m = B 3 , m + n = C 3 .Solving this system, we get 2 m = 2 B 3 = A 3 + C 3 and 2 n = C 3 − A 3 .But from the equation for 2m we would have that either B=0,A=-C, or A=B=C.the first case we would have that m=0, so α = 0 and a=0, which is a solution.In the second case, n=0, but that is impossible, since it is the denominator of α .
Case 2:m and n are both odd.
Here we would have that ( m − n , m , m + n ) = ( 4 A 3 , B 3 , 2 C 3 ) ,where A,B and C are coprime.WLOG m − n = 4 A 3 , m = B 3 , m + n = 2 C 3 .We can do this, because it doesn't matter if q is negative or positive.Solving this, we get that m = 2 A 3 + C 3 = B 3 and n = C 3 − 2 A 3 .In the equation for have that 2 A 3 = B 3 + ( − C ) 3 .So we would have that A=B=-C, or that B=C,A=0.In the first case we would have that A = B = ± 1 and C is their opposite, because A,B and C are coprime.This tells us that m = ± 1 and n = ∓ 3 , which in turn gives that α = 1 / 3 , − 1 / 3 , so a = 2 / 3 , − 2 / 3 .In the second case we would have that B = C = ± 1 , so m = 1 and n = ± 1 , so α = ± 1 , which means that a=0.
So all the solutions are a = 0 , 2 / 3 , − 2 / 3 , where it is obvious that x=1/3 or -1/3 would be roots
Oh wow, this is impressive!
Log in to reply
Yeah, it's gigantic.Fermat's Last Theorem for n=3 can be proved by using similar methods.So imagine how big Kummer's proof for regular primes must be.Not to mention Wiles's, which proves it for all primes.
Are you a member of the Bulgarian Maths Olympiad team or do you hope to be ?
Log in to reply
No, Im only 15 :D.And I am really bad at Geometry.But I really hope I get picked when I'm a bit older.
Problem Loading...
Note Loading...
Set Loading...
Mine is probably equivalent to Bogdan's, but I cheated a little.
Let x = p / q with p , q relatively prime. Write p ( p 2 − q 2 ) = ( a q ) 3 and note that the two factors on the left are relatively prime, so they're both cubes. Write p = r 3 . Write b = a q / r . Then we get r 6 − q 2 = b 3 , so q 2 + b 3 = r 6 .
This is a well-studied equation. The solutions are
( 0 , k 2 , ± k ) : this leads to a denominator of 0 , so forget this
( ± k 3 , − k 2 , 0 ) : this corresponds to x = 0 , so a = 0 .
( ± 3 k 3 , − 2 k 2 , ± k ) : this gives a = ± 2 / 3 , x = ∓ 1 / 3 .
So the answer is 4 .
Of course, this is a cheat because deriving the complete solution set to the Diophantine equation above requires arithmetic in Z [ − 3 ] as in Bogdan's solution.