This discussion board is a place to discuss our Daily Challenges and the math and science
related to those challenges. Explanations are more than just a solution — they should
explain the steps and thinking strategies that you used to obtain the solution. Comments
should further the discussion of math and science.
When posting on Brilliant:
Use the emojis to react to an explanation, whether you're congratulating a job well done , or just really confused .
Ask specific questions about the challenge or the steps in somebody's explanation. Well-posed questions can add a lot to the discussion, but posting "I don't understand!" doesn't help anyone.
Try to contribute something new to the discussion, whether it is an extension, generalization or other idea related to the challenge.
Stay on topic — we're all here to learn more about math and science, not to hear about your favorite get-rich-quick scheme or current world events.
Markdown
Appears as
*italics* or _italics_
italics
**bold** or __bold__
bold
- bulleted - list
bulleted
list
1. numbered 2. list
numbered
list
Note: you must add a full line of space before and after lists for them to show up correctly
Actually there are many ways checking cyclic changes.For more than one last igits mod 10^n acompanied by congruence and Binomial Theorem. Sir, can you give me the most generalized process.
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
Firstly, 24x≡1(mod5) with every positive integer x (easily proved).
As a result:
220−1=(24−1)(216+212+28+24+1) is divisible by 25, means 220≡1(mod25)
2100−1=(220−1)(280+260+240+220+1) is divisible by 125, means 2100≡1(mod125)
Once more and we have: 2500≡1(mod625)
So: 22000≡1(mod625)
(22000−1) is divisible by 625 -> (22004−24) is divisible by 10000
Then (22016−216) is divisible by 10000
The last 4 digits of 22016 is the same as that of 216, which is 5536.
Great. Another way to tell that 2500≡1(mod625) is to use Euler's Theorem directly.
good solution
Can you post your solution on to this problem? Thanks!
What have you tried? Do you know how to find the last digit of a power?
i know to find the last digit but i want to know the solution to above problem
Actually there are many ways checking cyclic changes.For more than one last igits mod 10^n acompanied by congruence and Binomial Theorem. Sir, can you give me the most generalized process.
For last digit does check cyclic always work?
Last two digits will be 36
i think its 32
2
0136
@Dheeraj Agarwal Please refrain from asking for solutions to problems that were recently posted, especially if the problems already have solutions.
Last 2 digits are 36
2^2016 = 2^10^201 × 2^6
= 1024^201 × 2^6
24^odd power × 64
24^even power ends with 76 and 24^odd power ends with 24
so 24 × 64 = 1536 last 2 digits are 36