Last digit problem

how to solve this please give a solution for it i have found it on internet 7777...(20087s)mod(13){ 7 }^{ { 7 }^{ { 7 }^{ 7... } } }(2008\quad 7's)mod(13) and also its last digit

#NumberTheory #Olympiad #AIME

Note by Rishabh Jain
6 years, 10 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

hey @Finn Hulse @Sharky Kesa @Krishna Ar or anyone please answer it !!

Rishabh Jain - 6 years, 10 months ago

Log in to reply

Whoa! Thanks for tagging me here @Rishabh Jain . Well the answer is that the expression is 6 mod 13 and also 3 mod 10 (last digit). Tell me if its right, if yes, I shall very soon post a full solution. I can perhaps give a small hint that you must analyse the remainders obtained on divison of powers of 7 by 13 till u get a pattern/chain. Or plug in euler :p

Krishna Ar - 6 years, 10 months ago

Log in to reply

Ur answer is correct krishna. ...All hail euler :D

Poonayu Sharma - 6 years, 10 months ago

Log in to reply

@Poonayu Sharma :D HOW R YOU SO SURE? . I didnt use totient though

Krishna Ar - 6 years, 10 months ago

Log in to reply

@Krishna Ar I used totient to find last digit ..but still I am confused on how to deal with the 7^7 2008 times mod 13 part ...can u please give a hint :)

Poonayu Sharma - 6 years, 10 months ago

Log in to reply

@Poonayu Sharma Hint is above in the previous comment.

Krishna Ar - 6 years, 10 months ago

Log in to reply

@Krishna Ar Got it....but don't u think that it's a long process ....isn't there a shorter way ?

Poonayu Sharma - 6 years, 10 months ago

Log in to reply

@Poonayu Sharma Know wut? It is not long at all, I did it in some 45 secs! Srsly! No kiddin'

Krishna Ar - 6 years, 10 months ago

Log in to reply

@Krishna Ar Did u use eulers criterion too ? I tried using it ...I also got it in 45 sec

Poonayu Sharma - 6 years, 10 months ago

Log in to reply

@Poonayu Sharma No

Krishna Ar - 6 years, 10 months ago

Log in to reply

@Krishna Ar Well..y don't u post ur solution :/

Poonayu Sharma - 6 years, 10 months ago

Log in to reply

@Poonayu Sharma Gosh! Please see the very first comment of mine!

Krishna Ar - 6 years, 10 months ago

oh god !! so much discussion but no proper solution ??

Rishabh Jain - 6 years, 10 months ago

Log in to reply

Hey! You should see my comment below! It explains everything. If you still dont get it, please tell me...I will post the whole solution. And ,could you tell me the source of this problem pleasE?

Krishna Ar - 6 years, 10 months ago

i got the last digit but not mod13 part

Rishabh Jain - 6 years, 10 months ago

Log in to reply

Hi! Well, you can do this easily too! Come-on! Write the rem's obtained when 7 power 1-12 are divided by 13. You will find the numbers 1-12 are cycled. Simply plug-in the value of rem777^{7} from there. That's all. Is 6 correct? Tell me where you got this from also! Please!!!!!

Krishna Ar - 6 years, 10 months ago
×

Problem Loading...

Note Loading...

Set Loading...