Ace school

with brainly

  • Get help from millions of students
  • Learn from experts with step-by-step explanations
  • Level-up by helping others

A community for students.

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

Mathematics
See more answers at brainly.com
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.

Join Brainly to access

this expert answer

SEE EXPERT ANSWER

To see the expert answer you'll need to create a free account at Brainly

yes, that was direct use of the theorem....
i think we just use it directly

Not the answer you are looking for?

Search for more explanations.

Ask your own question

Other answers:

any other interesting topic or theorem in modular arithmetic ?
Wilson's theorem is interesting
(n-1)!=-1(mod n) how do we use it ?
If \(p\) is a prime, then \((p-1)!+1\) is a multiple of \(p\), that is\[(p-1)! \equiv -1 \ \ \text{mod} \ p\]
i will be glad if someone posts a link for a good reference in this topic...
FLT is also a^p = a (mod p) Show that the two formulations are equivalent.
divide by a on both sides? maybe.....
It's an iff type, so both ways......
idk....maybe multiply both sides by a to get a^p = a (mod p) but is it correct to do so ?
On the right track, sort of...
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...
same for other part, right ?
Yes, more or less.....
FLT is also used in some combinatorial problems....
u have some practice/examples with those ?
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?
(mod(n/p))!
I guess I should tell you that you will need to think a bit in order to work it out, it is not straightforward....
Or I can tell you the answer and you can try to work it out.....
let me try....after few minutes, u give answer...
I think u need more than a few minutes....:-)
ok, whats the answer ?
(n^p-n)/2p + (n^((p+1)/2) -n)/2 + n
OMG!
It's an integer so the first term still incorporates FLT...
Do you want links only about FLT/Wilsons or congruences/modular stuff as well....
modular stuff as well...
Similar this http://www.math.sc.edu/~filaseta/gradcourses/Math780notes.pdf Or more detailed....
thanks, i'll go through it......and will ask u for any doubts.

Not the answer you are looking for?

Search for more explanations.

Ask your own question