Package de.tilman_neumann.jml.primes.bounds

Class PrimeCountUpperBoundsTest

java.lang.Object

de.tilman_neumann.jml.primes.bounds.PrimeCountUpperBoundsTest

All Implemented Interfaces:

SieveCallback

public class PrimeCountUpperBoundsTest
extends Object
implements SieveCallback

Test of upper bound estimates for the prime count function.

Author:

Tilman Neumann

Constructor Summary

Constructors

Constructor	Description
PrimeCountUpperBoundsTest()

Method Summary

Modifier and Type	Method	Description
static void	main(String[] args)
void	processPrime(long p)	Fallback method: Receives new primes from the sieve and checks the upper bound estimates for the prime count function.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

PrimeCountUpperBoundsTest

public PrimeCountUpperBoundsTest()

Method Detail

processPrime

public void processPrime(long p)

Fallback method: Receives new primes from the sieve and checks the upper bound estimates for the prime count function. Changing the mod we can regulate the resolution of the data to look at. Searching in the results for something like "du65=-" lets us investigate in which ranges the particular algorithms work.

Specified by:

processPrime in interface SieveCallback

Parameters:

p - the exact n.th prime

main

public static void main(String[] args)