aparler/RosettaCodeData
1
0
Fork 0
Code Issues 12 Pull requests 3 Projects Releases Packages Wiki Activity Actions

Data update

Browse source
This commit is contained in:
Ingy döt Net 2025-02-27 18:35:13 -05:00
parent 8e4e15fa56
commit 72eb4943cb
1853 changed files with 35514 additions and 9441 deletions
Download patch file Download diff file Expand all files Collapse all files

22
Task/Totient-function/EasyLang/totient-function.easy
View file

@ -1,21 +1,15 @@
func totient n .
fastfunc totient n .
tot = n
i = 2
while i <= sqrt n
if n mod i = 0
while n mod i = 0
n = n div i
.
while n mod i = 0 : n = n div i
tot -= tot div i
.
if i = 2
i = 1
.
if i = 2 : i = 1
i += 2
.
if n > 1
tot -= tot div n
.
if n > 1 : tot -= tot div n
return tot
.
numfmt 0 3
@ -23,17 +17,13 @@ print " N Prim Phi"
for n = 1 to 25
tot = totient n
x$ = " "
if n - 1 = tot
x$ = " x "
.
if n - 1 = tot : x$ = " x "
print n & x$ & tot
.
print ""
for n = 1 to 100000
tot = totient n
if n - 1 = tot
cnt += 1
.
if n - 1 = tot : cnt += 1
if n = 100 or n = 1000 or n = 10000 or n = 100000
print n & " - " & cnt & " primes"
.