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

61
Task/Totient-function/C/totient-function.c
View file

@ -1,51 +1,52 @@
/*Abhishek Ghosh, 7th December 2018*/
#include <stdio.h>
#include<stdio.h>
int totient(int n){
int tot = n,i;
int
totient(int n)
{
int result = n;
for(i=2;i*i<=n;i+=2){
if(n%i==0){
while(n%i==0)
n/=i;
tot-=tot/i;
for (int i=2; i*i <= n; i+=2) {
if (n % i == 0) {
while (n % i == 0)
n /= i;
result -= result / i;
}
if(i==2)
i=1;
if (i == 2)
i = 1;
}
if(n>1)
tot-=tot/n;
return tot;
if (n > 1)
result -= result / n;
return result;
}
int main()
int
main(void)
{
int count = 0,n,tot;
int count, n, tot;
printf(" n %c prime",237);
printf("\n---------------\n");
for(n=1;n<=25;n++){
printf(" n phi prime\n");
printf("--------------\n");
count = 0;
for (n = 1; n <= 25; n++) {
tot = totient(n);
if(n-1 == tot)
if (tot == n - 1)
count++;
printf("%2d %2d %s\n", n, tot, n-1 == tot?"True":"False");
printf("%2d %2d %s\n", n, tot, tot == (n-1) ? "true" : "false");
}
printf("\nNumber of primes up to %6d =%4d\n", 25,count);
for(n = 26; n <= 100000; n++){
printf("\n");
for (n = 26; n <= 100000; n++) {
tot = totient(n);
if(tot == n-1)
if (tot == n-1)
count++;
if(n == 100 || n == 1000 || n%10000 == 0){
if (n == 100 || n == 1000 || n == 10000) {
printf("\nNumber of primes up to %6d = %4d\n", n, count);
}
}