<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>http://debianws.lexgopc.com/wiki143/index.php?action=history&amp;feed=atom&amp;title=Poussin_proof</id>
	<title>Poussin proof - Revision history</title>
	<link rel="self" type="application/atom+xml" href="http://debianws.lexgopc.com/wiki143/index.php?action=history&amp;feed=atom&amp;title=Poussin_proof"/>
	<link rel="alternate" type="text/html" href="http://debianws.lexgopc.com/wiki143/index.php?title=Poussin_proof&amp;action=history"/>
	<updated>2026-05-14T19:05:48Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.43.1</generator>
	<entry>
		<id>http://debianws.lexgopc.com/wiki143/index.php?title=Poussin_proof&amp;diff=2958971&amp;oldid=prev</id>
		<title>imported&gt;David Eppstein: more context</title>
		<link rel="alternate" type="text/html" href="http://debianws.lexgopc.com/wiki143/index.php?title=Poussin_proof&amp;diff=2958971&amp;oldid=prev"/>
		<updated>2024-05-17T00:17:17Z</updated>

		<summary type="html">&lt;p&gt;more context&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;In [[number theory]], a branch of [[mathematics]], the &amp;#039;&amp;#039;&amp;#039;Poussin proof&amp;#039;&amp;#039;&amp;#039; is the proof of an identity related to the [[fractional part]] of a [[ratio]].&lt;br /&gt;
&lt;br /&gt;
In 1838, [[Peter Gustav Lejeune Dirichlet]] proved an approximate formula for the average number of divisors of all the numbers from 1 to n:&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;\frac{\sum_{k=1}^n d(k)}{n} \approx \ln n + 2\gamma - 1,&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where &amp;#039;&amp;#039;d&amp;#039;&amp;#039; represents the [[divisor function]], and γ represents the [[Euler-Mascheroni constant]].&lt;br /&gt;
&lt;br /&gt;
In 1898, [[Charles Jean de la Vallée-Poussin]] proved that if a large number n is divided by all the primes up to n, then the average fraction by which the quotient falls short of the next whole number is γ:&lt;br /&gt;
:&amp;lt;math&amp;gt;\frac{\sum_{p \leq n}\left \{ \frac{n}{p} \right \}}{\pi(n)} \approx1- \gamma,&amp;lt;/math&amp;gt;&lt;br /&gt;
where {&amp;#039;&amp;#039;x&amp;#039;&amp;#039;} represents the [[fractional part]] of &amp;#039;&amp;#039;x&amp;#039;&amp;#039;, and π represents the [[prime-counting function]].&lt;br /&gt;
For example, if we divide 29 by 2, we get 14.5, which falls short of 15 by 0.5.&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
*Dirichlet, G. L. &amp;quot;[http://gdz.sub.uni-goettingen.de/no_cache/en/dms/load/img/?IDDOC=268296 Sur l&amp;#039;usage des séries infinies dans la théorie des nombres]&amp;quot;, &amp;#039;&amp;#039;Journal für die reine und angewandte Mathematik&amp;#039;&amp;#039; &amp;#039;&amp;#039;&amp;#039;18&amp;#039;&amp;#039;&amp;#039; (1838), pp.&amp;amp;nbsp;259–274. Cited in MathWorld article &amp;quot;Divisor Function&amp;quot; below.&lt;br /&gt;
*de la Vallée Poussin, C.-J. Untitled communication. &amp;#039;&amp;#039;Annales de la Societe Scientifique de Bruxelles&amp;#039;&amp;#039; &amp;#039;&amp;#039;&amp;#039;22&amp;#039;&amp;#039;&amp;#039; (1898), pp.&amp;amp;nbsp;84–90. Cited in MathWorld article &amp;quot;Euler-Mascheroni Constant&amp;quot; below.&lt;br /&gt;
&lt;br /&gt;
==External links==&lt;br /&gt;
*{{MathWorld|urlname=DivisorFunction|title=Divisor Function}}&lt;br /&gt;
*{{MathWorld|urlname=Euler-MascheroniConstant|title=Euler-Mascheroni Constant}}&lt;br /&gt;
&lt;br /&gt;
[[Category:Number theory]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{numtheory-stub}}&lt;/div&gt;</summary>
		<author><name>imported&gt;David Eppstein</name></author>
	</entry>
</feed>