MathGroup Archive 2012

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

Search the Archive

Q in mathematica ??


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.



  • Prev by Date: Re: Mathematica 9: bug in merging cells
  • Next by Date: Re: Pet peeve about version numbers of Mathematica
  • Previous by thread: Phantom Error Messages in v9
  • Next by thread: Re: Q in mathematica ??