What is the remainder when 5 × 5 5 × 5 5 5 × … × 5 5 5 5 5 5 5 … 5 5 is divided by 1 0 0 ?
Details and assumptions
There are 5555 digits in the last term of the product.
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.
It is 55555 in the fourth equation, at the end before the mod. My bad.
ya i 2 did it jst dis way
5 55%100=25, then 25 55%100=75, and 75*55%100=25, So if there's an even number of times, it's 75, and if it's an odd number of times, it's 25. Since 5555 is odd, the answer is 25
Take mod 100 each term in the product to see how it will affect the remainder after being divided by 100. The question becomes: What is the remainder when the following is divided by 100?: 5 × 5 5 × 5 5 × 5 5 . . . . × 5 5 with 5554 55's.
Next, I tried multiplying the first few terms out (remembering to take mod 100 of each term) and seeing if a pattern could be determined.
1st Term:
5
2nd Term:
5
×
5
5
=
2
7
5
=
7
5
m
o
d
1
0
0
.
3rd Term:
7
5
×
5
5
=
7
5
×
5
2
+
3
×
7
5
=
2
2
5
m
o
d
1
0
0
=
2
5
m
o
d
1
0
0
.
Note: 52 times 75 becomes 0 after taking mod 100, since 4 times any integer times 75 is going to be a multiple of 300.
4th Term:
2
5
×
5
5
=
5
2
×
2
5
+
3
×
2
5
=
0
+
7
5
=
7
5
m
o
d
1
0
0
by the same logic above.
There seems to be a pattern: After multiplying 25 by 55, a remainder of 75 is left over and after multiplying 75 by 55, a remainder of 25 is left over.
Now, It can be said that after an odd number of terms are multiplied together (in all cases except the first term), the remainder is 25; every even number of terms product ends has a remainder of 75.
Now, since 5555 is an odd number, it can be said that the remainder after being divided by 100 is 2 5 .
≡ = ≡ = ≡ 5 × 5 5 × 5 5 5 × ⋅ ⋅ ⋅ × 5 5 5 5 fives 5 5 5 . . . 5 5 5 \nonumber 5 × 5 5 5 4 fifty fives 5 5 × 5 5 × 5 5 × ⋅ ⋅ ⋅ × 5 5 ( m o d 1 0 0 ) \nonumber 5 × 5 5 5 5 5 4 \nonumber 5 × 2 5 ( m o d 1 0 0 ) \nonumber 1 2 5 \nonumber 2 5 ( m o d 1 0 0 )
It's not immediately clear how you deduced that 5 5 5 5 5 4 ≡ 2 5 ( m o d 1 0 0 ) .
In any case, I think Chinese Remainder Theorem destroys this problem much faster.
Log in to reply
How can we solve it using the Chinese Remainder Theorem?
Log in to reply
Clearly 5 × 5 5 × 5 5 5 × … × 5555 5 5 5 … 5 5 5 ≡ 0 ( m o d 2 5 ) .
Now, 5 × 5 5 × … × 5555 5 5 5 … 5 5 5 ≡ 5 5 5 5 5 ≡ 1 5 5 5 5 ≡ 1 ( m o d 4 ) .
By the Chinese Remainder Theorem, the solution of these two congruences is unique modulo 2 5 × 4 = 1 0 0 . 2 5 satisfies both, and we're done!
I think 5 5 5 5 2 4 ≡ ( m o d 1 0 0 ) can be proved by noting that ( 5 5 ) 5 5 5 4 is same ( 3 0 2 5 ) 2 7 7 7 . Clearly, 3 0 2 5 ≡ 2 5 ( m o d 1 0 0 ) .
Perfect explanation.
Using this pattern for 5 55 = 275 for 5 55 555=152625 for 5 55 555 5555=8479081875 for the last factor having even "5"s, the remainder when divided by 100 is 75 for the last factor having odd"5 "s, the remainder when divided by 100 is 25
for the problem, since the last factor is odd, then the answer must be 25
We can solve this problem by looking for the pattern .
The remainder of a number divided by 100 is same to the last two digits of the number.Therefore we need to find the last two digits of 5 × 5 5 × 5 5 5 × . . . × 5 5 5 . . . 5 5 } 5 5 5 5 .
(Note: 5 5 5 . . . 5 5 } 5 5 5 5 means there are 5 5 5 5 digits in that number.)
Now, let's look for the pattern:
5 × 5 5 = 2 7 5 Last two digits: 7 5
5 × 5 5 × 5 5 5 = 1 5 2 6 2 5 Last two digits: 2 5
5 × 5 5 × . . . × 5 5 5 5 = 8 4 7 8 3 1 8 7 5 Last two digits: 7 5
5 × . . . × 5 5 5 5 5 = 4 7 1 0 1 2 9 9 8 1 5 6 2 5 Last two digits: 2 5 ......
Can you see the pattern?The pattern is the last two digit of the products have the sequence: 7 5 , 2 5 , 7 5 , 2 5 . . .
We can see that the product ends with the digits 7 5 is a product of an even number of numbers(in the problem).For example, 5 × 5 5 = 2 7 5 .The product ends with digits 7 5 ,and it is a product of two numbers, 5 and 5 5 .
On the other hand, the product ends with digits 2 5 is a product of an odd number of numbers(in the problem).By this pattern,
5 × 5 5 × 5 5 5 × . . . × 5 5 5 . . . 5 5 } 5 5 5 5 → 5 5 5 5 numbers.( odd number )
Therefore,the remainder after dividing 1 0 0 (the last two digits) of the product is 2 5 .
.
May I know how to write the 5555-digit number in LaTeX as the problem instead of mine: 5 5 5 . . . 5 5 } 5 5 5 5 ? Thanks.
Use underbrace. $\underbrace{555\cdots555}_{5555}$
First we realize that each term except for the first in 5 × 5 5 × 5 5 5 × . . . × 5 5 5 . . 5 5 , where the last term is 5 5 5 5 numbers of 5 ′ s, are all equal to 5 5 m o d ( 1 0 0 ) due to splitting up the number into two parts, one consisting of trailing 5 5 ′ s and the other of the 5 ′ s before that.
Constructing a table yields: n is the number of \(55')s
1. \(n=1, 55 mod(100)\).
n = 2 , 2 5 m o d ( 1 0 0 ) .
n = 3 , 7 5 m o d ( 1 0 0 ) .
n = 4 , 2 5 m o d ( 1 0 0 ) .
At n = 4 we stop as we already know that the next element of the list will be 7 5 . We can thus conclude that as there are 5 5 5 4 of terms that are equal to 5 5 m o d ( 1 0 0 ) , the propduct of all these 5 5 5 4 terms is equal to 2 5 m o d ( 1 0 0 ) as 5 5 5 4 is even. Finally, we are left with a 5 , the answer can then be calculated: 5 × 2 5 = 1 2 5 = 2 5 m o d ( 1 0 0 ) . Answer: 2 5
This can be solved with a little smaller-scale experimentation. To start, the remainder when a number is divided by 100 is the last 2 digits. So, 5 55 have last two digits 75, multiplying this by 555 gives last two 25, 5555 gives 75. and so on. From this, it is clear that there is an alternating pattern within the remainders. Since the last number (i.e. 5555) has an odd number digits, we look for when we last multiplied an odd number of digits was, which was 5 55*555, which gave us a remainder of 25, which is our answer.
Here we make an observation that if 5 is multiplied by 55 we get 275 which on dividing by 100 gets remainder 25 .Similarly if 5 is 1st multiplied by 55 and then by 555 and dividing the result with 100 we get remainder 75 . Hence, we can say that when 5 is multiplied by 555555...555555(n times) where n is even we always get remainder 25
Based on the properties of modulo:
5 = 5 ( m o d 1 0 0 )
5 5 = 5 5 ( m o d 1 0 0 )
5 5 5 = 5 5 ( m o d 1 0 0 )
and so on.
Therefore the remainder of 5 × 5 5 × 5 5 5 × . . . × 5 5 5 . . . 5 5 given that the last term of the product has 5 5 5 5 digits is ( 5 × 5 5 × 5 5 × . . . × 5 5 ) ( m o d 1 0 0 )
( 5 × 5 5 × 5 5 × . . . × 5 5 ) ( m o d 1 0 0 ) can have two values depending on the number of terms given that the number of terms is greater than 1
( 5 × 5 5 × 5 5 × . . . × 5 5 ) ( m o d 1 0 0 ) = 2 5 ( m o d 1 0 0 ) if the number of terms is odd and
( 5 × 5 5 × 5 5 × . . . × 5 5 ) ( m o d 1 0 0 ) = 7 5 ( m o d 1 0 0 ) if the number of terms is even.
The last term has 5555 digits made out of 5's. Therefore, the last number is the 5 5 5 5 t h term, this makes the number of terms 5555. Based on the conditions given, the remainder is 25
when divided by 100 when number of 5's is odd then remainder is 75,
5 × 55 total 5's = 3
= 275 remainder is 75 when number of 5's even then remainder is 25
5 × 55 × 555 total 5's = 6
= 152625 remainder is 25
as there are 5555 in last term total number of 5's = 5555 × 5556/2 = 5555 × 2778 is even
(Y)
you can use Euler's totient function too (that is how I did it), but it is more complicated than the other solutions.
Well... Firstly, try to think like this- 5X55 and the answer is 275 and reminder- 75; 5X55X555 and the answer is 152625 and reminder- 25; 5X55X555X5555 and the .... and reminder- 75; again, 5X55X555X5555X55555 and the .... and reminder- 25;
So we can see that, if the biggest number's number of digits are even then, the reminder is 75 and if it is odd, then the reminder is 25.
So, in the question biggest number has 5555 digits and it is odd.
So the reminder is 25 :D :D
Original solution I guess:
First, we know that the rest when divided by 100 means the 2 last digit of the number. Let's write it differently:
5 5 5 5 5 × ( 1 × 1 1 × 1 1 1 × . . . × 1 1 1 . . . . 1 1 1 )
Well, what are the last 2 digits of 5 5 5 5 5 ? It's 25 of course, you can see this pattern on ( 5, 125, 625, 3125....) (because 2 5 × 5 is 125, the 2 last digits won't change)
So we have (a number ending with 25) × ( 1 × 1 1 × 1 1 1 × . . . × 1 1 1 . . . . 1 1 1 )
Now, what happens to the last 2 digits when you multiply a number by 11? Let's call the 2 last digits ( 2 and 5) as x and y. When multiplied by 11:
(. . . . . .) x y
(. . . .) x y (this corresponds to the sum you do on the paper after multiplying, (y + 0, x + y, ....))
Last digit (y) maintains and the other one (x) gets incremented by y
You can observe that the same thing happens with 111, 1111, and so on, for the last 2 digits
So we know already that the last digit of this multiplication is 5 The other one would be 2 plus 5 for each multiplication, being ( 7, 2, 7, 2, 7 ....)
We have 5554 multiplications ( 11 to 111....11 (5555 "one") ), so the digit will be 2
25 is the answer
wonderful how you see and explain this!
5 55/100 = R-25,5 55*555/100=R- 75 PATTERN = 5,25,75,25,75 SO ANSWER = 25
Problem Loading...
Note Loading...
Set Loading...
The first step here was to look for a pattern.
5 × 5 5 m o d 1 0 0 = 7 5 5 × 5 5 × 5 5 5 m o d 1 0 0 = 2 5 5 × 5 5 × 5 5 5 × 5 5 5 5 m o d 1 0 0 = 7 5 5 × 5 5 × 5 5 5 × 5 5 5 5 × 5 5 5 5 m o d 1 0 0 = 2 5
And so on.. now, observe that this gives us a rough conditional (I am a programmer, so..):
if numOf5sInLastNumber mod 2 is 0, then answer is 75, else 25.
Putting in 5555, which is not a multiple of 2, I get 25 which is the answer.