<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://number.subwiki.org/w/index.php?action=history&amp;feed=atom&amp;title=Divisor_count_summatory_function</id>
	<title>Divisor count summatory function - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://number.subwiki.org/w/index.php?action=history&amp;feed=atom&amp;title=Divisor_count_summatory_function"/>
	<link rel="alternate" type="text/html" href="https://number.subwiki.org/w/index.php?title=Divisor_count_summatory_function&amp;action=history"/>
	<updated>2026-04-12T15:01:04Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.41.2</generator>
	<entry>
		<id>https://number.subwiki.org/w/index.php?title=Divisor_count_summatory_function&amp;diff=298&amp;oldid=prev</id>
		<title>Vipul: Created page with &#039;{{summatory function|divisor count function}}  ==Definition==  Let &lt;math&gt;x&lt;/math&gt; be a positive real number. The &#039;&#039;&#039;divisor count summatory function&#039;&#039;&#039; of &lt;math&gt;x&lt;/math&gt; is defin...&#039;</title>
		<link rel="alternate" type="text/html" href="https://number.subwiki.org/w/index.php?title=Divisor_count_summatory_function&amp;diff=298&amp;oldid=prev"/>
		<updated>2009-05-02T22:30:35Z</updated>

		<summary type="html">&lt;p&gt;Created page with &amp;#039;{{summatory function|divisor count function}}  ==Definition==  Let &amp;lt;math&amp;gt;x&amp;lt;/math&amp;gt; be a positive real number. The &amp;#039;&amp;#039;&amp;#039;divisor count summatory function&amp;#039;&amp;#039;&amp;#039; of &amp;lt;math&amp;gt;x&amp;lt;/math&amp;gt; is defin...&amp;#039;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;{{summatory function|divisor count function}}&lt;br /&gt;
&lt;br /&gt;
==Definition==&lt;br /&gt;
&lt;br /&gt;
Let &amp;lt;math&amp;gt;x&amp;lt;/math&amp;gt; be a positive real number. The &amp;#039;&amp;#039;&amp;#039;divisor count summatory function&amp;#039;&amp;#039;&amp;#039; of &amp;lt;math&amp;gt;x&amp;lt;/math&amp;gt; is defined as the [[summatory function]] for the [[defining ingredient::divisor count function]]:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;x \mapsto \sum_{k \le x} \sigma_0(k)&amp;lt;/math&amp;gt;,&lt;br /&gt;
&lt;br /&gt;
where the sum is over positive integers &amp;lt;math&amp;gt;k&amp;lt;/math&amp;gt;, and &amp;lt;math&amp;gt;\sigma_0(k)&amp;lt;/math&amp;gt; is the number of positive integers dividing &amp;lt;math&amp;gt;k&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
This function can alternatively be defined as:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;\sum_{d \le x} \left[\frac{x}{d} \right]&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
Here, the square braces represent the greatest integer function. In other words, while the earlier expression counts for each element less than or equal to &amp;lt;math&amp;gt;x&amp;lt;/math&amp;gt; the number of its divisors, the new expression counts for each possible divisor the number of multiples it has. Clearly, both expressions are equivalent.&lt;br /&gt;
&lt;br /&gt;
==Behavior==&lt;br /&gt;
&lt;br /&gt;
===Growth===&lt;br /&gt;
&lt;br /&gt;
The divisor count function for a natural number &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt; grows as:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;n \log n + (2\gamma - 1)n + O(n^\theta)&amp;lt;/math&amp;gt;,&lt;br /&gt;
&lt;br /&gt;
where &amp;lt;math&amp;gt;\gamma&amp;lt;/math&amp;gt; is the [[Euler-Mascheroni constant]], and &amp;lt;math&amp;gt;\theta&amp;lt;/math&amp;gt; is a (not completely determined) constant greater than &amp;lt;math&amp;gt;1/4&amp;lt;/math&amp;gt;. The current best upper bound known for &amp;lt;math&amp;gt;\theta&amp;lt;/math&amp;gt; is &amp;lt;math&amp;gt;131/416&amp;lt;/math&amp;gt;.&lt;/div&gt;</summary>
		<author><name>Vipul</name></author>
	</entry>
</feed>