Given that:
4m+n=20; and
|n|≤20
How many ordered pairs (m,n) exist in which m and n both are integers?
Quant- Numbers Problem
This topic has expert replies
-
Neellkanth
- Newbie | Next Rank: 10 Posts
- Posts: 1
- Joined: 08 Apr 2020
-
orthodoxparadox
- Junior | Next Rank: 30 Posts
- Posts: 15
- Joined: 30 May 2020
Let us try it for all n from -20 to 20. We can only choose such n that 20 - n is divisible by 4, since m is also an integer. Since 20 is divisible by 4, n must also be divisible by 4.
So values would be -20, -16, -12, -8, -4, 0, 4, 8, 12, 16, 20 => 11 values in total.
So values would be -20, -16, -12, -8, -4, 0, 4, 8, 12, 16, 20 => 11 values in total.
4m+n=20; and |n|≤20
When,
m = 0, n = 20
m = 1, n = 16
m = 2, n = 12
m = 3, n= 8
m= 4, n =4
m=5, n = 0
But, n can also take negative values upto -20
So there will be
m= 6, n = -4
m=7, n = -8
m= 8, n=-12
m=9, n =-16
m=10, n =-20
Thus, there are 11 ordered pairs.
Thanks,
Ignite
When,
m = 0, n = 20
m = 1, n = 16
m = 2, n = 12
m = 3, n= 8
m= 4, n =4
m=5, n = 0
But, n can also take negative values upto -20
So there will be
m= 6, n = -4
m=7, n = -8
m= 8, n=-12
m=9, n =-16
m=10, n =-20
Thus, there are 11 ordered pairs.
Thanks,
Ignite
