Prime Counting Function Model Documents

This material has 2 associated documents. Select a document title to view a document's information.

Main Document

Prime Counting Function Model 

written by Wolfgang Christian

The Prime Counting Function model uses the trial division algorithm to compute the number of primes less than or equal to the number n. Although the trial division algorithm is inefficient, we use it to perform a lengthy calculation while a standard EJS simulation thread accumulates and plots data from the parallel computation.   Users can vary the number of independent threads and observe the computational time.

The Prime Counting Function Model was created using the Easy Java Simulations (EJS) modeling tool.  It is distributed as a ready-to-run (compiled) Java archive.  Double clicking the model's jar file will run the simulation if Java is installed.

Published October 11, 2013
Last Modified June 11, 2014

This file has previous versions.

Source Code Documents

Prime Counting Function Source Code 

The source code zip archive contains an XML representation of the Prime Counting Function Model.   Unzip this archive in your Ejs workspace to compile and run this model using Ejs.

Last Modified October 11, 2013