An ordered triple of pairwise distinct real numbers ( a , b , c ) is called tripping if it satisfies ⎩ ⎪ ⎨ ⎪ ⎧ 3 a + b = a 3 , 3 b + c = b 3 , 3 c + a = c 3 .
How many tripping triples are there?
Details and assumptions
A set of values is called pairwise distinct if no two of them are equal. For example, the set { 1 , 2 , 2 } is not pairwise distinct, because the last 2 values are the same.
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.
Very nice!
Addition: the solutons are pairwise distinct, because if a = 2 R e ( x ) then b = 2 R e ( x 3 ) , which only are equal for x = 1 , i , − 1
@Nihar Mahajan how did you do it?
Log in to reply
Sorry Adarsh , but I have solved it many days ago , so I can't remember it. I think it was similar to the solution given above...
If ∣ a ∣ > 2 then ∣ a 2 − 3 ∣ > 1 , and so ∣ a 3 − 3 a ∣ > ∣ a ∣ . Thus ∣ b ∣ > ∣ a ∣ > 2 , and hence ∣ c ∣ > ∣ b ∣ > ∣ a ∣ and finally ∣ a ∣ > ∣ c ∣ > ∣ a ∣ , which is impossible. Thus ∣ a ∣ ≤ 2 , so we can write a = 2 cos α . But then b = 2 cos 3 α and c = 2 cos 9 α , and we know that 2 cos α = a = c 3 − 3 c = 2 cos 2 7 α so that 0 = cos 2 7 α − cos α = − 2 sin 1 4 α sin 1 3 α Thus possible values of α are 1 4 k π for 0 ≤ k ≤ 1 4 and 1 3 m π for 0 ≤ m ≤ 1 3 . Other values of k and m merely repeat the possible values of a = 2 cos α .
We must have a = b (if a = c or b = c the cyclic nature of the definition would force a = b ). Thus we want 0 = cos 3 α − cos α = − 2 sin 2 α sin α and so we have to exclude α = 0 , 2 1 π , π from the above lists. Thus possible values of a are 2 cos 1 4 k π for 1 ≤ k ≤ 6 or 8 ≤ k ≤ 1 3 and 2 cos 1 3 m π for 1 ≤ m ≤ 1 2 Since 1 3 and 1 4 are coprime, these values are distinct. Thus there are 1 3 + 1 2 − 1 = 2 4 possible values of a , each of which determine the corresponding values of b and c .
Very nice!
Problem Loading...
Note Loading...
Set Loading...
Write a = x + x 1 , b = y + y 1 and c = z + z 1 for complex x , y , z . Then we have:
b = a 3 − 3 a = x 3 + x 3 1 , c = y 3 + y 3 1 , a = z 3 + z 3 1 .
Thus, this gives x + x 1 = x 2 7 + x 2 7 1 . Next, we use the following fact (whose proof we omit, since it's easy):
Thus, we conclude that x = x 2 7 or x = x − 2 7 . Now x = 0 so x is a 26-th or 28-th root of unity. So a = x + x 1 = 2 Re ( x ) and replacing x by x − 1 if necessary, we shall assume Im ( x ) ≥ 0 .
Now, if x = ± 1 , then a = b = c = ± 2 so this solution is not pairwise distinct.
Likewise, for x = i , we have a = b = c = 0 which is omitted.
For the remaining solutions, we have:
This gives 24 solutions.