Home | Intuitionistic Logic Explorer Theorem List (p. 118 of 133) | < 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 | dvdsgcdb 11701 | Biconditional form of dvdsgcd 11700. (Contributed by Scott Fenton, 2-Apr-2014.) (Revised by Mario Carneiro, 19-Apr-2014.) |
Theorem | dfgcd2 11702* | Alternate definition of the operator, see definition in [ApostolNT] p. 15. (Contributed by AV, 8-Aug-2021.) |
Theorem | gcdass 11703 | Associative law for operator. Theorem 1.4(b) in [ApostolNT] p. 16. (Contributed by Scott Fenton, 2-Apr-2014.) (Revised by Mario Carneiro, 19-Apr-2014.) |
Theorem | mulgcd 11704 | Distribute multiplication by a nonnegative integer over gcd. (Contributed by Paul Chapman, 22-Jun-2011.) (Proof shortened by Mario Carneiro, 30-May-2014.) |
Theorem | absmulgcd 11705 | Distribute absolute value of multiplication over gcd. Theorem 1.4(c) in [ApostolNT] p. 16. (Contributed by Paul Chapman, 22-Jun-2011.) |
Theorem | mulgcdr 11706 | Reverse distribution law for the operator. (Contributed by Scott Fenton, 2-Apr-2014.) (Revised by Mario Carneiro, 19-Apr-2014.) |
Theorem | gcddiv 11707 | Division law for GCD. (Contributed by Scott Fenton, 18-Apr-2014.) (Revised by Mario Carneiro, 19-Apr-2014.) |
Theorem | gcdmultiple 11708 | The GCD of a multiple of a number is the number itself. (Contributed by Scott Fenton, 12-Apr-2014.) (Revised by Mario Carneiro, 19-Apr-2014.) |
Theorem | gcdmultiplez 11709 | Extend gcdmultiple 11708 so can be an integer. (Contributed by Scott Fenton, 18-Apr-2014.) (Revised by Mario Carneiro, 19-Apr-2014.) |
Theorem | gcdzeq 11710 | A positive integer is equal to its gcd with an integer if and only if divides . Generalization of gcdeq 11711. (Contributed by AV, 1-Jul-2020.) |
Theorem | gcdeq 11711 | is equal to its gcd with if and only if divides . (Contributed by Mario Carneiro, 23-Feb-2014.) (Proof shortened by AV, 8-Aug-2021.) |
Theorem | dvdssqim 11712 | Unidirectional form of dvdssq 11719. (Contributed by Scott Fenton, 19-Apr-2014.) |
Theorem | dvdsmulgcd 11713 | Relationship between the order of an element and that of a multiple. (a divisibility equivalent). (Contributed by Stefan O'Rear, 6-Sep-2015.) |
Theorem | rpmulgcd 11714 | If and are relatively prime, then the GCD of and is the GCD of and . (Contributed by Scott Fenton, 12-Apr-2014.) (Revised by Mario Carneiro, 19-Apr-2014.) |
Theorem | rplpwr 11715 | If and are relatively prime, then so are and . (Contributed by Scott Fenton, 12-Apr-2014.) (Revised by Mario Carneiro, 19-Apr-2014.) |
Theorem | rppwr 11716 | If and are relatively prime, then so are and . (Contributed by Scott Fenton, 12-Apr-2014.) (Revised by Mario Carneiro, 19-Apr-2014.) |
Theorem | sqgcd 11717 | Square distributes over GCD. (Contributed by Scott Fenton, 18-Apr-2014.) (Revised by Mario Carneiro, 19-Apr-2014.) |
Theorem | dvdssqlem 11718 | Lemma for dvdssq 11719. (Contributed by Scott Fenton, 18-Apr-2014.) (Revised by Mario Carneiro, 19-Apr-2014.) |
Theorem | dvdssq 11719 | Two numbers are divisible iff their squares are. (Contributed by Scott Fenton, 18-Apr-2014.) (Revised by Mario Carneiro, 19-Apr-2014.) |
Theorem | bezoutr 11720 | Partial converse to bezout 11699. Existence of a linear combination does not set the GCD, but it does upper bound it. (Contributed by Stefan O'Rear, 23-Sep-2014.) |
Theorem | bezoutr1 11721 | Converse of bezout 11699 for when the greater common divisor is one (sufficient condition for relative primality). (Contributed by Stefan O'Rear, 23-Sep-2014.) |
Theorem | nn0seqcvgd 11722* | A strictly-decreasing nonnegative integer sequence with initial term reaches zero by the th term. Deduction version. (Contributed by Paul Chapman, 31-Mar-2011.) |
Theorem | ialgrlem1st 11723 | Lemma for ialgr0 11725. Expressing algrflemg 6127 in a form suitable for theorems such as seq3-1 10233 or seqf 10234. (Contributed by Jim Kingdon, 22-Jul-2021.) |
Theorem | ialgrlemconst 11724 | Lemma for ialgr0 11725. Closure of a constant function, in a form suitable for theorems such as seq3-1 10233 or seqf 10234. (Contributed by Jim Kingdon, 22-Jul-2021.) |
Theorem | ialgr0 11725 | The value of the algorithm iterator at is the initial state . (Contributed by Paul Chapman, 31-Mar-2011.) (Revised by Jim Kingdon, 12-Mar-2023.) |
Theorem | algrf 11726 |
An algorithm is a step function on a state space .
An algorithm acts on an initial state by
iteratively applying
to give , , and so
on. An algorithm is said to halt if a fixed point of is reached
after a finite number of iterations.
The algorithm iterator "runs" the algorithm so that is the state after iterations of on the initial state . Domain and codomain of the algorithm iterator . (Contributed by Paul Chapman, 31-Mar-2011.) (Revised by Mario Carneiro, 28-May-2014.) |
Theorem | algrp1 11727 | The value of the algorithm iterator at . (Contributed by Paul Chapman, 31-Mar-2011.) (Revised by Jim Kingdon, 12-Mar-2023.) |
Theorem | alginv 11728* | If is an invariant of , then its value is unchanged after any number of iterations of . (Contributed by Paul Chapman, 31-Mar-2011.) |
Theorem | algcvg 11729* |
One way to prove that an algorithm halts is to construct a countdown
function whose value is guaranteed to decrease for
each iteration of until it reaches . That is, if
is not a fixed point of , then
.
If is a countdown function for algorithm , the sequence reaches after at most steps, where is the value of for the initial state . (Contributed by Paul Chapman, 22-Jun-2011.) |
Theorem | algcvgblem 11730 | Lemma for algcvgb 11731. (Contributed by Paul Chapman, 31-Mar-2011.) |
Theorem | algcvgb 11731 | Two ways of expressing that is a countdown function for algorithm . The first is used in these theorems. The second states the condition more intuitively as a conjunction: if the countdown function's value is currently nonzero, it must decrease at the next step; if it has reached zero, it must remain zero at the next step. (Contributed by Paul Chapman, 31-Mar-2011.) |
Theorem | algcvga 11732* | The countdown function remains after steps. (Contributed by Paul Chapman, 22-Jun-2011.) |
Theorem | algfx 11733* | If reaches a fixed point when the countdown function reaches , remains fixed after steps. (Contributed by Paul Chapman, 22-Jun-2011.) |
Theorem | eucalgval2 11734* | The value of the step function for Euclid's Algorithm on an ordered pair. (Contributed by Paul Chapman, 31-Mar-2011.) (Revised by Mario Carneiro, 28-May-2014.) |
Theorem | eucalgval 11735* |
Euclid's Algorithm eucalg 11740 computes the greatest common divisor of two
nonnegative integers by repeatedly replacing the larger of them with its
remainder modulo the smaller until the remainder is 0.
The value of the step function for Euclid's Algorithm. (Contributed by Paul Chapman, 31-Mar-2011.) (Revised by Mario Carneiro, 28-May-2014.) |
Theorem | eucalgf 11736* | Domain and codomain of the step function for Euclid's Algorithm. (Contributed by Paul Chapman, 31-Mar-2011.) (Revised by Mario Carneiro, 28-May-2014.) |
Theorem | eucalginv 11737* | The invariant of the step function for Euclid's Algorithm is the operator applied to the state. (Contributed by Paul Chapman, 31-Mar-2011.) (Revised by Mario Carneiro, 29-May-2014.) |
Theorem | eucalglt 11738* | The second member of the state decreases with each iteration of the step function for Euclid's Algorithm. (Contributed by Paul Chapman, 31-Mar-2011.) (Revised by Mario Carneiro, 29-May-2014.) |
Theorem | eucalgcvga 11739* | Once Euclid's Algorithm halts after steps, the second element of the state remains 0 . (Contributed by Paul Chapman, 22-Jun-2011.) (Revised by Mario Carneiro, 29-May-2014.) |
Theorem | eucalg 11740* |
Euclid's Algorithm computes the greatest common divisor of two
nonnegative integers by repeatedly replacing the larger of them with its
remainder modulo the smaller until the remainder is 0. Theorem 1.15 in
[ApostolNT] p. 20.
Upon halting, the 1st member of the final state is equal to the gcd of the values comprising the input state . This is Metamath 100 proof #69 (greatest common divisor algorithm). (Contributed by Paul Chapman, 31-Mar-2011.) (Proof shortened by Mario Carneiro, 29-May-2014.) |
According to Wikipedia ("Least common multiple", 27-Aug-2020, https://en.wikipedia.org/wiki/Least_common_multiple): "In arithmetic and number theory, the least common multiple, lowest common multiple, or smallest common multiple of two integers a and b, usually denoted by lcm(a, b), is the smallest positive integer that is divisible by both a and b. Since division of integers by zero is undefined, this definition has meaning only if a and b are both different from zero. However, some authors define lcm(a,0) as 0 for all a, which is the result of taking the lcm to be the least upper bound in the lattice of divisibility." In this section, an operation calculating the least common multiple of two integers (df-lcm 11742). The definition is valid for all integers, including negative integers and 0, obeying the above mentioned convention. | ||
Syntax | clcm 11741 | Extend the definition of a class to include the least common multiple operator. |
lcm | ||
Definition | df-lcm 11742* | Define the lcm operator. For example, lcm . (Contributed by Steve Rodriguez, 20-Jan-2020.) (Revised by AV, 16-Sep-2020.) |
lcm inf | ||
Theorem | lcmmndc 11743 | Decidablity lemma used in various proofs related to lcm. (Contributed by Jim Kingdon, 21-Jan-2022.) |
DECID | ||
Theorem | lcmval 11744* | Value of the lcm operator. lcm is the least common multiple of and . If either or is , the result is defined conventionally as . Contrast with df-gcd 11636 and gcdval 11648. (Contributed by Steve Rodriguez, 20-Jan-2020.) (Revised by AV, 16-Sep-2020.) |
lcm inf | ||
Theorem | lcmcom 11745 | The lcm operator is commutative. (Contributed by Steve Rodriguez, 20-Jan-2020.) (Proof shortened by AV, 16-Sep-2020.) |
lcm lcm | ||
Theorem | lcm0val 11746 | The value, by convention, of the lcm operator when either operand is 0. (Use lcmcom 11745 for a left-hand 0.) (Contributed by Steve Rodriguez, 20-Jan-2020.) (Proof shortened by AV, 16-Sep-2020.) |
lcm | ||
Theorem | lcmn0val 11747* | The value of the lcm operator when both operands are nonzero. (Contributed by Steve Rodriguez, 20-Jan-2020.) (Revised by AV, 16-Sep-2020.) |
lcm inf | ||
Theorem | lcmcllem 11748* | Lemma for lcmn0cl 11749 and dvdslcm 11750. (Contributed by Steve Rodriguez, 20-Jan-2020.) (Proof shortened by AV, 16-Sep-2020.) |
lcm | ||
Theorem | lcmn0cl 11749 | Closure of the lcm operator. (Contributed by Steve Rodriguez, 20-Jan-2020.) |
lcm | ||
Theorem | dvdslcm 11750 | The lcm of two integers is divisible by each of them. (Contributed by Steve Rodriguez, 20-Jan-2020.) |
lcm lcm | ||
Theorem | lcmledvds 11751 | A positive integer which both operands of the lcm operator divide bounds it. (Contributed by Steve Rodriguez, 20-Jan-2020.) (Proof shortened by AV, 16-Sep-2020.) |
lcm | ||
Theorem | lcmeq0 11752 | The lcm of two integers is zero iff either is zero. (Contributed by Steve Rodriguez, 20-Jan-2020.) |
lcm | ||
Theorem | lcmcl 11753 | Closure of the lcm operator. (Contributed by Steve Rodriguez, 20-Jan-2020.) |
lcm | ||
Theorem | gcddvdslcm 11754 | The greatest common divisor of two numbers divides their least common multiple. (Contributed by Steve Rodriguez, 20-Jan-2020.) |
lcm | ||
Theorem | lcmneg 11755 | Negating one operand of the lcm operator does not alter the result. (Contributed by Steve Rodriguez, 20-Jan-2020.) |
lcm lcm | ||
Theorem | neglcm 11756 | Negating one operand of the lcm operator does not alter the result. (Contributed by Steve Rodriguez, 20-Jan-2020.) |
lcm lcm | ||
Theorem | lcmabs 11757 | The lcm of two integers is the same as that of their absolute values. (Contributed by Steve Rodriguez, 20-Jan-2020.) |
lcm lcm | ||
Theorem | lcmgcdlem 11758 | Lemma for lcmgcd 11759 and lcmdvds 11760. Prove them for positive , , and . (Contributed by Steve Rodriguez, 20-Jan-2020.) (Proof shortened by AV, 16-Sep-2020.) |
lcm lcm | ||
Theorem | lcmgcd 11759 |
The product of two numbers' least common multiple and greatest common
divisor is the absolute value of the product of the two numbers. In
particular, that absolute value is the least common multiple of two
coprime numbers, for which .
Multiple methods exist for proving this, and it is often proven either as a consequence of the fundamental theorem of arithmetic or of Bézout's identity bezout 11699; see e.g. https://proofwiki.org/wiki/Product_of_GCD_and_LCM 11699 and https://math.stackexchange.com/a/470827 11699. This proof uses the latter to first confirm it for positive integers and (the "Second Proof" in the above Stack Exchange page), then shows that implies it for all nonzero integer inputs, then finally uses lcm0val 11746 to show it applies when either or both inputs are zero. (Contributed by Steve Rodriguez, 20-Jan-2020.) |
lcm | ||
Theorem | lcmdvds 11760 | The lcm of two integers divides any integer the two divide. (Contributed by Steve Rodriguez, 20-Jan-2020.) |
lcm | ||
Theorem | lcmid 11761 | The lcm of an integer and itself is its absolute value. (Contributed by Steve Rodriguez, 20-Jan-2020.) |
lcm | ||
Theorem | lcm1 11762 | The lcm of an integer and 1 is the absolute value of the integer. (Contributed by AV, 23-Aug-2020.) |
lcm | ||
Theorem | lcmgcdnn 11763 | The product of two positive integers' least common multiple and greatest common divisor is the product of the two integers. (Contributed by AV, 27-Aug-2020.) |
lcm | ||
Theorem | lcmgcdeq 11764 | Two integers' absolute values are equal iff their least common multiple and greatest common divisor are equal. (Contributed by Steve Rodriguez, 20-Jan-2020.) |
lcm | ||
Theorem | lcmdvdsb 11765 | Biconditional form of lcmdvds 11760. (Contributed by Steve Rodriguez, 20-Jan-2020.) |
lcm | ||
Theorem | lcmass 11766 | Associative law for lcm operator. (Contributed by Steve Rodriguez, 20-Jan-2020.) (Proof shortened by AV, 16-Sep-2020.) |
lcm lcm lcm lcm | ||
Theorem | 3lcm2e6woprm 11767 | The least common multiple of three and two is six. This proof does not use the property of 2 and 3 being prime. (Contributed by Steve Rodriguez, 20-Jan-2020.) (Revised by AV, 27-Aug-2020.) |
lcm | ||
Theorem | 6lcm4e12 11768 | The least common multiple of six and four is twelve. (Contributed by AV, 27-Aug-2020.) |
lcm ; | ||
According to Wikipedia "Coprime integers", see https://en.wikipedia.org/wiki/Coprime_integers (16-Aug-2020) "[...] two integers a and b are said to be relatively prime, mutually prime, or coprime [...] if the only positive integer (factor) that divides both of them is 1. Consequently, any prime number that divides one does not divide the other. This is equivalent to their greatest common divisor (gcd) being 1.". In the following, we use this equivalent characterization to say that and are coprime (or relatively prime) if . The equivalence of the definitions is shown by coprmgcdb 11769. The negation, i.e. two integers are not coprime, can be expressed either by , see ncoprmgcdne1b 11770, or equivalently by , see ncoprmgcdgt1b 11771. A proof of Euclid's lemma based on coprimality is provided in coprmdvds 11773 (as opposed to Euclid's lemma for primes). | ||
Theorem | coprmgcdb 11769* | Two positive integers are coprime, i.e. the only positive integer that divides both of them is 1, iff their greatest common divisor is 1. (Contributed by AV, 9-Aug-2020.) |
Theorem | ncoprmgcdne1b 11770* | Two positive integers are not coprime, i.e. there is an integer greater than 1 which divides both integers, iff their greatest common divisor is not 1. (Contributed by AV, 9-Aug-2020.) |
Theorem | ncoprmgcdgt1b 11771* | Two positive integers are not coprime, i.e. there is an integer greater than 1 which divides both integers, iff their greatest common divisor is greater than 1. (Contributed by AV, 9-Aug-2020.) |
Theorem | coprmdvds1 11772 | If two positive integers are coprime, i.e. their greatest common divisor is 1, the only positive integer that divides both of them is 1. (Contributed by AV, 4-Aug-2021.) |
Theorem | coprmdvds 11773 | Euclid's Lemma (see ProofWiki "Euclid's Lemma", 10-Jul-2021, https://proofwiki.org/wiki/Euclid's_Lemma): If an integer divides the product of two integers and is coprime to one of them, then it divides the other. See also theorem 1.5 in [ApostolNT] p. 16. (Contributed by Paul Chapman, 22-Jun-2011.) (Proof shortened by AV, 10-Jul-2021.) |
Theorem | coprmdvds2 11774 | If an integer is divisible by two coprime integers, then it is divisible by their product. (Contributed by Mario Carneiro, 24-Feb-2014.) |
Theorem | mulgcddvds 11775 | One half of rpmulgcd2 11776, which does not need the coprimality assumption. (Contributed by Mario Carneiro, 2-Jul-2015.) |
Theorem | rpmulgcd2 11776 | If is relatively prime to , then the GCD of with is the product of the GCDs with and respectively. (Contributed by Mario Carneiro, 2-Jul-2015.) |
Theorem | qredeq 11777 | Two equal reduced fractions have the same numerator and denominator. (Contributed by Jeff Hankins, 29-Sep-2013.) |
Theorem | qredeu 11778* | Every rational number has a unique reduced form. (Contributed by Jeff Hankins, 29-Sep-2013.) |
Theorem | rpmul 11779 | If is relatively prime to and to , it is also relatively prime to their product. (Contributed by Mario Carneiro, 24-Feb-2014.) (Proof shortened by Mario Carneiro, 2-Jul-2015.) |
Theorem | rpdvds 11780 | If is relatively prime to then it is also relatively prime to any divisor of . (Contributed by Mario Carneiro, 19-Jun-2015.) |
Theorem | congr 11781* | Definition of congruence by integer multiple (see ProofWiki "Congruence (Number Theory)", 11-Jul-2021, https://proofwiki.org/wiki/Definition:Congruence_(Number_Theory)): An integer is congruent to an integer modulo if their difference is a multiple of . See also the definition in [ApostolNT] p. 104: "... is congruent to modulo , and we write (mod ) if divides the difference ", or Wikipedia "Modular arithmetic - Congruence", https://en.wikipedia.org/wiki/Modular_arithmetic#Congruence, 11-Jul-2021,: "Given an integer n > 1, called a modulus, two integers are said to be congruent modulo n, if n is a divisor of their difference (i.e., if there is an integer k such that a-b = kn)". (Contributed by AV, 11-Jul-2021.) |
Theorem | divgcdcoprm0 11782 | Integers divided by gcd are coprime. (Contributed by AV, 12-Jul-2021.) |
Theorem | divgcdcoprmex 11783* | Integers divided by gcd are coprime (see ProofWiki "Integers Divided by GCD are Coprime", 11-Jul-2021, https://proofwiki.org/wiki/Integers_Divided_by_GCD_are_Coprime): Any pair of integers, not both zero, can be reduced to a pair of coprime ones by dividing them by their gcd. (Contributed by AV, 12-Jul-2021.) |
Theorem | cncongr1 11784 | One direction of the bicondition in cncongr 11786. Theorem 5.4 in [ApostolNT] p. 109. (Contributed by AV, 13-Jul-2021.) |
Theorem | cncongr2 11785 | The other direction of the bicondition in cncongr 11786. (Contributed by AV, 11-Jul-2021.) |
Theorem | cncongr 11786 | Cancellability of Congruences (see ProofWiki "Cancellability of Congruences, https://proofwiki.org/wiki/Cancellability_of_Congruences, 10-Jul-2021): Two products with a common factor are congruent modulo a positive integer iff the other factors are congruent modulo the integer divided by the greates common divisor of the integer and the common factor. See also Theorem 5.4 "Cancellation law" in [ApostolNT] p. 109. (Contributed by AV, 13-Jul-2021.) |
Theorem | cncongrcoprm 11787 | Corollary 1 of Cancellability of Congruences: Two products with a common factor are congruent modulo an integer being coprime to the common factor iff the other factors are congruent modulo the integer. (Contributed by AV, 13-Jul-2021.) |
Remark: to represent odd prime numbers, i.e., all prime numbers except , the idiom is used. It is a little bit shorter than . Both representations can be converted into each other by eldifsn 3650. | ||
Syntax | cprime 11788 | Extend the definition of a class to include the set of prime numbers. |
Definition | df-prm 11789* | Define the set of prime numbers. (Contributed by Paul Chapman, 22-Jun-2011.) |
Theorem | isprm 11790* | The predicate "is a prime number". A prime number is a positive integer with exactly two positive divisors. (Contributed by Paul Chapman, 22-Jun-2011.) |
Theorem | prmnn 11791 | A prime number is a positive integer. (Contributed by Paul Chapman, 22-Jun-2011.) |
Theorem | prmz 11792 | A prime number is an integer. (Contributed by Paul Chapman, 22-Jun-2011.) (Proof shortened by Jonathan Yan, 16-Jul-2017.) |
Theorem | prmssnn 11793 | The prime numbers are a subset of the positive integers. (Contributed by AV, 22-Jul-2020.) |
Theorem | prmex 11794 | The set of prime numbers exists. (Contributed by AV, 22-Jul-2020.) |
Theorem | 1nprm 11795 | 1 is not a prime number. (Contributed by Paul Chapman, 22-Jun-2011.) (Proof shortened by Fan Zheng, 3-Jul-2016.) |
Theorem | 1idssfct 11796* | The positive divisors of a positive integer include 1 and itself. (Contributed by Paul Chapman, 22-Jun-2011.) |
Theorem | isprm2lem 11797* | Lemma for isprm2 11798. (Contributed by Paul Chapman, 22-Jun-2011.) |
Theorem | isprm2 11798* | The predicate "is a prime number". A prime number is an integer greater than or equal to 2 whose only positive divisors are 1 and itself. Definition in [ApostolNT] p. 16. (Contributed by Paul Chapman, 26-Oct-2012.) |
Theorem | isprm3 11799* | The predicate "is a prime number". A prime number is an integer greater than or equal to 2 with no divisors strictly between 1 and itself. (Contributed by Paul Chapman, 26-Oct-2012.) |
Theorem | isprm4 11800* | The predicate "is a prime number". A prime number is an integer greater than or equal to 2 whose only divisor greater than or equal to 2 is itself. (Contributed by Paul Chapman, 26-Oct-2012.) |
< Previous Next > |
Copyright terms: Public domain | < Previous Next > |