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. Please note that this resource requires at least version 1.6 of Java.
1 source code document is available
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. download 19kb .zip Last Modified: October 11, 2013
ComPADRE is beta testing Citation Styles!
Record Link
<a href="http://www.compadre.org/portal/items/detail.cfm?ID=13030">Christian, Wolfgang. "Prime Counting Function Model." Version 1.0.</a>
AIP Format
W. Christian, Computer Program PRIME COUNTING FUNCTION MODEL, Version 1.0 (2013), WWW Document, (http://www.compadre.org/Repository/document/ServeFile.cfm?ID=13030&DocID=3596).
AJP/PRST-PER
W. Christian, Computer Program PRIME COUNTING FUNCTION MODEL, Version 1.0 (2013), <http://www.compadre.org/Repository/document/ServeFile.cfm?ID=13030&DocID=3596>.
APA Format
Christian, W. (2013). Prime Counting Function Model (Version 1.0) [Computer software]. Retrieved January 20, 2017, from http://www.compadre.org/Repository/document/ServeFile.cfm?ID=13030&DocID=3596
Chicago Format
Christian, Wolfgang. "Prime Counting Function Model." Version 1.0. http://www.compadre.org/Repository/document/ServeFile.cfm?ID=13030&DocID=3596 (accessed 20 January 2017).
MLA Format
Christian, Wolfgang. Prime Counting Function Model. Vers. 1.0. Computer software. 2013. Java 1.6. 20 Jan. 2017 <http://www.compadre.org/Repository/document/ServeFile.cfm?ID=13030&DocID=3596>.
BibTeX Export Format
@misc{
Author = "Wolfgang Christian",
Title = {Prime Counting Function Model},
Month = {October},
Year = {2013}
}
Refer Export Format
%A Wolfgang Christian
EndNote Export Format
%0 Computer Program Disclaimer: ComPADRE offers citation styles as a guide only. We cannot offer interpretations about citations as this is an automated procedure. Please refer to the style manuals in the Citation Source Information area for clarifications.
Citation Source Information
The AIP Style presented is based on information from the AIP Style Manual. The APA Style presented is based on information from APA Style.org: Electronic References. The Chicago Style presented is based on information from Examples of Chicago-Style Documentation. The MLA Style presented is based on information from the MLA FAQ. Prime Counting Function Model:
Is Based On
Easy Java Simulations Modeling and Authoring Tool
The Easy Java Simulations Modeling and Authoring Tool is needed to explore the computational model used in the Prime Counting Function Model. relation by Wolfgang ChristianKnow of another related resource? Login to relate this resource to it. |
ContributeRelated MaterialsSimilar Materials |