Search results

{{Short description|Class of numbers in number theory}} {{distinguish|Newman–Shanks–Williams prime}} ...

...]] that divides the numerators of exactly three [[Harmonic_number|harmonic numbers]]. Specifically, a harmonic prime ''p'' is always a factor of the numerators of the partial harmonic sums at positions ''p-1'', ''p*(p-1)'', and ''(p-1)*(p ...

{{Short description|A function of Mathematics}} ...ime number]] ''n'' that justifies the name [[pseudoprime]]s for composite numbers ''n'' satisfying it. ...

{{Short description|Number with prime Hamming weight}} ...t=Elena|last=Deza|author-link=Elena Deza|title=Mersenne Numbers And Fermat Numbers|page=263|publisher=World Scientific|year=2021|isbn=978-9811230332}}</ref> ...

...r from 2 to 20, inclusive, is the difference of at least one pair of prime numbers not exceeding 23: ...rime because 140 < 146, and there is no way to write 140 as the difference of two primes that are less than or equal to 149. ...

...'''bi-twin chain''' of length ''k''&nbsp;+&nbsp;1 is a sequence of natural numbers ...rime number|prime]].<ref>[[Eric W. Weisstein]], ''CRC Concise Encyclopedia of Mathematics'', CRC Press, 2010, page 249.</ref> ...

...10330142435/https://www.quantamagazine.org/mathematicians-find-a-new-class-of-digitally-delicate-primes-20210330/ |archive-date=2021-03-30 }}</ref> ...title=A remark on primality testing and decimal expansions|journal=Journal of the Australian Mathematical Society|volume=91|issue=3|pages=405–413|arxiv=0 ...

{{Short description|Prime number with a certain relationship to an elliptic curve}} ...p'' is '''supersingular for ''E''''' if the [[Good reduction#G|reduction]] of ''E'' modulo&nbsp;''p'' is a [[supersingular elliptic curve]] over the [[re ...

{{Short description|Abundant number whose proper divisors are all deficient numbers}} .... The Erdős definition allows [[perfect number]]s to be primitive abundant numbers too.</ref> ...

...vature]] condition on a geodesic bicombing several results from the theory of [[CAT(k) space|CAT(0) spaces]] and [[Banach space]] theory may be recovered ...(\sigma_{xy}(s), \sigma_{xy}(t))=\vert s-t\vert d(x,y)</math> for all real numbers <math>s,t\in [0,1]</math>.<ref name=":0">{{Cite journal|last1=Descombes|fir ...

{{Short description|Prime number of the form that allows fast modular reduction}} ...9 509]–510|doi=10.1007/978-1-4419-5906-5_32|chapter = Generalized Mersenne Prime|isbn = 978-1-4419-5905-8}}</ref> These primes allow fast modular reduction ...

...mber of positions before and after it in the [[integer sequence|sequence]] of primes. That is, good prime satisfies the [[inequality (mathematics)|inequality]] ...

{{Short description|Number of the form x^2 + xy + y^2}} | OEIS_name = Löschian numbers ...

...would have been an odd perfect number if one of its composite factors were prime}} ...m-of-divisors function]] for {{math| ''D'' }} would satisfy, if 22021 were prime, ...

...ref> Using this property as the starting point for a theory of composition of binary quadratic forms Manjul Bhargava went on to define fourteen different ...ble integers, is called an integer binary quadratic form. The discriminant of the form is defined as ...

...r=[[Richard S. Bird]] |year=1998 |title=Meertens number |journal=[[Journal of Functional Programming]] |volume=8 |issue=1 |pages=83–88 |doi= 10.1017/S0 ...he number in base <math>b</math>, <math>p_i</math> is the <math>i</math>-[[prime number]], and ...

{{Short description|Special type of prime number}} | parentsequence = [[Irregular prime]]s ...

...- 204}}</ref> Several later mathematicians have simplified the formulation of the composition law and have presented it in a format suitable for numerica ...ta</math> is called a [[fundamental discriminant]] [[if and only if]] one of the following statements holds ...

{{Short description|Sequence of numbers}} ...ians for various reasons. They [[Divergence of the sum of the reciprocals of the primes|do not have a finite sum]], as [[Leonhard Euler]] proved in 1737 ...

{{Short description|Bound on the gaps between prime numbers}} [[File:Wikipedia primegaps.png|thumb|450px|Prime gap function]] ...