Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]


Groups > comp.soft-sys.math.mathematica > #12654

Q in mathematica ??

From Q in mathematica <baha791@gmail.com>
Newsgroups comp.soft-sys.math.mathematica
Subject Q in mathematica ??
Date 2012-12-06 09:57 +0000
Message-ID <k9pq63$hot$1@smc.vnet.net> (permalink)
Organization Time-Warner Telecom

Show all headers | View raw


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.

Back to comp.soft-sys.math.mathematica | Previous | Next | Find similar | Unroll thread


Thread

Q in mathematica ?? Q in mathematica <baha791@gmail.com> - 2012-12-06 09:57 +0000

csiph-web