| Intuitionistic Logic Explorer Theorem List (p. 164 of 175) | < Previous Next > | |
| Browser slow? Try the
Unicode version. |
||
|
Mirrors > Metamath Home Page > ILE Home Page > Theorem List Contents > Recent Proofs This page: Page List |
||
| Type | Label | Description |
|---|---|---|
| Statement | ||
| Theorem | ppival2g 16301 | Value of the prime-counting function pi. (Contributed by Mario Carneiro, 22-Sep-2014.) |
| Theorem | ppiqcl 16302 | Rational closure of the prime-counting function pi. (Contributed by Mario Carneiro, 15-Sep-2014.) |
| Theorem | sgmval 16303* | The value of the divisor function. (Contributed by Mario Carneiro, 22-Sep-2014.) (Revised by Mario Carneiro, 21-Jun-2015.) |
| Theorem | sgmval2 16304* | The value of the divisor function. (Contributed by Mario Carneiro, 21-Jun-2015.) |
| Theorem | 0sgm 16305* | The value of the sum-of-divisors function, usually denoted σ<SUB>0</SUB>(<i>n</i>). (Contributed by Mario Carneiro, 21-Jun-2015.) |
| Theorem | sgmf 16306 | The divisor function is a function into the complex numbers. (Contributed by Mario Carneiro, 22-Sep-2014.) (Revised by Mario Carneiro, 21-Jun-2015.) |
| Theorem | sgmcl 16307 | Closure of the divisor function. (Contributed by Mario Carneiro, 22-Sep-2014.) |
| Theorem | sgmnncl 16308 | Closure of the divisor function. (Contributed by Mario Carneiro, 21-Jun-2015.) |
| Theorem | chtqfl 16309 | The Chebyshev function does not change off the integers. (Contributed by Mario Carneiro, 22-Sep-2014.) |
| Theorem | ppiprm 16310 | The prime-counting function π at a prime. (Contributed by Mario Carneiro, 19-Sep-2014.) |
| Theorem | ppinprm 16311 | The prime-counting function π at a non-prime. (Contributed by Mario Carneiro, 19-Sep-2014.) |
| Theorem | chtprm 16312 | The Chebyshev function at a prime. (Contributed by Mario Carneiro, 22-Sep-2014.) |
| Theorem | chtnprm 16313 | The Chebyshev function at a non-prime. (Contributed by Mario Carneiro, 19-Sep-2014.) |
| Theorem | chtqwordi 16314 | The Chebyshev function is weakly increasing. (Contributed by Mario Carneiro, 22-Sep-2014.) |
| Theorem | chtdif 16315* | The difference of the Chebyshev function at two points sums the logarithms of the primes in an interval. (Contributed by Mario Carneiro, 22-Sep-2014.) |
| Theorem | efchtqdvds 16316 | The exponentiated Chebyshev function forms a divisibility chain between any two points. (Contributed by Mario Carneiro, 22-Sep-2014.) |
| Theorem | ppiqfl 16317 | The prime-counting function π does not change off the integers. (Contributed by Mario Carneiro, 18-Sep-2014.) |
| Theorem | ppiqp1le 16318 | The prime-counting function π cannot locally increase faster than the identity function. (Contributed by Mario Carneiro, 21-Sep-2014.) |
| Theorem | ppiqwordi 16319 | The prime-counting function π is weakly increasing. (Contributed by Mario Carneiro, 19-Sep-2014.) |
| Theorem | ppidif 16320 | The difference of the prime-counting function π at two points counts the number of primes in an interval. (Contributed by Mario Carneiro, 21-Sep-2014.) |
| Theorem | ppi1 16321 |
The prime-counting function π at |
| Theorem | cht1 16322 |
The Chebyshev function at |
| Theorem | ppi1i 16323 | Inference form of ppiprm 16310. (Contributed by Mario Carneiro, 21-Sep-2014.) |
| Theorem | ppi2i 16324 | Inference form of ppinprm 16311. (Contributed by Mario Carneiro, 21-Sep-2014.) |
| Theorem | ppi2 16325 |
The prime-counting function π at |
| Theorem | ppi3 16326 |
The prime-counting function π at |
| Theorem | cht2 16327 |
The Chebyshev function at |
| Theorem | cht3 16328 |
The Chebyshev function at |
| Theorem | ppiqnncl 16329 | Closure of the prime-counting function π in the positive integers. (Contributed by Mario Carneiro, 21-Sep-2014.) |
| Theorem | chtqrpcl 16330 | Closure of the Chebyshev function in the positive reals. (Contributed by Mario Carneiro, 22-Sep-2014.) |
| Theorem | ppiqeq0 16331 |
The prime-counting function π is zero iff its argument is less than
|
| Theorem | ppiqltx 16332 | The prime-counting function π is strictly less than the identity. (Contributed by Mario Carneiro, 22-Sep-2014.) |
| Theorem | prmorcht 16333 |
Relate the primorial (product of the primes up to |
| Theorem | dvdsppwf1o 16334* | A bijection between the divisors of a prime power and the integers less than or equal to the exponent. (Contributed by Mario Carneiro, 5-May-2016.) |
| Theorem | mpodvdsmulf1o 16335* |
If |
| Theorem | fsumdvdsmul 16336* |
Product of two divisor sums. (This is also the main part of the proof
that " |
| Theorem | sgmppw 16337* | The value of the divisor function at a prime power. (Contributed by Mario Carneiro, 17-May-2016.) |
| Theorem | 0sgmppw 16338 |
A prime power |
| Theorem | 1sgmprm 16339 |
The sum of divisors for a prime is |
| Theorem | 1sgm2ppw 16340 |
The sum of the divisors of |
| Theorem | sgmmul 16341 |
The divisor function for fixed parameter |
| Theorem | ppiublem1 16342 | Lemma for ppiqub 16344. (Contributed by Mario Carneiro, 12-Mar-2014.) |
| Theorem | ppiublem2 16343 |
A prime greater than |
| Theorem | ppiqub 16344 |
An upper bound on the prime-counting function π, which counts the
number of primes less than |
| Theorem | chtqleppi 16345 |
Upper bound on the |
| Theorem | chtublem 16346 | Lemma for chtqub 16347. (Contributed by Mario Carneiro, 13-Mar-2014.) |
| Theorem | chtqub 16347 | An upper bound on the Chebyshev function. (Contributed by Mario Carneiro, 13-Mar-2014.) (Revised by MC, 22-Sep-2014.) |
| Theorem | mersenne 16348 |
A Mersenne prime is a prime number of the form |
| Theorem | perfect1 16349 |
Euclid's contribution to the Euclid-Euler theorem. A number of the form
|
| Theorem | perfectlem1 16350 | Lemma for perfect 16352. (Contributed by Mario Carneiro, 7-Jun-2016.) |
| Theorem | perfectlem2 16351 | Lemma for perfect 16352. (Contributed by Mario Carneiro, 17-May-2016.) (Revised by Wolf Lammen, 17-Sep-2020.) |
| Theorem | perfect 16352* |
The Euclid-Euler theorem, or Perfect Number theorem. A positive even
integer |
| Theorem | bcctr 16353 | Value of the central binomial coefficient. (Contributed by Mario Carneiro, 13-Mar-2014.) |
| Theorem | pcbcctr 16354* | Prime count of a central binomial coefficient. (Contributed by Mario Carneiro, 12-Mar-2014.) |
| Theorem | bcmono 16355 | The binomial coefficient is monotone in its second argument, up to the midway point. (Contributed by Mario Carneiro, 5-Mar-2014.) |
| Theorem | bcmax 16356 | The binomial coefficient takes its maximum value at the center. (Contributed by Mario Carneiro, 5-Mar-2014.) |
| Theorem | bcp1ctr 16357 | Ratio of two central binomial coefficients. (Contributed by Mario Carneiro, 10-Mar-2014.) |
| Theorem | bclbnd 16358 | A bound on the binomial coefficient. (Contributed by Mario Carneiro, 11-Mar-2014.) |
| Theorem | prmefexple 16359 | Convert a bound on a power of a prime to a bound on the exponent. (Contributed by Mario Carneiro, 11-Mar-2014.) (Revised by Jim Kingdon, 21-Aug-2026.) |
| Theorem | bpos1lem 16360* | Lemma for bpos1 . (Contributed by Mario Carneiro, 12-Mar-2014.) |
| Theorem | bpos1 16361* |
Bertrand's postulate, checked numerically for |
| Theorem | bposlem1 16362 | An upper bound on the prime powers dividing a central binomial coefficient. (Contributed by Mario Carneiro, 9-Mar-2014.) |
| Theorem | bposlem2 16363 |
There are no odd primes in the range |
| Theorem | bposlem3 16364* |
Lemma for bpos . Since the binomial coefficient does not have any
primes in the range |
| Theorem | bposlem4 16365* | Lemma for bpos . (Contributed by Mario Carneiro, 13-Mar-2014.) |
| Theorem | bposlem5 16366* | Lemma for bpos . Bound the product of all small primes in the binomial coefficient. (Contributed by Mario Carneiro, 15-Mar-2014.) (Proof shortened by AV, 15-Sep-2021.) |
| Theorem | bposlem6 16367* |
Lemma for bpos 16371. By using the various bounds at our
disposal,
arrive at an inequality that is false for |
| Theorem | bposlem7 16368* |
Lemma for bpos 16371. The function |
| Theorem | bposlem8 16369 |
Lemma for bpos 16371. Show that |
| Theorem | bposlem9 16370* | Lemma for bpos 16371. Derive a contradiction. (Contributed by Mario Carneiro, 14-Mar-2014.) (Proof shortened by AV, 15-Sep-2021.) |
| Theorem | bpos 16371* |
Bertrand's postulate: there is a prime between |
If the congruence
Originally, the Legendre symbol | ||
| Syntax | clgs 16372 | Extend class notation with the Legendre symbol function. |
| Definition | df-lgs 16373* | Define the Legendre symbol (actually the Kronecker symbol, which extends the Legendre symbol to all integers, and also the Jacobi symbol, which restricts the Kronecker symbol to positive odd integers). See definition in [ApostolNT] p. 179 resp. definition in [ApostolNT] p. 188. (Contributed by Mario Carneiro, 4-Feb-2015.) |
| Theorem | zabsle1 16374 |
|
| Theorem | lgslem1 16375 |
When |
| Theorem | lgslem2 16376 |
The set |
| Theorem | lgslem3 16377* |
The set |
| Theorem | lgslem4 16378* | Lemma for lgsfcl2 16381. (Contributed by Mario Carneiro, 4-Feb-2015.) (Proof shortened by AV, 19-Mar-2022.) |
| Theorem | lgsval 16379* | Value of the Legendre symbol at an arbitrary integer. (Contributed by Mario Carneiro, 4-Feb-2015.) |
| Theorem | lgsfvalg 16380* |
Value of the function |
| Theorem | lgsfcl2 16381* |
The function |
| Theorem | lgscllem 16382* |
The Legendre symbol is an element of |
| Theorem | lgsfcl 16383* |
Closure of the function |
| Theorem | lgsfle1 16384* |
The function |
| Theorem | lgsval2lem 16385* | Lemma for lgsval2 16391. (Contributed by Mario Carneiro, 4-Feb-2015.) |
| Theorem | lgsval4lem 16386* | Lemma for lgsval4 16395. (Contributed by Mario Carneiro, 4-Feb-2015.) |
| Theorem | lgscl2 16387* | The Legendre symbol is an integer with absolute value less than or equal to 1. (Contributed by Mario Carneiro, 4-Feb-2015.) |
| Theorem | lgs0 16388 | The Legendre symbol when the second argument is zero. (Contributed by Mario Carneiro, 4-Feb-2015.) |
| Theorem | lgscl 16389 | The Legendre symbol is an integer. (Contributed by Mario Carneiro, 4-Feb-2015.) |
| Theorem | lgsle1 16390 |
The Legendre symbol has absolute value less than or equal to 1.
Together with lgscl 16389 this implies that it takes values in
|
| Theorem | lgsval2 16391 |
The Legendre symbol at a prime (this is the traditional domain of the
Legendre symbol, except for the addition of prime |
| Theorem | lgs2 16392 |
The Legendre symbol at |
| Theorem | lgsval3 16393 | The Legendre symbol at an odd prime (this is the traditional domain of the Legendre symbol). (Contributed by Mario Carneiro, 4-Feb-2015.) |
| Theorem | lgsvalmod 16394 |
The Legendre symbol is equivalent to |
| Theorem | lgsval4 16395* |
Restate lgsval 16379 for nonzero |
| Theorem | lgsfcl3 16396* |
Closure of the function |
| Theorem | lgsval4a 16397* |
Same as lgsval4 16395 for positive |
| Theorem | lgscl1 16398 | The value of the Legendre symbol is either -1 or 0 or 1. (Contributed by AV, 13-Jul-2021.) |
| Theorem | lgsneg 16399 | The Legendre symbol is either even or odd under negation with respect to the second parameter according to the sign of the first. (Contributed by Mario Carneiro, 4-Feb-2015.) |
| Theorem | lgsneg1 16400 | The Legendre symbol for nonnegative first parameter is unchanged by negation of the second. (Contributed by Mario Carneiro, 4-Feb-2015.) |
| < Previous Next > |
| Copyright terms: Public domain | < Previous Next > |