Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.soft-sys.math.mathematica > #12674
| From | Murray Eisenberg <murray@math.umass.edu> |
|---|---|
| Newsgroups | comp.soft-sys.math.mathematica |
| Subject | Re: Q in mathematica ?? |
| Date | 2012-12-07 06:38 +0000 |
| Message-ID | <k9s2sq$mq1$1@smc.vnet.net> (permalink) |
| References | <20121206100133.BD4146921@smc.vnet.net> |
| Organization | Time-Warner Telecom |
On Dec 6, 2012, at 5:01 AM, Q in mathematica <baha791@gmail.com> wrote:
> 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.
I hope that wasn't a homework exercise you were asked to do, as it's
straightforward:
Resolve[ForAll[{a, n},
(IntegerQ[a] && IntegerQ[n] && GCD[a, n] == 1)
~Implies~
(Mod[a^EulerPhi[n], n] == 1)
]]
True
Or, the same thing without the quantification:
(IntegerQ[a] && IntegerQ[n] && GCD[a, n] == 1)
~Implies~
(Mod[a^EulerPhi[n], n] == 1)
True
---
Murray Eisenberg murray@math.umass.edu
Mathematics & Statistics Dept.
Lederle Graduate Research Tower phone 413 549-1020 (H)
University of Massachusetts 413 545-2838 (W)
710 North Pleasant Street fax 413 545-1801
Amherst, MA 01003-9305
Back to comp.soft-sys.math.mathematica | Previous | Next — Next in thread | Find similar | Unroll thread
Re: Q in mathematica ?? Murray Eisenberg <murray@math.umass.edu> - 2012-12-07 06:38 +0000 Re: Q in mathematica ?? // answering someone's homework Richard Fateman <fateman@cs.berkeley.edu> - 2012-12-08 06:28 +0000
csiph-web