We know But there are some students who claim that Which is obviously incorrect. But not really, since it is true for some triplets of integers, . If and , find the number of possible triplets.
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.
Case 1: a=0
Obvious solutions are when a = 0 , then the RHS is always 0 . ⇒ 0 m − n = 0 . But we note that 0 m − n is undefined when m − n ≤ 0 . Then the acceptable cases are when m > n . As m , n ∈ [ 1 , 1 0 ] , then the number of acceptable cases is m − 1 for an m .
Then total number of cases for a = 0 : m = 1 ∑ 1 0 ( m − 1 ) = i = 1 ∑ 9 i = 2 9 ( 9 + 1 ) = 4 5
Case 2: a = 2
We note that a = 1 cannot have solution, because RHS is always 0 but the LHS is always 1 .
We note that for a > 1 , m > n is necessary for an integer solution. Therefore the minimum acceptable m = 2 . When a = 2 , LHS=RHS, when m = 2 and n = 1 ⇒ 2 2 − 1 = 2 2 − 2 1 = 2 . For m > 2 , LHS < RHS. For a > 2 , LHS < for all m ≥ 2 .
Therefore, there are altogether is 4 5 + 1 = 4 6 .