[Date Index] [Thread Index] [Author Index]

Q in mathematica ??

• To: mathgroup at smc.vnet.net
• Subject: [mg128980] Q in mathematica ??
• From: Q in mathematica <baha791 at gmail.com>
• Date: Thu, 6 Dec 2012 05:01:33 -0500 (EST)
• Delivered-to: l-mathgroup@mail-archive0.wolfram.com
• Delivered-to: l-mathgroup@wolfram.com
• Delivered-to: mathgroup-newout@smc.vnet.net
• Delivered-to: mathgroup-newsend@smc.vnet.net

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.

• Follow-Ups:
  • Re: Q in mathematica ??
    • From: Murray Eisenberg <murray@math.umass.edu>