Totient function: Difference between revisions
Content added Content deleted
No edit summary |
|||
| Line 342: | Line 342: | ||
COMMENT - EXERCISE THE FUNCTION; |
COMMENT - EXERCISE THE FUNCTION; |
||
INTEGER N, TOTIENT, COUNT; |
INTEGER N, TOTIENT, COUNT; |
||
WRITE(" |
WRITE(" N PHI(N) PRIME?"); |
||
FOR N := 1 STEP 1 UNTIL 25 DO |
FOR N := 1 STEP 1 UNTIL 25 DO |
||
BEGIN |
BEGIN |
||
| Line 349: | Line 349: | ||
END; |
END; |
||
COMMENT - AND USE IT TO |
COMMENT - AND USE IT TO COUNT PRIMES; |
||
WRITE(""); |
WRITE(""); |
||
COUNT := 0; |
COUNT := 0; |
||
| Line 367: | Line 367: | ||
Limiting the search to 1000 keeps the running time of the program within reasonable bounds. |
Limiting the search to 1000 keeps the running time of the program within reasonable bounds. |
||
<pre> |
<pre> |
||
N PHI(N) PRIME? |
|||
1 1 NO |
1 1 NO |
||
2 1 YES |
2 1 YES |
||
| Line 397: | Line 397: | ||
PRIMES UP TO 1000 = 168 |
PRIMES UP TO 1000 = 168 |
||
</pre> |
</pre> |
||
=={{header|APL}}== |
=={{header|APL}}== |
||