Quantcast

Got Homework?

Connect with other students for help. It's a free community.

  • across
    MIT Grad Student
    Online now
  • laura*
    Helped 1,000 students
    Online now
  • Hero
    College Math Guru
    Online now

Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing

hartnn Group Title

Fermat's Little Theorem. a^{p-1}=(corresponds to)1mod p using this, we have remainder when 3^100 is divided by 101 as 1. Is this correct ? Can i have few more examples where this theorem is applied but not so directly... @mukushla

  • 2 years ago
  • 2 years ago

  • This Question is Closed
  1. hartnn Group Title
    Best Response
    You've already chosen the best response.
    Medals 3

    @siddhantsharan , @sauravshakya

    • 2 years ago
  2. hartnn Group Title
    Best Response
    You've already chosen the best response.
    Medals 3

    yes, that was direct use of the theorem....

    • 2 years ago
  3. mukushla Group Title
    Best Response
    You've already chosen the best response.
    Medals 0

    i think we just use it directly

    • 2 years ago
  4. hartnn Group Title
    Best Response
    You've already chosen the best response.
    Medals 3

    any other interesting topic or theorem in modular arithmetic ?

    • 2 years ago
  5. mukushla Group Title
    Best Response
    You've already chosen the best response.
    Medals 0

    Wilson's theorem is interesting

    • 2 years ago
  6. hartnn Group Title
    Best Response
    You've already chosen the best response.
    Medals 3

    (n-1)!=-1(mod n) how do we use it ?

    • 2 years ago
  7. mukushla Group Title
    Best Response
    You've already chosen the best response.
    Medals 0

    If \(p\) is a prime, then \((p-1)!+1\) is a multiple of \(p\), that is\[(p-1)! \equiv -1 \ \ \text{mod} \ p\]

    • 2 years ago
  8. hartnn Group Title
    Best Response
    You've already chosen the best response.
    Medals 3

    i will be glad if someone posts a link for a good reference in this topic...

    • 2 years ago
  9. estudier Group Title
    Best Response
    You've already chosen the best response.
    Medals 1

    FLT is also a^p = a (mod p) Show that the two formulations are equivalent.

    • 2 years ago
  10. hartnn Group Title
    Best Response
    You've already chosen the best response.
    Medals 3

    divide by a on both sides? maybe.....

    • 2 years ago
  11. estudier Group Title
    Best Response
    You've already chosen the best response.
    Medals 1

    It's an iff type, so both ways......

    • 2 years ago
  12. hartnn Group Title
    Best Response
    You've already chosen the best response.
    Medals 3

    idk....maybe multiply both sides by a to get a^p = a (mod p) but is it correct to do so ?

    • 2 years ago
  13. estudier Group Title
    Best Response
    You've already chosen the best response.
    Medals 1

    On the right track, sort of...

    • 2 years ago
  14. estudier Group Title
    Best Response
    You've already chosen the best response.
    Medals 1

    a^p = a mod p, then if a not = 0 mod p then can cancel by a to get a^(p-1) = 1 mod p That's the first part...

    • 2 years ago
  15. hartnn Group Title
    Best Response
    You've already chosen the best response.
    Medals 3

    same for other part, right ?

    • 2 years ago
  16. estudier Group Title
    Best Response
    You've already chosen the best response.
    Medals 1

    Yes, more or less.....

    • 2 years ago
  17. estudier Group Title
    Best Response
    You've already chosen the best response.
    Medals 1

    FLT is also used in some combinatorial problems....

    • 2 years ago
  18. hartnn Group Title
    Best Response
    You've already chosen the best response.
    Medals 3

    u have some practice/examples with those ?

    • 2 years ago
  19. estudier Group Title
    Best Response
    You've already chosen the best response.
    Medals 1

    OK, you can try this one: Say you have enough beads in n colours, how many different necklaces consisting of p beads can be made, where p is prime?

    • 2 years ago
  20. hartnn Group Title
    Best Response
    You've already chosen the best response.
    Medals 3

    (mod(n/p))!

    • 2 years ago
  21. estudier Group Title
    Best Response
    You've already chosen the best response.
    Medals 1

    I guess I should tell you that you will need to think a bit in order to work it out, it is not straightforward....

    • 2 years ago
  22. estudier Group Title
    Best Response
    You've already chosen the best response.
    Medals 1

    Or I can tell you the answer and you can try to work it out.....

    • 2 years ago
  23. hartnn Group Title
    Best Response
    You've already chosen the best response.
    Medals 3

    let me try....after few minutes, u give answer...

    • 2 years ago
  24. estudier Group Title
    Best Response
    You've already chosen the best response.
    Medals 1

    I think u need more than a few minutes....:-)

    • 2 years ago
  25. hartnn Group Title
    Best Response
    You've already chosen the best response.
    Medals 3

    ok, whats the answer ?

    • 2 years ago
  26. estudier Group Title
    Best Response
    You've already chosen the best response.
    Medals 1

    (n^p-n)/2p + (n^((p+1)/2) -n)/2 + n

    • 2 years ago
  27. hartnn Group Title
    Best Response
    You've already chosen the best response.
    Medals 3

    OMG!

    • 2 years ago
  28. estudier Group Title
    Best Response
    You've already chosen the best response.
    Medals 1

    It's an integer so the first term still incorporates FLT...

    • 2 years ago
  29. estudier Group Title
    Best Response
    You've already chosen the best response.
    Medals 1

    Do you want links only about FLT/Wilsons or congruences/modular stuff as well....

    • 2 years ago
  30. hartnn Group Title
    Best Response
    You've already chosen the best response.
    Medals 3

    modular stuff as well...

    • 2 years ago
  31. estudier Group Title
    Best Response
    You've already chosen the best response.
    Medals 1

    Similar this http://www.math.sc.edu/~filaseta/gradcourses/Math780notes.pdf Or more detailed....

    • 2 years ago
  32. hartnn Group Title
    Best Response
    You've already chosen the best response.
    Medals 3

    thanks, i'll go through it......and will ask u for any doubts.

    • 2 years ago
    • Attachments:

See more questions >>>

Your question is ready. Sign up for free to start getting answers.

spraguer (Moderator)
5 → View Detailed Profile

is replying to Can someone tell me what button the professor is hitting...

23

  • Teamwork 19 Teammate
  • Problem Solving 19 Hero
  • You have blocked this person.
  • ✔ You're a fan Checking fan status...

Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.

This is the testimonial you wrote.
You haven't written a testimonial for Owlfred.