For how many triplets ( x , y , z ) of non-negative integers do we have n x + n y = n z , where n z is a natural number not greater that 2014?
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.
The triplets are ,
2 0 + 2 0 = 2 1
Triplet = (0,0,1)
2 1 + 2 1 = 2 2
Triplet = (1,1,2)
2 2 + 2 2 = 2 3
Triplet = (2,2,3)
2 3 + 2 3 = 2 4
Triplet = (3,3,4)
And so on till,
2 9 + 2 9 = 2 1 0
Triplet = (9,9,10)
Hence , total number of triplets is 1 0 .
But how will you prove that these are the only solutions?
Problem Loading...
Note Loading...
Set Loading...
Check 3 cases.
1 + n y − x = n z − x
The only natural number powers different by one are 2 0 and 2 1 , hence n = 2 , x − y = 0 , z − x = 1 , which means equality holds if and only if the triplets are ( x , x , x + 1 ) , where 0 ≤ x ≤ 9 (we have z = x + 1 ≤ 1 0 because of the restriction 2 z ≤ 2 0 1 4 ). There are 1 0 such triplets.
min ( x , y , z ) = y leads to the same triplets.
min ( x , y , z ) = z . Divide both sides by n z .
n x − z + n y − z = 1
But we have x − z ≥ 0 , y − z ≥ 0 , hence 1 = n x − z + n y − z ≥ 2 , impossible.
All the cases add up to 1 0 different triplets.