<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://en.formulasearchengine.com/w/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=98.28.166.53</id>
	<title>formulasearchengine - User contributions [en]</title>
	<link rel="self" type="application/atom+xml" href="https://en.formulasearchengine.com/w/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=98.28.166.53"/>
	<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/wiki/Special:Contributions/98.28.166.53"/>
	<updated>2026-07-09T03:55:31Z</updated>
	<subtitle>User contributions</subtitle>
	<generator>MediaWiki 1.47.0-wmf.7</generator>
	<entry>
		<id>https://en.formulasearchengine.com/w/index.php?title=Semantic_compression&amp;diff=27352</id>
		<title>Semantic compression</title>
		<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/w/index.php?title=Semantic_compression&amp;diff=27352"/>
		<updated>2012-07-27T20:35:07Z</updated>

		<summary type="html">&lt;p&gt;98.28.166.53: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;In [[number theory]], a &#039;&#039;&#039;totative&#039;&#039;&#039; of a given positive integer {{mvar|n}} is an integer {{mvar|k}} such that {{math|0 &amp;lt; &#039;&#039;k&#039;&#039; &amp;lt; &#039;&#039;n&#039;&#039;}} and {{mvar|k}} is [[coprime]] to&amp;amp;nbsp;{{mvar|n}}.  [[Euler&#039;s totient function]] φ(&#039;&#039;n&#039;&#039;) counts the number of totatives of &#039;&#039;n&#039;&#039;.  The totatives under multiplication modulo &#039;&#039;n&#039;&#039; form the [[Multiplicative group of integers modulo n|multiplicative group of integers modulo &#039;&#039;n&#039;&#039;]].&lt;br /&gt;
&lt;br /&gt;
The distribution of totatives has been a subject of study.  [[Paul Erdős]] conjectured that, writing the totatives of &#039;&#039;n&#039;&#039; as&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt; 0 &amp;lt; a_1 &amp;lt; a_2 \cdots &amp;lt; a_{\phi(n)} &amp;lt; n ,&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
the mean square gap satisfies&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt; \sum_{i=1}^{\phi(n)-1} (a_{i+1}-a_i)^2 &amp;lt; C n^2 / \phi(n) &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
for some constant &#039;&#039;C&#039;&#039; and this was proved by [[Bob Vaughan]] and [[Hugh Montgomery (mathematician)|Hugh Montgomery]].&amp;lt;ref&amp;gt;{{cite journal | doi=10.2307/1971274 | zbl=0591.10042 | last1=Montgomery | first1=H.L. | author1-link=Hugh Montgomery (mathematician) | last2=Vaughan | first2=R.C. | author2-link=Bob Vaughan | title=On the distribution of reduced residues | journal=Ann. Math. (2) | volume=123 | pages=311–333 | year=1986 }}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==See also==&lt;br /&gt;
*[[Reduced residue system]]&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
{{reflist}}&lt;br /&gt;
* {{cite book |last=Guy | first=Richard K. | authorlink=Richard K. Guy | title=Unsolved problems in number theory | publisher=[[Springer-Verlag]] |edition=3rd | year=2004 |isbn=978-0-387-20860-2 | zbl=1058.11001 | at=B40 }}&lt;br /&gt;
&lt;br /&gt;
==Further reading==&lt;br /&gt;
*{{Citation | last=Sándor | first=Jozsef | last2=Crstici | first2=Borislav | title=Handbook of number theory II | location=Dordrecht | publisher=Kluwer Academic | year=2004 | isbn=1-4020-2546-7 | zbl=1079.11001 | pages=242–250 }}&lt;br /&gt;
&lt;br /&gt;
==External links==&lt;br /&gt;
*{{MathWorld |title=Totative |id=Totative}}&lt;br /&gt;
*{{PlanetMath |urlname=Totative |title=totative}}&lt;br /&gt;
&lt;br /&gt;
[[Category:Modular arithmetic]]&lt;br /&gt;
{{Numtheory-stub}}&lt;/div&gt;</summary>
		<author><name>98.28.166.53</name></author>
	</entry>
</feed>