![]() |
![]() |
#1 |
May 2004
22·79 Posts |
![]()
In pari {p(n)=isprime(x^2+1)} will generate a number of primes indicated by 1 in a given interval. How do we count these? Request for a counting program.
Example what is the number of primes generated in (n=10,111)? A.K. Devaraj |
![]() |
![]() |
![]() |
#2 |
Aug 2006
2×29×103 Posts |
![]()
I think what you're asking for is
Code:
sum(n=10,111,isprime(n^2+1)) |
![]() |
![]() |
![]() |
#3 |
May 2004
1001111002 Posts |
![]() |
![]() |
![]() |
![]() |
#4 |
May 2004
22·79 Posts |
![]() |
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Prime95 defaults - your input requested | Prime95 | PrimeNet | 25 | 2016-03-25 19:32 |
Rigour Requested | davieddy | Math | 0 | 2013-04-25 11:47 |
Search engine feedback requested. | Xyzzy | Forum Feedback | 2 | 2007-05-28 04:22 |
ecm benchmarks requested for Stage 1 and 2 | jasong | GMP-ECM | 0 | 2007-04-19 02:25 |
Iterations requested for factoring... | guido72 | Software | 16 | 2002-09-09 21:12 |