Given that a and b are digits such that 1 2 0 a b is a multiple of 3, 5 and 7. What is the value of a b ?
Details and assumptions :
a b c means 1 0 0 a + 1 0 b + 1 c , as opposed to a × b × c . As an explicit example, for a = 2 , b = 3 , c = 4 , a b c = 2 3 4 and not 2 × 3 × 4 = 2 4 .
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.
Great! Using all 3 numbers together makes it much more direct to approach the problem.
As a side note, there is at most one number in the range 1 0 0 A to 1 0 0 A + 9 9 which is a multiple of 105.
Log in to reply
Is there any easy solution other than the Hit and Miss technique
In order for 1 2 0 a b to be divisible by 5, either b = 0 or b = 5 . In order for the number to be divisible by 3, the sum of the digits must be divisible by 3, which means that a + b must be divisible by 3. We can split this problem into two cases; if the units digit b is 5 or 0.
Case 1: b = 0 If b = 0 , then a must be divisible by 3 in order for the number 1 2 0 a b to be divisible by 3. Why? we need the sum of the digits to be divisible by 3, and since 1 + 2 + 0 + 0 is divisible by 3, we need a to be divisible by 3 as well. The digits that are divisible by 3 are 0, 3, 6, and 9. We can test each of these numbers 1 2 0 a b where a = 0 , a = 3 , a = 6 , a = 9 and b = 0 to see whether they are divisible by 7.
7 1 2 0 0 0 is not an integer.
7 1 2 0 3 0 is not an integer.
7 1 2 0 6 0 is not an integer.
7 1 2 0 9 0 is not an integer.
Therefore, none of these cases work, so b cannot be 0.
Case 2: b = 5 If b = 5 , then in order for the number to be divisible by 3, a must be equal to 1 (mod 3). The digits that are 1 mod 3 are 1, 4, and 7. We can again test them individually.
7 1 2 0 1 5 is not an integer.
7 1 2 0 4 5 is not an integer.
7 1 2 0 7 5 = 1 7 2 5 , which is an integer! Our answer is, therfore, 7 5
Alternative method: Since 12000 is equal to 2 (mod 7), we need a b to be equal to 5 (mod 7) in order for 1 2 0 0 0 + a b = 1 2 0 a b to be divisible by 7.
The numbers less than 100 that are equal to 5 mod 7 are:
0 5 , 1 2 , 1 9 , 2 6 , 3 3 , 4 0 , 4 7 , 5 4 , 6 1 , 6 8 , 7 5 , 8 2 , 8 9 , and 9 6 .
However, since we want our number to be divisible by 5, we can eliminate most of these choices: the last digit must be equal to 0 or 5. Now, the numbers that work are
0 5 , 4 0 , and 7 5 .
Now, we need our number to be divisible by 3. Remember that if the sum of the digits of a number is divisible by 3, then the number is as well. Out of these three numbers, 75 is the only one that is divisible by 3.
Checking our answer, we see that 1 2 0 7 5 is divisible by 3, 5, and 7, so our answer is equal to 7 5 .
On a sidenote, I accidentally clicked back or something, causing my whole solution to disapprear...I had to write it again :P
If I am not very clear on things, tell me; I will try my best to explain. (I lost my temper a little bit when everything disappeared, so I might not have been as thorough as the first time)
1 2 0 a b ( m o d 5 ) ≡ b ( m o d 5 ) ⇒ b ( m o d 5 ) ≡ 0
hence, b = 0 , 5
case 1: b = 0
1 2 0 a b ( m o d 3 ) ≡ a + b ( m o d 3 ) ⇒ a + b ( m o d 3 ) ≡ 0 . . . ( i )
hence, a ( m o d 3 ) ≡ 0 ( b = 0 )
a=0,3,6,9
1 2 0 a b ( m o d 7 ) ≡ 3 a + b + 2 ( m o d 7 ) ⇒ 3 a + b + 2 ( m o d 7 ) ≡ 0 . . . ( i i )
but,none of the values of a satisfy 3 a + 2 ( m o d 7 ) = 0 ( s i n c e , b = 0 )
hence, b = 5
case 2: b = 5
from equation (i), a + 5 ( m o d 3 ) ≡ 0 ⇒ a ( m o d 3 ) ≡ 1
hence, a = 1 , 4 , 7 . . . . . . ( i i i )
from equation (ii) 3 a ( m o d 7 ) ≡ 0 ( b = 5 )
or, a = 0 , 7 . . . . ( i v )
from ( i i i ) and i v ) we see that a = 7
hence, a = 7 , b = 5
a b = 7 5
CAN YOU PLEASE SHOW THE SOLUTION?
can you explain how 75 has come?
If the number is multiple of
3
it must be divisible by
3
.Again If the number is multiple of
5
it must be divisible by
5
.
But when
b
=
5
or
0
only then it is divisible by
5
We know the divisibility rule of
3
.The sum of the digits is divisible by
3
.
So,when
b
=
5
there are
3
choices for
a
.=
3
or
6
or
9
so The possibilities are are:
1
2
0
3
5
,
1
2
0
6
5
,
1
2
0
9
5
when
b
=
0
there are
3
choices for
a
.=
1
or
4
or
7
so The possibilities numbers are:
1
2
0
1
5
,
1
2
0
4
5
,
1
2
0
7
5
But the number must be divisible by
7
.
but among those
6
numbers there are only one number which is divisible by
3
,
5
,
7
It is
1
2
0
7
5
take lcm of 3,5,7=105 so , 120ab can be written as 12000+ab=114 105+30+ab so, dividing 114 105+30+ab by 105(lcm),we get; 114+(30+ab)/105. so remainder =0 for complete divisibility, hence 30+ab/105=1 ab=105-30=75
If the number is divisible by 5, then the last digit must be either 0 or 5. The divisibility rule of 7 states that if you double the last digit and subtract the product from the rest of the number and the resulting difference is divisible by 7, then the whole number is divisible by 7. If we double 0, we get 0 so if we have b=0, then 1 2 0 a must be divisible by 7. Because 1+2+0=3 (multiple of 3), then a must be a multiple of 3 if b=0. There is no a that satisfies that condition. This means that b must equal 5. Following the same logic as above, we get a b = 7 5
amazing!!!
b must either be 5 or 0 since it is a multiple of 5. a + b must be a multiple of 3 since ab is a multiple of 3. 2000 - ab = multiple of 7. since 14000 - 120ab = 14000 - 12000 - ab This multiple of 7 can either be 1995, 1960, 1925 since they are multiples of 7 and 5. If we take ab for each value, we will get 5, 40, 75 respectively. And the only answer that matches multiple of 3 and 5 is actually 75.
To solve this question, we take the number with easier multipliers:5, which is 12005, 12010, 12015, ..., 12095. Then the multiplier of 3 is known by adding all the digits of the numbers and see if it is divisible by 3. From the numbers 12015 to 12095 which is taken from the number 5 multipliers, only 12015, 12030, 12045, 12060, 12075 and 12090 follows the rule of multiplier 3 and 5, or simply the multiplier of 15. Let's say 12015 => 1+2+0+1+5=9, which is divisible by 3. Then from the 6 choices, divide them by 7 and pick the one with no decimal from the division of 7, which is 12075. So the answer should be 75.
We have the following equations, using divisibility tests by 3, 5, 7: b ≡ 0 ( m o d 5 ) , a + b ≡ 0 ( m o d 3 ) , 3 a + b + 2 ≡ 0 ( m o d 7 ) .
Then there exists an integer k such that b = 5 k .
Then a + 5 k ≡ 0 ( m o d 3 ) and this is a + 2 k ≡ 0 ( m o d 3 ) thus a ≡ k ( m o d 3 ) .
We know that b = 0 or b = 5 and then k = 0 or k = 1 .
If k = 0 then b = 0 and:
3 a + b + 2 ≡ 0 ( m o d 7 ) becomes 3 a ≡ 5 ( m o d 7 ) .
The congruence 3 a ≡ 5 ( m o d 7 ) implies a ≡ 4 ( m o d 7 ) , so a = 4 .
As a ≡ k ( m o d 3 ) , we have a = 3 or a = 6 or a = 9 (Or 0), so this is a contradiction.
Then k = 1 . And so we have b = 5 .
The congruence 3 a + b + 2 ≡ 0 ( m o d 7 ) becomes 3 a ≡ 0 ( m o d 7 ) so a ≡ 0 ( m o d 7 ) and a = 7 . But also a ≡ k ( m o d 3 ) so a = 0 .
So a = 7 , b = 5 , a b = 7 5 .
First we note that since a and b are DIGITS, the greatest possible value of the number 1 2 0 a b is 1 2 0 9 9 . Also note that the LCM of 3 , 5 , 7 is 1 0 5 . Dividing and taking the floor:
⌊ 1 0 5 1 2 0 9 9 ⌋ = 1 1 5 . Now multiplying by the LCM, we get:
1 1 5 ⋅ 1 0 5 = 1 2 0 7 5 ⟹ 7 5 , and we are done.
In order for a number to be a multiple of 5, it must end with 5 or 0. In this case, it ends with 5. Thus, b is 5. Since the digits in a number divisible by 3 must add up to be a multiple of 3, you can try out the different possibilities: (1+2+0+1+5=9; 1+2+0+4+5=12; 1+2+0+7+5=15) 12015/7=1716 3/7; 12045/7=1720 5/7; and only 12075/7=1725. Hence, ab is 75.
120ab is a multiple of both 3,5 and 7. Finding the value of ab so, we take lowest common factor of 3,5 and 7 = 75 thus, the value of ab is 75 because 120ab can only be divided by 3,5 and 7 unless they have a lowest common factor in it.
I know its wrong...
For it to be a multiple of 3,5 and 7 the sum of the numbers should be a multiple of 3 and the last number should be 0 or 5.So there are two possiblities of b i.e; 0 and 5.If b=0 then the possible values of a are 0,3,6,9.If b=5 possible values of a are 1,4,7.Substituting these values we see that only the number 12075 is a multiple of these three numbers.So 12075
because 120ab is a multiple of 3, 5 and 7 ------> 120ab is a multiple of 105
120ab = (floor (12000/105) + 1) x 105
=( floor ( 114,28) + 1) x 105
= 115 x 105
= 12075
then, we get ab = 75
If a number is divisible by 5, then the last digit will be either 0 or 5. b is the last digit and is either 0 or 5. If a number is divisible by 3, then the sum of the digits of the number should be a multiple of 3. If b is 0, then 1+2+0+a+0=multiple of 3. Therefore 'a' can be 0, 3, 6 or 9. The number could be 12030, 12060, 12060 or 12090. If b is 5, then 1+2+0+a+5=multiple of 3. Therefore 'a' can be 1, 4 or 7. The number could be 12000, 12030, 12060, 12090, 12015, 12045, 12075 Now we could try dividing each number by 7 to see which one is divisible by 7. 12075 is the only number that divides without a remainder and hence its last 2 digits 75 are the answer to this question.
Easier way for smarter people: If a number is divisible by 3, 5 or 7, it should be divisible by 3 5 7=105. We can guess about how many times we need to multiply it to get something between 12000 and 12100. We use guessing after that to figure out the answer.
Problem Loading...
Note Loading...
Set Loading...
For a number to be a multiple of 3, 5, and 7, it must be a multiple of 105, or 3 × 5 × 7 . As there are only 100 possibilities for what 1 2 0 a b is, there must be only one of those that can be a multiple of 105.
Let's divide 12000 and 12099 by 105 and see if we can get a whole number:
1 2 0 0 0 ÷ 1 0 5 ≈ 1 1 4 . 3
1 2 0 9 9 ÷ 1 0 5 ≈ 1 1 5 . 2
Now we know that the number divided by 105 has to be 115.
So the number is 1 1 5 × 1 0 5 = 1 2 0 7 5 .
a b is 7 5 .