The Math Forum

Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Math Forum » Discussions » Inactive » comp.soft-sys.math.mathematica

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: Q in mathematica ??
Replies: 0  

Advanced Search

Back to Topic List Back to Topic List  
Q in mathematica

Posts: 1
Registered: 12/6/12
Q in mathematica ??
Posted: Dec 6, 2012 4:57 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

Write Mathematica Blocks that can solve the problem.

Write a code that verifies Fermat' s Little Theorem which says that : If [Phi](n) is the Euler Phi of n, i.e. the number of positive integers less than or equal to n which are relatively prime to n, then a^[Phi](n)[Congruent]1mod n for all a relatively prime to n.

Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© The Math Forum at NCTM 1994-2018. All Rights Reserved.