<?xml version="1.0" encoding="UTF-8" ?>
  <resource>
  <id>6431</id>
  <path>/www/nrich/html/content/id/6431/</path>
  <resourceTypeID>1</resourceTypeID>
  <last_published>2011-06-09T11:35:54</last_published>
  <indexXML>&lt;mdoxml xmlns:ns0=&quot;http://nrich.maths.org/mdo&quot; version=&quot;1.0&quot;&gt;
  &lt;br /&gt;
  &lt;ul id=&quot;buttonBar&quot;&gt;
    &lt;li&gt;
      &lt;a href=&quot;http://nrich.maths.org/396&amp;amp;part=&quot;&gt;Warm-up
problem&lt;/a&gt;
    &lt;/li&gt;
    &lt;li&gt;
      &lt;a href=&quot;http://nrich.maths.org/7029&amp;amp;part=&quot;&gt;Try this next&lt;/a&gt;
    &lt;/li&gt;
    &lt;li&gt;
      &lt;a href=&quot;https://nrich.maths.org/discus/messages/27/27.html?1307565044&quot;&gt;
Ask NRICH&lt;/a&gt;
    &lt;/li&gt;
    &lt;li&gt;
      &lt;a href=&quot;http://en.wikipedia.org/wiki/Prime-counting_function&quot;&gt;Read
all about it&lt;/a&gt;
    &lt;/li&gt;
    &lt;li&gt;
      &lt;a href=&quot;http://nrich.maths.org/6322&amp;amp;part=solution&quot;&gt;Last week's
solution&lt;/a&gt;
    &lt;/li&gt;
  &lt;/ul&gt;
  &lt;div&gt;
    &lt;br /&gt;
    &lt;br /&gt;
The &lt;span style=&quot;font-style: italic;&quot;&gt;prime counting
function&lt;/span&gt; $\Pi(x)$ counts how many prime numbers are less
than or equal to $x$ for any positive value of $x$. Since the
primes start $2, 3, 5, 7, 11, 13, \dots$ we therefore have, for
example, $\Pi(11) = 5$ and $\Pi(8) = 4$.&lt;br /&gt;
    &lt;br /&gt;
It is believed by mathematicians that $\frac{x}{\ln(x)}$ is a good
approximation to $\Pi(x)$. It is believed to get progressively
better as $x$ increases to very, very large numbers. How well does
it work for lower values of $x$ (up to the 100,000th prime)&lt;br /&gt;
    &lt;br /&gt;
Use the following interactivity to examine the percentage accuracy
of this approximation for these values.&lt;br /&gt;
    &lt;br /&gt;
    &lt;br /&gt;
    &lt;mdo:flash height=&quot;375&quot; width=&quot;500&quot;&gt;
      &lt;param name=&quot;movie&quot; value=&quot;/content/id/6431/PrimeLookup.swf&quot; /&gt;
      &lt;param name=&quot;flashplayerversion&quot; value=&quot;9&quot; /&gt;
    &lt;/mdo:flash&gt;
    &lt;br /&gt;
    &lt;br /&gt;
Use a few sensible values / choice of axes to try to create a
useful graphical representation of $\ln(\Pi(x))$ against $\ln(x)$
for $x$ taking values up to about a million. Use your curve to try
to predict $\Pi(x)$ for a few values of $x$ away from your data
points. How close are your estimates for whole number multiples of
$100,000$?&lt;br /&gt;
    &lt;br /&gt;
Use your judgement to try to extrapolate your curve to make
approximations as to&lt;br /&gt;
$$&lt;br /&gt;
\Pi(10^7)\quad\quad \Pi(10^8)\quad\quad \Pi(10^9)&lt;br /&gt;
$$&lt;br /&gt;
    &lt;br /&gt;
    &lt;br /&gt;
    &lt;br /&gt;
  &lt;/div&gt;
  &lt;div class=&quot;framework&quot;&gt;
    &lt;span style=&quot;font-style: italic;&quot;&gt;Did you
know ... ?&lt;/span&gt;
    &lt;br /&gt;
    &lt;br /&gt;
Although prime numbers are distributed with some large-scale
regularity across the natural numbers, as this problem indicates,
there is no known process&amp;#160;which generates the prime
numbers.&amp;#160;&lt;/div&gt;
  &lt;br /&gt;
&lt;/mdoxml&gt;
</indexXML>
  <solutionXML>&lt;?xml version=&quot;1.0&quot; encoding=&quot;UTF-8&quot;?&gt;
&lt;mdoxml version=&quot;1.0&quot;&gt;&lt;br&gt;&lt;/br&gt;
Here are some low values&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
&lt;mdo:image height=&quot;179&quot; width=&quot;287&quot; src=&quot;tables%20of%20values.JPG&quot; alt=&quot;&quot;&gt;&lt;/mdo:image&gt;&lt;br&gt;&lt;/br&gt;
 &lt;br&gt;&lt;/br&gt;
 &lt;br&gt;&lt;/br&gt;
 &lt;br&gt;&lt;/br&gt;&lt;/mdoxml&gt;</solutionXML>
  <noteXML/>
  <clueXML/>
  <canonXML>&lt;?xml version=&quot;1.0&quot; encoding=&quot;UTF-8&quot;?&gt;
&lt;mdoxml version=&quot;1.0&quot;&gt;&lt;br&gt;&lt;/br&gt;
Here are some low values&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
&lt;mdo:image height=&quot;179&quot; width=&quot;287&quot; src=&quot;tables%20of%20values.JPG&quot; alt=&quot;&quot;&gt;&lt;/mdo:image&gt;&lt;br&gt;&lt;/br&gt;
 &lt;br&gt;&lt;/br&gt;
 &lt;br&gt;&lt;/br&gt;
 &lt;br&gt;&lt;/br&gt;&lt;/mdoxml&gt;</canonXML>
  <end_user_role>2</end_user_role>
  <difficulty>3</difficulty>
  <keystage1>0</keystage1>
  <keystage2>0</keystage2>
  <keystage3>0</keystage3>
  <keystage4>0</keystage4>
  <keystage4plus>1</keystage4plus>
  <title>Weekly challenge 44: Prime counter</title>
  <description>A weekly challenge concerning prime numbers.</description>
  <spec_group>Collections
    <specifier>Weekly Challenge</specifier>
  </spec_group>
  <spec_group>Numbers and the Number System
    <specifier>Prime numbers</specifier>
  </spec_group>
  <spec_group>Information and Communications Technology
    <specifier>Interactivities</specifier>
  </spec_group>
  <spec_group>Sequences, Functions and Graphs
    <specifier>Logarithmic functions</specifier>
  </spec_group>
</resource>