Search results

| named_after = [[Paul Erdős]], [[Jean-Louis Nicolas]] | author = [[Paul Erdős|Erdős, P.]], [[Jean-Louis Nicolas|Nicolas, J. L.]] ...

...dős Sumset conjecture|date = 20 August 2017}}</ref> It was posed by [[Paul Erdős]], and was proven in 2019 in a paper by Joel Moreira, Florian Richter and D *[[List of conjectures by Paul Erdős]] ...

...concerning the distribution of [[prime number]]s. It is named after [[Paul Erdős]] and Hubert Delange. ...ed it in 1958, together with two other ways of deducing it from results of Erdős and of [[Atle Selberg]].{{r|delange}} ...

{{For|the discrete mathematics theorem|Erdős–Ko–Rado theorem}} ...l|Rado|1965}} and hence the result is sometimes also referred to as the '''Erdős–Rado–Kurepa theorem'''. ...

...ematics]], '''Erdős space''' is a [[topological space]] named after [[Paul Erdős]], who described it in 1940.<ref name="erdos">{{citation | last = Erdős | first = Paul ...

In [[probability theory]], the '''Chung–Erdős inequality''' provides a lower bound on the probability that one out of man The inequality was first derived by [[Kai Lai Chung]] and [[Paul Erdős]] (in,<ref>{{Cite journal|last=Chung|first=K. L.|last2=Erdös|first2=P.|date ...

<!-- Note: The following pages were redirects to [[Erdős–Kaplansky_theorem]] before draftification: *[[Erdős-Kaplansky theorem]] ...

In [[number theory]], the '''Erdős arcsine law''', named after [[Paul Erdős]] in 1969,<ref>{{Cite book |last=Manstavičius |first=E. |title=Probability ...r=TEV | location=Vilnius | mr=1649597 | year=1994 | chapter=A proof of the Erdős arcsine law | pages=533–539}} ...

The '''Erdős–Tenenbaum–Ford constant''' is a [[mathematical constant]] that appears in [ ...h.edu/~carlp/rangeoflambda13.pdf}}</ref> Named after mathematicians [[Paul Erdős]], [[Gérald Tenenbaum]], and [[Kevin Ford (mathematician)|Kevin Ford]], it ...

...nd Guiduli. ''Topics in the Theory of Numbers'' p214. Springer 2003.). The Erdős definition allows [[perfect number]]s to be primitive abundant numbers too. ...to ''n'' is <math>o \left( \frac{n}{\log^2(n)} \right)\, .</math><ref>Paul Erdős, ''Journal of the London Mathematical Society'' 9 (1934) 278&ndash;282.</re ...

He is the namesake (with [[Paul Erdős]]) of the [[Erdős–Nicolas number]]s,<ref>{{citation |first1 = P. |last1 = Erdős | author1-link=Paul Erdős ...

In the mathematical theory of [[infinite graph]]s, the '''Erdős–Dushnik–Miller theorem''' is a form of [[Ramsey's theorem]] stating that ev ...equal cardinality to the whole graph. In their paper, they credited [[Paul Erdős]] with assistance in its proof. They applied these results to the [[compara ...

...ntributions to the [[Zero-sum problem]] as one of the discoverers of the [[Erdős–Ginzburg–Ziv theorem]]. ...ms that sum to zero.<ref name="zbmath">{{cite journal |last1=Erdős |first1=Paul |last2=Ginzburg |first2=A. |last3=Ziv |first3=A. |title=A theorem in additi ...

| last1 = Erdős | first1 = P. | author1-link = Paul Erdős ...The problem of characterizing irrationality sequences was posed by [[Paul Erdős]] and [[Ernst G. Straus]], who originally called the property of being an i ...

...remal graph theory]], the '''even circuit theorem''' is a result of [[Paul Erdős]] according to which an {{mvar|n}}-vertex graph that does not have a simple The result was stated without proof by Erdős in 1964.<ref>{{citation ...

[[File:The Erdős Distance Problem.jpg|thumb|First edition]] '''''The Erdős Distance Problem''''' is a [[monograph]] on the [[Erdős distinct distances problem]] in [[discrete geometry]]: how can one place <m ...

.../DL/publications/PU00018587.pdf}}</ref><ref>{{cite journal|mr=0027895|last=Erdős|first=P.|last2=Turán|first2=P.|title=On a problem in the theory of uniform ...''μ'' be a probability measure on the [[unit circle]] '''R'''/'''Z'''. The Erdős–Turán inequality states that, for any natural number ''n'', ...

...thor1-link=Paul T. Bateman | last2=Erdős | first2=Paul | author2-link=Paul Erdős | last3=Pomerance | first3=Carl | author3-link=Carl Pomerance | last4=Strau ...

...e has a nearly-linear number of distinct distances. It was posed by [[Paul Erdős]] in 1946<ref name="Erdos1946">{{cite journal | first=Paul | last=Erdős | author-link=Paul Erdős ...

...Behrend's theorem. Resolving a conjecture of [[G. H. Hardy]], both [[Paul Erdős]] and [[Subbayya Sivasankaranarayana Pillai]] showed that, for <math>k\appr ...nd]] proved it in 1934,{{r|s13}} and published it in 1935.{{r|b35}} [[Paul Erdős]] proved the same result, on a 1934 train trip from Hungary to Cambridge to ...