Search results
Jump to navigation
Jump to search
- {{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
- ...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
- {{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
- ...er bound]] on the distribution of [[primes in arithmetic progression|prime numbers in arithmetic progression]]. ...Motohashi|first=Yoichi|authorlink=Yoichi Motohashi|title=Sieve Methods and Prime Number Theory|publisher=Tata IFR and Springer-Verlag|year=1983|isbn=3-540-1 ...3 KB (385 words) - 12:15, 9 February 2025
- ...ith finitely many prime factors necessarily introduces infinitely many new prime factors.<ref name="kobayashi">{{cite journal | title = On Existence of Infinitely Many Prime Divisors in a Given Set ...3 KB (513 words) - 13:58, 2 January 2025
- ...description|On the divisibility of solutions to Fermat's Last Theorem for prime exponent}} ...equation <math>x^p + y^p = z^p</math> of [[Fermat's Last Theorem]] for odd prime <math>p</math>. ...3 KB (503 words) - 10:46, 24 February 2025
- ...ly in many theorems in [[number theory]]. The following are a few of these theorems.<ref name=MAA/> ..., a polynomial in which the coefficients are integers and are [[relatively prime]] to each other. If the degree of ''f''(''x'') is ''k'' then the [[greatest ...12 KB (1,704 words) - 07:58, 25 January 2024
- ...400px|[[Hasse diagram]] of the [[lattice (order)|lattice]] of supernatural numbers; primes other than 2 and 3 are omitted for simplicity.]] ...bers''', sometimes called '''generalized natural numbers''' or '''Steinitz numbers''', are a generalization of the [[natural number]]s. They were used by [[Er ...4 KB (616 words) - 18:08, 23 November 2024
- ...nd the relations).<ref>{{harvnb|Procesi|2007|loc=Ch. 9, § 1.4.}}</ref> The theorems are among the most important results of [[invariant theory]]. ...haracteristic (algebra)|characteristic]]-free invariant theory extends the theorems to a [[field (mathematics)|field]] of arbitrary characteristic.<ref>{{harvn ...3 KB (472 words) - 23:31, 4 February 2025
- ...[[number fields]], i.e., finite [[field extension]]s ''K'' of the rational numbers '''Q''', such that the [[discriminant of an algebraic number field|discrimi ...''Q''' is not ±1, which in turn implies that '''Q''' has no [[Splitting of prime ideals in Galois extensions|unramified]] extensions. ...1 KB (185 words) - 13:33, 6 June 2024
- ...istributed equally across possible progressions with the same difference. Theorems of the Barban–Davenport–Halberstam type give estimates for the error term, ...057 | last=Hooley | first=C. | author-link=Christopher Hooley | chapter=On theorems of Barban-Davenport-Halberstam type | pages=75–108 | editor1-last=Bennett | ...2 KB (361 words) - 07:17, 18 December 2024
- {{About|a theorem in number theory||Hurwitz's theorem (disambiguation){{!}}Hurwitz' ...nal number]] ''ξ'' there are infinitely many [[coprime integers|relatively prime]] integers ''m'', ''n'' such that ...2 KB (312 words) - 09:05, 12 October 2024
- {{short description|Characterization of even perfect numbers}} ...perfect numbers and Mersenne primes|the theorem on the infinitude of prime numbers|Euclid's theorem}} ...11 KB (1,593 words) - 11:01, 2 December 2024
- ...technique introduced by [[Alexander Grothendieck]] for proving statements about [[coherent sheaf|coherent sheaves]] on [[noetherian scheme]]s. Dévissage is ...coherent ''O''<sub>''X''</sub>-module whose support is contained in ''X''′ is contained in '''C'''.<ref>EGA III, Théorème 3.1.2</ref> ...6 KB (1,031 words) - 20:56, 29 November 2020
- ...escription|Result in number theory showing congruences involving Bernoulli numbers}} ...nces''' are some [[Congruence relation|congruence]]s involving [[Bernoulli numbers]], found by {{harvs|txt|authorlink=Ernst Eduard Kummer|first=Ernst Eduard|l ...3 KB (395 words) - 16:15, 15 October 2024
- {{short description|Characterization by prime factors of sums of two squares}} In [[number theory]], the '''sum of two squares theorem''' relates the [[prime decomposition]] of any [[integer]] {{math|{{var|n}} > 1}} to whether it can ...6 KB (849 words) - 11:50, 5 January 2025
- ...''K<sup>s</sup>''. Given a finite ''G<sub>K</sub>''-module ''A'' of order prime to the [[characteristic (algebra)|characteristic]] of ''K'', the Tate dual :<math>A^\prime=\mathrm{Hom}(A,\mu)</math> ...4 KB (678 words) - 16:09, 19 September 2021
- ...tegers]] of ''K''. Tate's result then states that if ''m'' is [[relatively prime]] to the [[characteristic (algebra)|characteristic]] of ''K'', then<ref>{{h ...one. If ''K'' is a [[finite extension]] of the [[p-adic number|''p''-adic numbers]] '''Q'''<sub>''p''</sub>, and if ''v<sub>p</sub>'' denotes the [[p-adic va ...3 KB (539 words) - 19:11, 21 June 2022
- ...pecifically it tells us that we can get a good approximation to irrational numbers that are not quadratic by using either [[quadratic irrational]]s or simply ...l zero, the first non-zero one among them is positive, they are relatively prime, and we have ...2 KB (356 words) - 22:51, 27 November 2022
- ...ic]] [[univalent function]]s defined on the [[unit disk]] in the [[complex numbers]]. The theorem states that a univalent function defined on the unit disc, ...e]] with respect to 0, , i.e. it is invariant under multiplication by real numbers in (0,1). ...6 KB (926 words) - 12:35, 10 June 2020