Search results
Jump to navigation
Jump to search
Page title matches
- {{Short description|Book on prime numbers}} | name = Closing the Gap: The Quest to Understand Prime Numbers ...6 KB (816 words) - 23:10, 24 September 2022
Page text matches
- {{Short description|Class of numbers in number theory}} {{distinguish|Newman–Shanks–Williams prime}} ...2 KB (239 words) - 07:28, 31 May 2024
- ...]] 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 ...1 KB (194 words) - 01:55, 4 January 2025
- {{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> ...3 KB (432 words) - 07:38, 16 April 2023
- {{short description|Existence of a prime number between each square and pronic number}} ...mber and a pronic number (both greater than one) separated by at least one prime?}} ...3 KB (529 words) - 23:11, 8 June 2024
- ...have a record number of terms in their greedy representations as sums of [[prime number]]s (and one). ...h> as a sum of primes: choose the first prime in the sum to be the largest prime <math>p</math> that is at most <math>n</math>, and then recursively constru ...3 KB (443 words) - 18:01, 29 January 2023
- {{Short description|Conjecture about prime numbers}} ...ly many positive integers {{mvar|n}} for which they are all [[prime number|prime]], unless there is a [[Modular arithmetic|congruence]] condition preventing ...3 KB (397 words) - 06:22, 17 February 2025
- {{Short description|Palindromic prime number}} [[File:Belphegor's prime.svg|thumb|Symbol of Belphegor's prime, represented by the Greek letter π upside down]] ...4 KB (547 words) - 19:05, 22 February 2025
- ...ime number]] ''n'' that justifies the name [[pseudoprime]]s for composite numbers ''n'' satisfying it. ...being squares of [[Wieferich prime]]s. In general, if ''p'' is a Wieferich prime, then ''p''<sup>2</sup> is a Catalan pseudoprime. ...1 KB (165 words) - 13:56, 27 October 2024
- {{Short description|Inequality relating the primorial to square of the next prime number}} .../sub>, ''p''<sub>''n''+1</sub> are the smallest ''n'' + 1 [[prime number]]s and ''n'' ≥ 4, then ...2 KB (221 words) - 14:47, 5 August 2022
- ...r from 2 to 20, inclusive, is the difference of at least one pair of prime numbers not exceeding 23: On the other hand, [[149 (number)|149]] is not a cluster prime because 140 < 146, and there is no way to write 140 as the difference of tw ...3 KB (414 words) - 00:58, 17 September 2024
- | prime = 63rd | divisor = 1, 307 ...<ref>{{Cite OEIS|A109611|Chen primes: primes p such that p + 2 is either a prime or a semiprime}}</ref><ref>{{Cite arXiv|title=Chen primes in arithmetic pro ...2 KB (279 words) - 14:59, 27 February 2025
- ...'''bi-twin chain''' of length ''k'' + 1 is a sequence of natural numbers in which every number is [[prime number|prime]].<ref>[[Eric W. Weisstein]], ''CRC Concise Encyclopedia of Mathematics'', ...3 KB (390 words) - 14:37, 29 January 2025
- ...orem''' is a theorem in [[number theory]] concerning the distribution of [[prime number]]s. It is named after [[Paul Erdős]] and Hubert Delange. ...ymptotically uniformly distributed modulo 1.{{r|delange}} It implies the [[prime number theorem]].{{r|bergelson-richter}} ...2 KB (274 words) - 09:26, 18 November 2024
- ...g and [[Paul Erdős]], was used in the first [[elementary proof]] for the [[prime number theorem]]. where the numbers ...3 KB (430 words) - 19:56, 21 August 2023
- ...me''', '''digitally delicate prime''', or '''weakly prime number''' is a [[prime number]] where, under a given [[radix]] but generally [[decimal]], replacin ...ually changed to every other digit. There are infinitely many weakly prime numbers in any base. Furthermore, for any fixed base there is a positive proportion ...5 KB (633 words) - 08:47, 7 June 2024
- {{Short description|Theorem about prime numbers}} ...' is a theorem due to [[Helmut Maier]] about the numbers of [[Prime number|prime]]s in short intervals for which [[Cramér model|Cramér's probabilistic model ...3 KB (406 words) - 03:13, 20 January 2025
- ...on the [[integer]]s. The following sections list important or interesting prime-related congruences. ...th> || special case of [[Fermat's little theorem]], satisfied by all odd [[prime number]]s ...5 KB (729 words) - 16:10, 25 August 2024
- ...], '''Granville numbers''', also known as <math>\mathcal{S}</math>-perfect numbers, are an extension of the [[perfect number]]s. ...nslator-first = J. M. |translator-last=de Koninck |title=Those Fascinating Numbers |url=https://archive.org/details/thosefascinating0000koni/page/40/mode/2up ...5 KB (770 words) - 18:59, 11 May 2024
- ...is defined as the product of the first {{math|''n''}} positive [[Fibonacci numbers]], i.e. ...ficient]]s (or Fibonacci-binomial coefficients) similarly as the factorial numbers are used in the definition of [[binomial coefficients]]. ...3 KB (379 words) - 17:38, 13 May 2024
- ...d <math>n</math> equal zero. Consider the set <math>T(a,b)</math> of prime numbers <math>p</math> such that <math>p</math> evenly divides <math>a^k - b</math> *[[Twin prime constant]] ...2 KB (297 words) - 13:51, 7 October 2024