test(N)=
{
  default(primelimit, N);
  for (b=10, 20, print1(prime(2^b), " "));
  for (b=10, 26, print1(primepi(2^b), " "));
}
prime(41539)

test(10^6);
test(10^8);
primepi(2^32)
precprime(1)
primepi(2750160) \\ #1855

primes(50)
primes([-5,5])
primes([3/2, 11/2])
primes([10,20])
primes([2^32-100,2^32+100])
primes([2^64-100,2^64+100])
#primes([2^50,2^50+200000])
#primes([10^7, 10^7+10^6])
#primes([2^1023+5000, 2^1023+7000])

nextprime(2^32-1)
nextprime(2^64-1)
nextprime(2.5)
precprime(2.5)

\\ #2584
forprime(p=524288,1048576,1)
forprime(p=1048607,1048617,1)

\\ #2612
forprime(p=1099505335069-100000,1099505335069+10000,)

\\ Errors, keep at end of file
\\#1668
primes([1,Pol(2)]);
nextprime(x)
precprime(x)
\\#2113 Cannot test: the test would not finish before end of universe.
\\\p520
\\primepi(Pi*10^100)
