10537
EXPLORE
LATEST
ABOUT
AUTHORING AREA
PARTICIPATE
Your browser does not support JavaScript or it may be disabled!
Second Hardy-Littlewood Conjecture
The function
gives the number of primes less than or equal to
. The second Hardy–Littlewood conjecture states that
for
. The plot identifies
and
with pixel coordinates and renders
, with darker points corresponding to larger values.
Contributed by:
Michael Schreiber
THINGS TO TRY
Slider Zoom
SNAPSHOTS
RELATED LINKS
Hardy–Littlewood Conjectures
(
Wolfram
MathWorld
)
Prime Counting Function
(
Wolfram
MathWorld
)
PERMANENT CITATION
"
Second Hardy-Littlewood Conjecture
" from
the Wolfram Demonstrations Project
http://demonstrations.wolfram.com/SecondHardyLittlewoodConjecture/
Contributed by:
Michael Schreiber
Share:
Embed Interactive Demonstration
New!
Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site.
More details »
Download Demonstration as CDF »
Download Author Code »
(preview »)
Files require
Wolfram
CDF Player
or
Mathematica
.
Related Demonstrations
More by Author
Sieve of Eratosthenes
George Beck
Gaps between Consecutive Primes
Michael Schreiber
Copeland-Erdos and Champernowne Numbers for Small Bases
Michael Schreiber
Comparison of Factorials and Primorials
Michael Schreiber
Successive Differences and Accumulations of the Jacobi Symbol
Michael Schreiber
Random Binary Differences
Michael Schreiber
Coordinate Sonification
Michael Schreiber
Iterated Random Rotation 3D
Michael Schreiber
Gilbreath's Conjecture
Peter Bohus and Márton Károlyi
Levy's Conjecture
Jay Warendorff
Related Topics
Mathematica Functionality
Number Theory
Prime Numbers
Short Programs
Statistics
Browse all topics
Note: To run this Demonstration you need Mathematica 7+ or the free Mathematica Player 7EX
Download or upgrade to
Mathematica Player 7EX
I already have
Mathematica Player
or
Mathematica 7+