Prove that the last two digits are 28

Prove that if nn is an odd positive integer, then the last two digits of 22n(22n+11)2^{2n}(2^{2n+1}-1) in base 1010 are 2828.

Note by Finn Hulse
5 years, 4 months ago

No vote yet
1 vote

  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:

  • 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.

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold

- bulleted
- list

  • bulleted
  • list

1. numbered
2. list

  1. numbered
  2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1

paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
    # 4 spaces, and now they show
    # up as a code block.

    print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.
2 \times 3 2×3 2 \times 3
2^{34} 234 2^{34}
a_{i-1} ai1 a_{i-1}
\frac{2}{3} 23 \frac{2}{3}
\sqrt{2} 2 \sqrt{2}
\sum_{i=1}^3 i=13 \sum_{i=1}^3
\sin \theta sinθ \sin \theta
\boxed{123} 123 \boxed{123}

Comments

Sort by:

Top Newest

Hint:Induction

Bogdan Simeonov - 5 years, 4 months ago

Log in to reply

Okay... Can you explain?

Finn Hulse - 5 years, 4 months ago

Log in to reply

When n=1, the result is 28.Suppose for some n the condition is true.

Multiply by 16^2 and add 15.22n+415.2^{2n+4} and you will get the next such number.So the new number will be congruent to

256.28+15.22n+468+15.22n+4(mod100)256.28+15.2^{2n+4}\equiv 68+15.2^{2n+4}(mod100)

But 15.22n15.2^{2n} for odd numbers n will be congruent to 60 modulo 100 (that's not hard to see), so we have proven in inductively.

Bogdan Simeonov - 5 years, 4 months ago

Log in to reply

@Bogdan Simeonov Oh, I guess so! Great job Bogdan. :D

Finn Hulse - 5 years, 4 months ago

Log in to reply

@Finn Hulse You probably have no idea how to pronounce my name :D

Bogdan Simeonov - 5 years, 4 months ago

Log in to reply

@Bogdan Simeonov Probably. How? :D

Finn Hulse - 5 years, 4 months ago

Log in to reply

@Finn Hulse Try using the speech feature on it.It sounds stupid :D

Bogdan Simeonov - 5 years, 4 months ago

Log in to reply

@Bogdan Simeonov HAHA yeah. But how is your name actually pronounced?

Finn Hulse - 5 years, 4 months ago

Log in to reply

@Finn Hulse I believe it should be pronounced like this: pronounce log, but with a B instead of an l, then say the name Dan :D

Bogdan Simeonov - 5 years, 4 months ago

Log in to reply

@Bogdan Simeonov Oh, that's what I thought. :D

Finn Hulse - 5 years, 4 months ago

Log in to reply

×

Problem Loading...

Note Loading...

Set Loading...