Totient function: Difference between revisions

=={{header|Mathematica}}==

<lang Mathematica>Do[

tmp = EulerPhi[i];

If[i - 1 == tmp,

Print["\[CurlyPhi](", i, ")=", tmp, ", is prime"]

,

Print["\[CurlyPhi](", i, ")=", tmp]

]

,

{i, 25}

]

Count[EulerPhi[Range[100]] - Range[100], -1]

Count[EulerPhi[Range[1000]] - Range[1000], -1]

Count[EulerPhi[Range[10000]] - Range[10000], -1]

Count[EulerPhi[Range[100000]] - Range[100000], -1]

(*Alternative much faster way of findings the number primes up to a number*)

(*PrimePi[100]*)

(*PrimePi[1000]*)

(*PrimePi[10000]*)

(*PrimePi[100000]*)</lang>

{{out}}

<pre>

φ(1)=1

φ(2)=1, is prime

φ(3)=2, is prime

φ(4)=2

φ(5)=4, is prime

φ(6)=2

φ(7)=6, is prime

φ(8)=4

φ(9)=6

φ(10)=4

φ(11)=10, is prime

φ(12)=4

φ(13)=12, is prime

φ(14)=6

φ(15)=8

φ(16)=8

φ(17)=16, is prime

φ(18)=6

φ(19)=18, is prime

φ(20)=8

φ(21)=12

φ(22)=10

φ(23)=22, is prime

φ(24)=8

φ(25)=20

25

168

1229

9592</pre>