Indices Mistake-2

Algebra Level 5

We know a m n = a m ÷ a n a^{m-n}=a^m\div a^n But there are some students who claim that a m n = a m a n a^{m-n}=a^m-a^n Which is obviously incorrect. But not really, since it is true for some triplets of integers, a , m , n a,m,n . If a [ 0 , 10 ] a\in[0,10] and m , n [ 1 , 10 ] m,n\in[1,10] , find the number of possible triplets.


The answer is 46.

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.

1 solution

Case 1: a=0

Obvious solutions are when a = 0 a=0 , then the RHS is always 0 0 . 0 m n = 0 \Rightarrow 0^{m-n} = 0 . But we note that 0 m n 0^{m-n} is undefined when m n 0 m-n \le 0 . Then the acceptable cases are when m > n m > n . As m , n [ 1 , 10 ] m, n \in [1,10] , then the number of acceptable cases is m 1 m-1 for an m m .

Then total number of cases for a = 0 a=0 : m = 1 10 ( m 1 ) = i = 1 9 i = 9 ( 9 + 1 ) 2 = 45 \displaystyle \sum _{m=1} ^{10} {(m-1)} = \sum _{i=1} ^{9} {i} = \dfrac {9(9+1)}{2} = 45

Case 2: a = 2

We note that a = 1 a=1 cannot have solution, because RHS is always 0 0 but the LHS is always 1 1 .

We note that for a > 1 a >1 , m > n m > n is necessary for an integer solution. Therefore the minimum acceptable m = 2 m=2 . When a = 2 a=2 , LHS=RHS, when m = 2 m=2 and n = 1 2 2 1 = 2 2 2 1 = 2 n=1 \Rightarrow 2^{2-1} = 2^2 - 2^1 = 2 . For m > 2 m > 2 , LHS < RHS. For a > 2 a > 2 , LHS < for all m 2 m \ge 2 .

Therefore, there are altogether is 45 + 1 = 46 45 + 1 = \boxed{46} .

How do you know that For m > 2 m > 2 , LHS < RHS. For a > 2 a > 2 , LHS < for all m 2 m \ge 2 .

Rajdeep Dhingra - 6 years, 2 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...