How many ordered pairs of integers ( m , n ) satisfy 1 2 m = n 1 2 ?
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.
Correct! Does the answer change if we are looking for the unordered pairs of m , n ?
Order does indeed matter, but I believe you are double counting each pair. Doing this by brute force you get 15 pairs - {(1,144), (2,72), (3,48), (4,36), (6,24), (8,18), (9,16), (12,12), (16,9), (18,8), (24,6), (36,4), (48,3), (72,2), (144,1)}
Log in to reply
The question asks for ordered integer pairs ( m , n ) , not necessarily positive integer pairs. For every pair ( a , b ) you mention in your comment, consider the pair ( − a , − b ) which is also a solution, hence the answer.
I remember seeing this question in some kvpy paper....dunno which year..
Log in to reply
i havent given the paper so far.I am in 10th.
Log in to reply
dont u think that the pair (12,12) is repeated. i think 29 must be the answer
Log in to reply
@Bhargav Pavuluri – (12,12) has a (-12,-12) to pair with.
There's a typo in your solution.
m n = 1 4 4 = 2 4 × 3 2 = 2 4 + 3 2
Sorry I’m reassessing this approach for another varieties and generalizing
1 4 4 = 2 4 × 3 2 n = 6 , r = 2 n P r = 6 P 2 = 4 ! 6 ! = 3 0 p a i r s
Or actually to be more accurate it should be nCr multiplied by 2
But in this case only 2 × n C r = n P r
using the fact that r=2 so r!=2! will be cancelled by 2 and we can consider as if second pair was the -ve one
1 4 4 = 2 4 × 3 2 n = 6 , r = 2 2 × n C r = 2 × 6 C 2 = 4 ! × 2 ! 2 × 6 ! = 3 0 p a i r s
Problem Loading...
Note Loading...
Set Loading...
On solving the equation, we get mn=144. Also,mn= 2 4 ∗ 3 2 . If m and n are natural numbers then (4+1)(2+1)=5 * 3=15 ordered pairs of (m,n) are possible. But it is given to us that m,n are integers.Therefore 2*15=30 pairs are possible.