{"assessment":{"class":"C","importance":"high"},"audit":{"blind":true,"ended":"2026-11-03T02:10:43.537Z","figures":[{"ci95":[0.4891,0.9935],"drawn":36,"id":"primary","label":"Strong links (exact, close or broad match) on supporting passages that have exactly the right relation","n_eff":5.1,"population":1029,"share":0.9234,"weights":"relation and library"},{"ci95":[0.3979,0.9202],"drawn":48,"id":"S2","label":"Links in a counting relation (exact, close, broad, narrow match or part) on supporting passages that have exactly the right relation","n_eff":8.1,"population":1740,"share":0.734,"weights":"relation and library"},{"ci95":[0.7268,0.9357],"drawn":44,"id":"CS","label":"Central and subject passages whose formalization status is right","n_eff":42.0,"population":1905,"share":0.8615,"weights":"recorded status"},{"ci95":[0.2519,0.8658],"drawn":12,"id":"S3","label":"'Not formalized' on supporting passages that is right (no declaration in the 48 libraries states it)","n_eff":6.1,"population":1236,"share":0.5957,"weights":"article"}],"independent":false,"items":224,"models":[{"model":"claude-opus-5-5","model_name":"Claude Opus 5.5"}],"operator":"jack","run_id":"tierA-batch1-audit","started":"2026-11-02T21:10:01.351Z"},"campaign":"run:loc-tierA-b1b+chal-tierA-b1","licence":{"mapping":"CC0-1.0","text":"CC-BY-SA-4.0"},"pageid":12354,"passages":[{"absence":null,"basis":"44a3c611c131b86d0fc14b88c2b31d04b40673c7b43fc903d2fd2db545c57d3c","coverage":null,"id":"enwiki-12354-1372179102::In-text #4f39d4f6","item":"In-text #4f39d4f6","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Finset.gcd","end_line":125,"library":"mathlib","line":124,"location_key":"44a3c611c131b86d0fc14b88c2b31d04b40673c7b43fc903d2fd2db545c57d3c","module":"Mathlib.Algebra.GCDMonoid.Finset","note":"Mathlib builds the gcd of a finite indexed family over any normalized gcd monoid, and at the integers its value is the nonnegative divisor of each member that the passage names.","pair_key":"21dcac1212e4c8e8ecb45c9829da4b889f11668bf35edddb72dfe1ff04e9070b","path":"Mathlib/Algebra/GCDMonoid/Finset.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Finset.gcd {α : Type*} {β : Type*} [CommMonoidWithZero α] [NormalizedGCDMonoid α] : Finset β → (β → α) → α"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Int.gcd","end_line":43,"library":"lean-core","line":43,"location_key":"fa7729a4309f37e02c76f38c5777fc5301abade26d60c63665e5d627d4868f18","module":"Init.Data.Int.Gcd","note":"Lean's operation is binary, so it covers the passage's collections of two members only, and its docstring says the value is the largest natural number evenly dividing both arguments.","pair_key":"f9d97a8c0785fd5179e3147aac6c24ffc188a0e45b5e18bddf5365056ce53fce","path":"src/Init/Data/Int/Gcd.lean","proof_status":"definition","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"def Int.gcd : Int → Int → Nat"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"910037777949271eda18516032f7a7cb0bab7e4ec9fea94694c952c94799a5fb","prominence":"subject","quote":{"exact":"In mathematics, the greatest common divisor (GCD), also known as greatest common"},"quote_capped":true,"section":[],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"In mathematics, the greatest common divisor (GCD), also known as greatest common factor (GCF), of two or more integers, which are not all zero, is the largest positive integer that divides each of the integers.","segments":[{"text":"In mathematics, the greatest common divisor (GCD), also known as greatest common factor (GCF), of two or more integers, which are not all zero, is the largest positive integer that divides each of the integers."}]},"unresolved":null},{"absence":null,"basis":"20a3455dd1b4b5156a3411f737a1af95f0fe8d3c85c3b47dd4383b8b49eb0c9b","coverage":null,"id":"enwiki-12354-1372179102::In-text #0fef6dd4","item":"In-text #0fef6dd4","kind":"notation","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Int.gcd","end_line":43,"library":"lean-core","line":43,"location_key":"20a3455dd1b4b5156a3411f737a1af95f0fe8d3c85c3b47dd4383b8b49eb0c9b","module":"Init.Data.Int.Gcd","note":"Lean writes this operation in prefix form as Int.gcd x y, or as x.gcd y, and returns its value as a natural number.","pair_key":"6317020fd7695932ca557f79a3ab1af68321a70cf763cf8cb998f72653848035","path":"src/Init/Data/Int/Gcd.lean","proof_status":"definition","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"def Int.gcd : Int → Int → Nat"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"c62b43a1f2482fef67180a8266481284aa9715da5fa65ed1f5063fd1f748f63d","prominence":"central","quote":{"exact":"For two integers x, y, the greatest common divisor of x and"},"quote_capped":true,"section":[],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"For two integers x, y, the greatest common divisor of x and y is denoted gcd ( x , y ) {\\displaystyle \\gcd(x,y)} .","segments":[{"text":"For two integers x, y, the greatest common divisor of x and y is denoted "},{"tex":"\\gcd(x,y)"},{"text":" ."}]},"unresolved":null},{"absence":null,"basis":"5e08665fddda03d2b2925b12541df8b4e97c8a003b50f8eb29d12640668231c6","coverage":null,"id":"enwiki-12354-1372179102::In-text #11380da9","item":"In-text #11380da9","kind":"example","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"Int.gcd","end_line":43,"library":"lean-core","line":43,"location_key":"5e08665fddda03d2b2925b12541df8b4e97c8a003b50f8eb29d12640668231c6","module":"Init.Data.Int.Gcd","note":"Evaluating this operation at the passage's two numbers yields its asserted value, and its docstring lists several such evaluations.","pair_key":"6781405281969aa2ed2d6dac93385f84ce3baecfd99bef7a797a070b72550542","path":"src/Init/Data/Int/Gcd.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"def Int.gcd : Int → Int → Nat"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"Nat.gcd_mul_left","end_line":142,"library":"lean-core","line":139,"location_key":"9684cb2654758d07c50d8a14b3d4fa793c5d98cd7d8c06360a270102caac756d","module":"Init.Data.Nat.Gcd","note":"This is the general law of pulling a shared factor out of a gcd, of which the passage's computation is one instance.","pair_key":"1ab4ad29e368c0215d11fa3062d5a0fedeeb09394874d99f44fecd686c51c049","path":"src/Init/Data/Nat/Gcd.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Nat.gcd_mul_left (m n k : Nat) : (m * n).gcd (m * k) = m * n.gcd k"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"2aa70248d15768c654b78ad2ad8eaf91729e84d63597294da08e57f24f56ba90","prominence":"supporting","quote":{"exact":"For example, the GCD of 8 and 12 is 4, that is,"},"quote_capped":true,"section":[],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"For example, the GCD of 8 and 12 is 4, that is, gcd(8, 12) = 4.","segments":[{"text":"For example, the GCD of 8 and 12 is 4, that is, gcd(8, 12) = 4."}]},"unresolved":null},{"absence":null,"basis":"6ec5da3977f100b6dea07556bd0c6eeaf757678412c53f5fc6b9baf9f775e98d","coverage":null,"id":"enwiki-12354-1372179102::In-text #1a4bf16b","item":"In-text #1a4bf16b","kind":"definition","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Int.gcd","end_line":43,"library":"lean-core","line":43,"location_key":"6ec5da3977f100b6dea07556bd0c6eeaf757678412c53f5fc6b9baf9f775e98d","module":"Init.Data.Int.Gcd","note":"Lean delivers the divisor as a natural number rather than as a positive integer, and its docstring states that it is the largest number evenly dividing both arguments.","pair_key":"c9f4aa1dff7d208983bf511f405cd47a567cadfe10c1686e1dca1262184fb63a","path":"src/Init/Data/Int/Gcd.lean","proof_status":"definition","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"def Int.gcd : Int → Int → Nat"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Int.gcd_greatest","end_line":226,"library":"mathlib","line":223,"location_key":"ac7460badb26f0fdc4facd6c53fef4d39c6855cb89666afd019ddd1a910ea08c","module":"Mathlib.Data.Int.GCD","note":"It pins the gcd down by being greatest for divisibility, where the passage asks for the numerically largest common divisor; passing between the two readings needs a further result.","pair_key":"dbcd673f8d66e72512dcb7e57de201888b823e124f472a0aef4dd9ebaee4acf7","path":"Mathlib/Data/Int/GCD.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Int.gcd_greatest {a b d : ℤ} : 0 ≤ d → d ∣ a → d ∣ b → (∀ (e : ℤ), e ∣ a → e ∣ b → e ∣ d) → d = ↑(a.gcd b)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"9021328c7cef02328e77f5f07f88c284d89ee89c959108000824bd7300ce644e","prominence":"central","quote":{"exact":"The greatest common divisor (GCD) of integers a and b, at least"},"quote_capped":true,"section":["Overview","Definition"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"The greatest common divisor (GCD) of integers a and b, at least one of which is nonzero, is the greatest positive integer d such that d is a divisor of both a and b; that is, there are integers e and f such that a = de and b = df, and d is the largest such integer.","segments":[{"text":"The greatest common divisor (GCD) of integers a and b, at least one of which is nonzero, is the greatest positive integer d such that d is a divisor of both a and b; that is, there are integers e and f such that a = de and b = df, and d is the largest such integer."}]},"unresolved":null},{"absence":null,"basis":"525ff86a2c077300c70da2e9b9772f125d8fa9132f442282bb841da9028173cf","coverage":null,"id":"enwiki-12354-1372179102::In-text #01195933","item":"In-text #01195933","kind":"notation","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Int.gcd","end_line":43,"library":"lean-core","line":43,"location_key":"525ff86a2c077300c70da2e9b9772f125d8fa9132f442282bb841da9028173cf","module":"Init.Data.Int.Gcd","note":"Lean names the operation Int.gcd and applies it in prefix form to a and b, returning a natural number.","pair_key":"d7cf703f704e7e6f9c3321c29d464f8a7990578108d27b0c8f8ac1e09da22284","path":"src/Init/Data/Int/Gcd.lean","proof_status":"definition","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"def Int.gcd : Int → Int → Nat"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"b36949d706369b9c8a94029d333b60e7aa4f93299328a1333b25c69d9cb51a7e","prominence":"supporting","quote":{"exact":"The GCD of a and b is generally denoted gcd(a, b)."},"quote_capped":false,"section":["Overview","Definition"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"The GCD of a and b is generally denoted gcd(a, b).","segments":[{"text":"The GCD of a and b is generally denoted gcd(a, b)."}]},"unresolved":null},{"absence":null,"basis":"e64de8c4853ed3aeb18c0dbbf48eb1859198cc826e8d32ff8229569e005ca488","coverage":null,"id":"enwiki-12354-1372179102::In-text #564dec3e","item":"In-text #564dec3e","kind":"theorem","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Int.gcd_zero_right","end_line":65,"library":"lean-core","line":65,"location_key":"e64de8c4853ed3aeb18c0dbbf48eb1859198cc826e8d32ff8229569e005ca488","module":"Init.Data.Int.Gcd","note":"Lean writes the absolute value as the natural number a.natAbs, and the lemma includes the argument zero, where it reads as zero equals zero.","pair_key":"43f7665f56236e2e875217f501e2e9b2a8f31875b623bec5d90970f781c08353","path":"src/Init/Data/Int/Gcd.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Int.gcd_zero_right (a : Int) : a.gcd 0 = a.natAbs"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Int.gcd_zero_left","end_line":64,"library":"lean-core","line":64,"location_key":"1c1158d80c4d44693a22a9f038135b8e185cce0288111ab7a82088446e5417b6","module":"Init.Data.Int.Gcd","note":"The same equation with the zero in the first position, the value again written as the natural number a.natAbs.","pair_key":"01c4810df573df5bee22964e6c566acbf3bf1d4d698bcc1da46ad62c5aa33e3b","path":"src/Init/Data/Int/Gcd.lean","proof_status":"proved","rank":2,"relation":"closeMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Int.gcd_zero_left (a : Int) : Int.gcd 0 a = a.natAbs"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"1ef23261be340c68a70924ceb90b4fdfc8582b16643a70c9a07c38fc07b9e30b","prominence":"central","quote":{"exact":"When one of a and b is zero, the GCD is the"},"quote_capped":true,"section":["Overview","Definition"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"When one of a and b is zero, the GCD is the absolute value of the nonzero integer: gcd(a, 0) = gcd(0, a) = |a|.","segments":[{"text":"When one of a and b is zero, the GCD is the absolute value of the nonzero integer: gcd(a, 0) = gcd(0, a) = |a|."}]},"unresolved":null},{"absence":null,"basis":"4b268ac4d87bd9ddc9193fb6d8559faacfecb5964a3797fd315e8927dd1efd2b","coverage":null,"id":"enwiki-12354-1372179102::In-text #af230ecd","item":"In-text #af230ecd","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Int.lt_succ_self","end_line":65,"library":"mathlib","line":65,"location_key":"4b268ac4d87bd9ddc9193fb6d8559faacfecb5964a3797fd315e8927dd1efd2b","module":"Mathlib.Data.Int.Init","note":"Mathlib's lemma puts each integer strictly below its successor, and the passage's side condition is met by every integer, so the integers it picks out have no greatest member.","pair_key":"1ec52d6b62ce6b32b0e25dc11434aa2200d2b0e1c812ece55b2ac1f958145248","path":"Mathlib/Data/Int/Init.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Int.lt_succ_self (a : ℤ) : a < a.succ"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"low","declaration":"Nat.instNoMaxOrder","end_line":33,"library":"mathlib","line":32,"location_key":"786e9d4c87cdda170084cd669529aed295c06ac377f536900a9f6f0de43f8c68","module":"Mathlib.Order.Nat","note":"The statement is about the naturals rather than about all integers, so it carries the passage's claim only for nonnegative candidates.","pair_key":"91f87ba3247f78038b0b269ac471517ddaf120c2a6fea0b21d54d8f3f3e26f9c","path":"Mathlib/Order/Nat.lean","proof_status":"proved","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance Nat.instNoMaxOrder : NoMaxOrder ℕ"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"1d3aa21780d57538a42481baab8ef197bacf7e3b6f413fb8e671ead9f1f8d408","prominence":"supporting","quote":{"exact":"there is no greatest integer n such that 0 × n ="},"quote_capped":true,"section":["Overview","Definition"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"before":{"layer":"The above definition is unsuitable for defining gcd(0, 0), since ","segments":[{"text":"The above definition is unsuitable for defining gcd(0, 0), since "}]},"layer":"there is no greatest integer n such that 0 × n = 0.","segments":[{"text":"there is no greatest integer n such that 0 × n = 0."}]},"unresolved":null},{"absence":null,"basis":"70e5c6abba789f3afda14a0d400f140eca5ab097b8342c0b31ad1766dae0d17d","coverage":null,"id":"enwiki-12354-1372179102::In-text #8f3510dd","item":"In-text #8f3510dd","kind":"theorem","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"Int.dvd_zero","end_line":31,"library":"lean-core","line":31,"location_key":"70e5c6abba789f3afda14a0d400f140eca5ab097b8342c0b31ad1766dae0d17d","module":"Init.Data.Int.DivMod.Bootstrap","note":"Lean states that every integer divides zero, so comparing the divisors of zero by divisibility puts zero on top.","pair_key":"f63eb89b02cebed82b484ed3d20ce2f0222cabb4fd16605377f5524f8ed1c22f","path":"src/Init/Data/Int/DivMod/Bootstrap.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Int.dvd_zero (n : Int) : n ∣ 0"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"dvd_zero","end_line":44,"library":"mathlib","line":43,"location_key":"74f03388ab72964df1da61b8f72dc63c88d03cd1ff8895ed506dfb7355d1fe62","module":"Mathlib.Algebra.GroupWithZero.Divisibility","note":"The same fact stated for any semigroup with zero, which covers the passage's integers.","pair_key":"7fd4ca409bb504319dacbe188a65b7dc318dd8a97d0606cb3102be6d72b3a663","path":"Mathlib/Algebra/GroupWithZero/Divisibility.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem dvd_zero {α : Type*} [SemigroupWithZero α] (a : α) : a ∣ 0"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"e3d6e4cf6e321347748ea118fe159e21e385c5012d2d364fbf584ab1e94e5b1b","prominence":"supporting","quote":{"exact":"However, zero is its own greatest divisor if greatest is understood in"},"quote_capped":true,"section":["Overview","Definition"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"after":{"layer":", so gcd(0, 0) is commonly defined as 0.","segments":[{"text":", so gcd(0, 0) is commonly defined as 0."}]},"layer":"However, zero is its own greatest divisor if greatest is understood in the context of the divisibility relation","segments":[{"text":"However, zero is its own greatest divisor if greatest is understood in the context of the divisibility relation"}]},"unresolved":null},{"absence":null,"basis":"abf72ea028cbf312175ff433d7c966a9853ac7029de3d61aca4d1f6d647d9bee","coverage":null,"id":"enwiki-12354-1372179102::In-text #fd24989d","item":"In-text #fd24989d","kind":"definition","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Int.gcd_zero_left","end_line":64,"library":"lean-core","line":64,"location_key":"abf72ea028cbf312175ff433d7c966a9853ac7029de3d61aca4d1f6d647d9bee","module":"Init.Data.Int.Gcd","note":"Lean's Int.gcd delivers a natural number, and this equation fixes its value at the pair of zeros to be zero, which is the convention recorded here.","pair_key":"6533cdf799bf3fc4c196a3be031f2a2a02e6a0799659cdafc12b43bd7262a868","path":"src/Init/Data/Int/Gcd.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Int.gcd_zero_left (a : Int) : Int.gcd 0 a = a.natAbs"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Int.gcd_eq_zero_iff","end_line":336,"library":"lean-core","line":335,"location_key":"0624e50e181204a578147e872212f8a4ac2d656f3446e87d98d56b61b30b8508","module":"Init.Data.Int.Gcd","note":"The same equivalence settles when the gcd vanishes for any pair of integers, and the case this records is the pair of zeros.","pair_key":"c455653e75671aab0dd7676c4660ac0228d0ae74fff5a9adf08df6d1fd3f2c5a","path":"src/Init/Data/Int/Gcd.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Int.gcd_eq_zero_iff {a b : Int} : a.gcd b = 0 ↔ a = 0 ∧ b = 0"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"9e92c56e2b975cbc98e14a55b5dbd3271bd4bc4e83abc2501971bcbe850edda5","prominence":"central","quote":{"exact":"gcd(0, 0) is commonly defined as 0."},"quote_capped":false,"section":["Overview","Definition"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"before":{"layer":"However, zero is its own greatest divisor if greatest is understood in the context of the divisibility relation, so ","segments":[{"text":"However, zero is its own greatest divisor if greatest is understood in the context of the divisibility relation, so "}]},"layer":"gcd(0, 0) is commonly defined as 0.","segments":[{"text":"gcd(0, 0) is commonly defined as 0."}]},"unresolved":null},{"absence":null,"basis":"9ee017f25c8a73c03ffa63a59f72d8b492cd2a5d0749cfe7b764a2e1c62cba47","coverage":null,"id":"enwiki-12354-1372179102::In-text #7846af7e","item":"In-text #7846af7e","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"span_gcd","end_line":467,"library":"mathlib","line":466,"location_key":"9ee017f25c8a73c03ffa63a59f72d8b492cd2a5d0749cfe7b764a2e1c62cba47","module":"Mathlib.RingTheory.PrincipalIdealDomain","note":"It is stated for any Bézout domain carrying a gcd; at the integers that gcd is the article's, and the equality holds for every pair, the pair of zeros included.","pair_key":"ca8d46c4b7e08522016c45388ed0fba603c45106c0c2b484adace2266c959c79","path":"Mathlib/RingTheory/PrincipalIdealDomain.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem span_gcd {R : Type u} [CommRing R] [IsBezout R] [IsDomain R] [GCDMonoid R] (x y : R) : Ideal.span {GCDMonoid.gcd x y} = Ideal.span {x, y}"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"EuclideanDomain.span_gcd","end_line":85,"library":"mathlib","line":82,"location_key":"4d535f5cdf64d9576e563c05af9b7879cee33f4a77aea67a81c7918fe3d7d50f","module":"Mathlib.RingTheory.EuclideanDomain","note":"Its gcd is the one the Euclidean algorithm returns, which on ℤ may differ in sign from the article's and generates the same ideal, so the equality asserted is the article's.","pair_key":"dc6014f19f179029d3e35a0b9dfca1bd9d29a9f5d312827de8cc8a089694d9b1","path":"Mathlib/RingTheory/EuclideanDomain.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem EuclideanDomain.span_gcd {α : Type*} [EuclideanDomain α] [DecidableEq α] (x y : α) : Ideal.span {EuclideanDomain.gcd x y} = Ideal.span {x, y}"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"gcd_dvd_iff_exists","end_line":471,"library":"mathlib","line":469,"location_key":"f268016eaa0a0ade195d36a52acffb9782d3fb94d2f5ab8f662725dff7e55d0c","module":"Mathlib.RingTheory.PrincipalIdealDomain","note":"It writes the ideal identity element by element: an integer is a multiple of the gcd exactly when it is a combination of the two, which is what the two ideals being equal means.","pair_key":"698b6e142d79722bd5abcde8db6431f7c413285ef30690717062fa22bedb88d6","path":"Mathlib/RingTheory/PrincipalIdealDomain.lean","proof_status":"proved","rank":3,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem gcd_dvd_iff_exists {R : Type u} [CommRing R] [IsBezout R] [IsDomain R] [GCDMonoid R] (a b : R) {z : R} : GCDMonoid.gcd a b ∣ z ↔ ∃ x y, z = a * x + b * y"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"ea95bb1050692a157b456c75b10e0c6271f36ad5f3047dc6b660b0a90c1bbef2","prominence":"supporting","quote":{"exact":"This preserves the usual identities for GCD, and in particular Bézout's identity,"},"quote_capped":true,"section":["Overview","Definition"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"This preserves the usual identities for GCD, and in particular Bézout's identity, namely that gcd(a, b) generates the same ideal as {a, b}.[9][10][11]","segments":[{"text":"This preserves the usual identities for GCD, and in particular Bézout's identity, namely that gcd(a, b) generates the same ideal as {a, b}."},{"ref":"[9][10][11]"}]},"unresolved":null},{"absence":null,"basis":"86ff8e0cca0164736fbc71e03944658659f2a70988a2521d917db7013c686cd1","coverage":null,"id":"enwiki-12354-1372179102::In-text #9c8aeeb2","item":"In-text #9c8aeeb2","kind":"theorem","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Int.dvd_coe_gcd_iff","end_line":98,"library":"lean-core","line":96,"location_key":"86ff8e0cca0164736fbc71e03944658659f2a70988a2521d917db7013c686cd1","module":"Init.Data.Int.Gcd","note":"Lean writes being greatest for the divisibility preorder as a two-way divisibility equivalence, and Int.gcd takes values in ℕ, which carries the sign the article calls positive.","pair_key":"cce16085fceac513995e2bd9bcc35562c37d40ef9b38ecc43dd1f7f482d0b1e2","path":"src/Init/Data/Int/Gcd.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Int.dvd_coe_gcd_iff {a b c : Int} : c ∣ ↑(a.gcd b) ↔ c ∣ a ∧ c ∣ b"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"dvd_gcd_iff","end_line":387,"library":"mathlib","line":385,"location_key":"ac80be62cd44aab0949cbcb4e70469fd81ee56a85f626448f5506ed7f178734f","module":"Mathlib.Algebra.GCDMonoid.Basic","note":"It is stated for any monoid with a gcd; read at the integers it gives the article's reading of greatest in the divisibility preorder.","pair_key":"792ad6f2ebbdd03436ea0c6d83fb83528037ffbe5295beb11ec8ca7d2a6a5c14","path":"Mathlib/Algebra/GCDMonoid/Basic.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem dvd_gcd_iff {α : Type*} [CommMonoidWithZero α] [GCDMonoid α] (a b c : α) : a ∣ GCDMonoid.gcd b c ↔ a ∣ b ∧ a ∣ c"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"f9323fa075ce3d7f5572e2ddf920ec56f08631b254ae9cfe3d4eedb7c2ff321a","prominence":"central","quote":{"exact":"The GCD of a and b is their greatest positive common divisor"},"quote_capped":true,"section":["Overview","Definition"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"The GCD of a and b is their greatest positive common divisor in the preorder relation of divisibility.","segments":[{"text":"The GCD of a and b is their greatest positive common divisor in the preorder relation of divisibility."}]},"unresolved":null},{"absence":null,"basis":"387d84a69b19384780df206690b2b0f6e8b3437340e858963272ccbfa2389d7e","coverage":null,"id":"enwiki-12354-1372179102::In-text #c79bf2a3","item":"In-text #c79bf2a3","kind":"theorem","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Int.dvd_coe_gcd_iff","end_line":98,"library":"lean-core","line":96,"location_key":"387d84a69b19384780df206690b2b0f6e8b3437340e858963272ccbfa2389d7e","module":"Init.Data.Int.Gcd","note":"Int.gcd returns the gcd as a natural number and the equivalence casts it back into ℤ, so the element divided is the same nonnegative integer written gcd(a, b) here.","pair_key":"f8f8de6a5d28dd9c1c71ecd84401629d564e0003ddd57d7b6b9c73b850906662","path":"src/Init/Data/Int/Gcd.lean","proof_status":"proved","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Int.dvd_coe_gcd_iff {a b c : Int} : c ∣ ↑(a.gcd b) ↔ c ∣ a ∧ c ∣ b"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"dvd_gcd_iff","end_line":387,"library":"mathlib","line":385,"location_key":"05b7e084f48ce2ed838aada94aa47a4112c62cfda14a8fa0ff138fcb2d25c4f7","module":"Mathlib.Algebra.GCDMonoid.Basic","note":"It is stated for an arbitrary monoid carrying a gcd, and the integers are one such, which is how the article's two integers are reached.","pair_key":"0e678c6263e4b0ad05f9fd17c60fd0d2a0407d41c96dee372504ee68003853da","path":"Mathlib/Algebra/GCDMonoid/Basic.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem dvd_gcd_iff {α : Type*} [CommMonoidWithZero α] [GCDMonoid α] (a b c : α) : a ∣ GCDMonoid.gcd b c ↔ a ∣ b ∧ a ∣ c"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"Int.dvd_gcd_iff","end_line":101,"library":"lean-core","line":100,"location_key":"c3c12d729f8b0197f5b013715ba43c664312c2090523339c6327784b5c235384","module":"Init.Data.Int.Gcd","note":"The divisor here ranges over the naturals rather than over all integers, so it covers the nonnegative divisors of the pair.","pair_key":"e5b67099e09fe2d57e22f3f036a9dc2fb5198094a01fc310399535e707382503","path":"src/Init/Data/Int/Gcd.lean","proof_status":"proved","rank":3,"relation":"narrowMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Int.dvd_gcd_iff {a b : Int} {c : Nat} : c ∣ a.gcd b ↔ ↑c ∣ a ∧ ↑c ∣ b"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"a793f56183f1edc0e1c49f0ec46bcef2ce77ca7ff2ae041f87969256b114eca6","prominence":"central","quote":{"exact":"This means that the common divisors of a and b are exactly"},"quote_capped":true,"section":["Overview","Definition"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"This means that the common divisors of a and b are exactly the divisors of their GCD.","segments":[{"text":"This means that the common divisors of a and b are exactly the divisors of their GCD."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"909625ba9e2c3e69704b9d20d6887c9cdfc92d678640bfbcedcce83b253d8ad6"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-12354-1372179102::In-text #0370fd7f","item":"In-text #0370fd7f","kind":"example","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"f2f0b4aeb787373ba8788dfb13d37d736e0ed1829e7f24719e4f4062104a6878","prominence":"supporting","quote":{"exact":"The number 54 can be expressed as a product of two integers"},"quote_capped":true,"section":["Overview","Example"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"The number 54 can be expressed as a product of two integers in several different ways: 54 × 1 = 27 × 2 = 18 × 3 = 9 × 6. {\\displaystyle 54\\times 1=27\\times 2=18\\times 3=9\\times 6.}","segments":[{"text":"The number 54 can be expressed as a product of two integers in several different ways: "},{"tex":"54\\times 1=27\\times 2=18\\times 3=9\\times 6."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"aaee32f46196925115460ddeab580c9e657d3ede4245035c291199aa7b108457"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-12354-1372179102::In-text #51fcca70","item":"In-text #51fcca70","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"625c034a0a28c4a389b633840c847e7f6af9ae1e31ce0f88de4425137950f1ba","prominence":"supporting","quote":{"exact":"Thus the complete list of divisors of 54 is 1, 2, 3,"},"quote_capped":true,"section":["Overview","Example"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"Thus the complete list of divisors of 54 is 1, 2, 3, 6, 9, 18, 27, 54.","segments":[{"text":"Thus the complete list of divisors of 54 is 1, 2, 3, 6, 9, 18, 27, 54."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":1,"queries":4,"sha256":"69f8a2781c6a622b6f631e3d1675b6e73e6f65fa3197dd34299c1ad5f56cc205"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-12354-1372179102::In-text #51759e3b","item":"In-text #51759e3b","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"ae05513a171887bcc0efc26775688832f00ff764a1e2fe84940cc55f719cc1b2","prominence":"supporting","quote":{"exact":"Similarly, the divisors of 24 are 1, 2, 3, 4, 6, 8,"},"quote_capped":true,"section":["Overview","Example"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"Similarly, the divisors of 24 are 1, 2, 3, 4, 6, 8, 12, 24.","segments":[{"text":"Similarly, the divisors of 24 are 1, 2, 3, 4, 6, 8, 12, 24."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":1,"queries":4,"sha256":"8a486ba4af35c9dcf5993a94d421f923cdf6c992e0ab059adae32e06bed9c02a"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-12354-1372179102::In-text #7313956c","item":"In-text #7313956c","kind":"theorem","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"Int.dvd_coe_gcd_iff","end_line":98,"library":"lean-core","line":96,"location_key":"5357774294c965b4d76e204ebf5f103a361a53644082adbb4c5e3ddc81bc6487","module":"Init.Data.Int.Gcd","note":"It reduces dividing both numbers to dividing their gcd, which computes to six here; turning that into the four listed values still needs a bound lemma on divisors, so by PD8 it is no instantiation bridge.","pair_key":"92282214dcb500aa369e09fb6eec98e94babe12132ea7616b056d97b47d2158d","path":"src/Init/Data/Int/Gcd.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Int.dvd_coe_gcd_iff {a b c : Int} : c ∣ ↑(a.gcd b) ↔ c ∣ a ∧ c ∣ b"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"f10d3e65402d8a190efa7266022b349782124f3893b7070aecd11345b51cb49d","prominence":"supporting","quote":{"exact":"The numbers that these two lists have in common are the common"},"quote_capped":true,"section":["Overview","Example"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"The numbers that these two lists have in common are the common divisors of 54 and 24, that is, 1 , 2 , 3 , 6. {\\displaystyle 1,2,3,6.}","segments":[{"text":"The numbers that these two lists have in common are the common divisors of 54 and 24, that is, "},{"tex":"1,2,3,6."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":0,"queries":4,"sha256":"73101e0d09a5333279e2cfc0e06d7280f76aa47597a944e838d67a2f13db6798"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-12354-1372179102::In-text #c327ac99","item":"In-text #c327ac99","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Nat.gcd_greatest","end_line":37,"library":"mathlib","line":35,"location_key":"f2647ebf165a2bd490be19975452caaebdc4adaa3c128922a73ac70c95584d12","module":"Mathlib.Data.Nat.GCD.Basic","note":"It characterises the gcd of two naturals by divisibility, but reaching the passage's numbers needs the hypothesis that every common divisor of 54 and 24 divides 6, which no decidable arithmetic step discharges (PD8).","pair_key":"a03d2d77486979e856ab26d86af0f290e2b80cef81fe157117fa2c8760124e06","path":"Mathlib/Data/Nat/GCD/Basic.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.gcd_greatest {a b d : ℕ} : d ∣ a → d ∣ b → (∀ (e : ℕ), e ∣ a → e ∣ b → e ∣ d) → d = a.gcd b"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"7e1cf191d0d89b30a016663bb69a55c63b22f66c92990ae7d172aa4425947fcf","prominence":"supporting","quote":{"exact":"Of these, the greatest is 6"},"quote_capped":false,"section":["Overview","Example"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"after":{"layer":", so it is the greatest common divisor:","segments":[{"text":", so it is the greatest common divisor:"}]},"layer":"Of these, the greatest is 6","segments":[{"text":"Of these, the greatest is 6"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":0,"queries":4,"sha256":"f59284c708fcbbe5a74662a9bea44667a091e2287f21410235de436a8254a7ea"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-12354-1372179102::In-text #ac1447c6","item":"In-text #ac1447c6","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Nat.gcd_greatest","end_line":37,"library":"mathlib","line":35,"location_key":"35d5cfe78a090ab5a82fb4b77089da5b53b09a76b8b5721dc23c4ba80553579b","module":"Mathlib.Data.Nat.GCD.Basic","note":"Instantiating it at 54, 24 and 6 still leaves the quantified divisibility hypothesis over all naturals, which omega, norm_num and decide do not close, so the link needs more than instantiation.","pair_key":"97cb2bbcab3a658f8ab5df1c22b8dba37b5d6e2d6e906f4b343af1e31a19b705","path":"Mathlib/Data/Nat/GCD/Basic.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.gcd_greatest {a b d : ℕ} : d ∣ a → d ∣ b → (∀ (e : ℕ), e ∣ a → e ∣ b → e ∣ d) → d = a.gcd b"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"95657a0231970a5272f2d2847130e535fbf13e1fdd0865f403cf8b50830ab9f0","prominence":"supporting","quote":{"exact":"it is the greatest common divisor: gcd ( 54 , 24 )"},"quote_capped":true,"section":["Overview","Example"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"before":{"layer":"Of these, the greatest is 6, so ","segments":[{"text":"Of these, the greatest is 6, so "}]},"layer":"it is the greatest common divisor: gcd ( 54 , 24 ) = 6. {\\displaystyle \\gcd(54,24)=6.}","segments":[{"text":"it is the greatest common divisor: "},{"tex":"\\gcd(54,24)=6."}]},"unresolved":null},{"absence":null,"basis":"2092385a812aaa3ba2888cac7e3cd06474601771601a856301d3dcb1261d1614","coverage":null,"id":"enwiki-12354-1372179102::In-text #2d736b62","item":"In-text #2d736b62","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Int.isCoprime_iff_gcd_eq_one","end_line":44,"library":"mathlib","line":37,"location_key":"2092385a812aaa3ba2888cac7e3cd06474601771601a856301d3dcb1261d1614","module":"Mathlib.RingTheory.Coprime.Lemmas","note":"Mathlib carries coprimality of integers as IsCoprime, written with a Bezout relation, and this theorem unfolds that predicate into the passage's own condition that the gcd of the pair is one.","pair_key":"f1cfaae6a900c4f0538f54b2b825b48758ca70f6f9464863e674121620409b85","path":"Mathlib/RingTheory/Coprime/Lemmas.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Int.isCoprime_iff_gcd_eq_one {m n : ℤ} : IsCoprime m n ↔ m.gcd n = 1"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Nat.Coprime","end_line":25,"library":"lean-core","line":25,"location_key":"e8ac3f93125d13d3b1225f29a78b01ac3393d1fcbb83368aa0d16140fae43246","module":"Init.Data.Nat.Coprime","note":"This is the defined predicate itself, but it is stated for natural numbers, so it covers only the nonnegative part of the passage's integers.","pair_key":"9b5c21703a727d8ec0524d03e14378d15b97b1408707ce66b9101c1a47fe6a59","path":"src/Init/Data/Nat/Coprime.lean","proof_status":"definition","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"abbrev Nat.Coprime : Nat → Nat → Prop"},"statement":true}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"e3d835d85e4275c014ce3ee107a1ca9fa87f87e4e758afc0115db91cb06ed8bc","prominence":"central","quote":{"exact":"Two numbers are called relatively prime, or coprime, if their greatest common"},"quote_capped":true,"section":["Overview","Coprime numbers"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"Two numbers are called relatively prime, or coprime, if their greatest common divisor equals 1.[14]","segments":[{"text":"Two numbers are called relatively prime, or coprime, if their greatest common divisor equals 1."},{"ref":"[14]"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":0,"queries":4,"sha256":"7a3c7312233467198fd3b6c167dbd2b14acd86879d77099e6ef2cedccb47990f"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-12354-1372179102::In-text #ed7aef96","item":"In-text #ed7aef96","kind":"example","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"Nat.coprime_iff_gcd_eq_one","end_line":30,"library":"lean-core","line":30,"location_key":"3fb474a1bbe19596e9a7c82e72a00df1bc77c9a0028009706ebc9839a23f4182","module":"Init.Data.Nat.Coprime","note":"It gives the meaning of coprimality for an arbitrary pair of naturals and never asserts that the particular pair 9 and 28 has gcd one.","pair_key":"9554f68f92f736741ef65041e777c54287fd2c9b2a338dc6366b62a874b8e37d","path":"src/Init/Data/Nat/Coprime.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Nat.coprime_iff_gcd_eq_one {m n : Nat} : m.Coprime n ↔ m.gcd n = 1"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"49238311fafe378639c07cf715a2849b50a341964152a2512df4ed7c2afb56bd","prominence":"supporting","quote":{"exact":"For example, 9 and 28 are coprime."},"quote_capped":false,"section":["Overview","Coprime numbers"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"For example, 9 and 28 are coprime.","segments":[{"text":"For example, 9 and 28 are coprime."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":0,"queries":4,"sha256":"41a52837546838c5b82a04753e363ff7daf6665c0312744966c425c1e8dc4895"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-12354-1372179102::In-text #6537b689","item":"In-text #6537b689","kind":"example","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"cc2f58389355e98e46f22cf6214b2afa613f76363c362de96ae3ef55547b552b","prominence":"supporting","quote":{"exact":"For example, a 24-by-60 rectangular area can be divided into a grid"},"quote_capped":true,"section":["Overview","A geometric view"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"For example, a 24-by-60 rectangular area can be divided into a grid of: 1-by-1 squares, 2-by-2 squares, 3-by-3 squares, 4-by-4 squares, 6-by-6 squares or 12-by-12 squares.","segments":[{"text":"For example, a 24-by-60 rectangular area can be divided into a grid of: 1-by-1 squares, 2-by-2 squares, 3-by-3 squares, 4-by-4 squares, 6-by-6 squares or 12-by-12 squares."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":0,"queries":4,"sha256":"980f201c6a65f96605af9de3ae5575b2272b83c0414cb6d49a5273a2ae0fe670"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-12354-1372179102::In-text #ccb2c50e","item":"In-text #ccb2c50e","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Nat.gcd_greatest","end_line":37,"library":"mathlib","line":35,"location_key":"e90b5459357072a28a3efae3535322ebfb63ea50cb79ffe3860d9ab3ec9e2e13","module":"Mathlib.Data.Nat.GCD.Basic","note":"At 24, 60 and 12 it still demands that every common divisor of the two numbers divide 12, a quantified hypothesis that decidable arithmetic alone does not settle (PD8).","pair_key":"9e505a0dd9e8dfdc58e39f4421a5710333889bfa03464a378952c9ce12a9b368","path":"Mathlib/Data/Nat/GCD/Basic.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.gcd_greatest {a b d : ℕ} : d ∣ a → d ∣ b → (∀ (e : ℕ), e ∣ a → e ∣ b → e ∣ d) → d = a.gcd b"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"657a5debdeb5f3b49e0c67d22d442246f8529cb534a13f60c1aa460f529f4773","prominence":"supporting","quote":{"exact":"Therefore, 12 is the greatest common divisor of 24 and 60."},"quote_capped":false,"section":["Overview","A geometric view"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"Therefore, 12 is the greatest common divisor of 24 and 60.","segments":[{"text":"Therefore, 12 is the greatest common divisor of 24 and 60."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":0,"queries":5,"sha256":"b083aee6bd3f4b859aa801bcb2b0bf3a7793528d2ebed61a6276650fd566828a"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-12354-1372179102::In-text #dd059d88","item":"In-text #dd059d88","kind":"example","locations":[{"challenge":"sampled_out","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"Nat.div_eq_of_eq_mul_left","end_line":456,"library":"lean-core","line":455,"location_key":"d8ff4fc44125b1b291d3ce344dc25890077a666389efdd173c5cd10572d2f705","module":"Init.Data.Nat.Div.Basic","note":"It yields the exact quotients the passage cites as its reason, while the conjuncts assert how many squares lie along each edge of the rectangle, which no declaration here expresses.","pair_key":"c1b3454da07fc537dbdb68173bb13eb5adfb4e9ac80852a5950104e21d35b9f6","path":"src/Init/Data/Nat/Div/Basic.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Nat.div_eq_of_eq_mul_left {n m k : Nat} : 0 < n → m = k * n → m / n = k"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"e54a26c32696d7011858f926bf1709209f07513bc6df984111fd16863215733a","prominence":"supporting","quote":{"exact":"A 24-by-60 rectangular area can thus be divided into a grid of"},"quote_capped":true,"section":["Overview","A geometric view"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"A 24-by-60 rectangular area can thus be divided into a grid of 12-by-12 squares, with two squares along one edge (24/12 = 2) and five squares along the other (60/12 = 5).","segments":[{"text":"A 24-by-60 rectangular area can thus be divided into a grid of 12-by-12 squares, with two squares along one edge (24/12 = 2) and five squares along the other (60/12 = 5)."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":0,"queries":4,"sha256":"f674f2d3919211880abbaadb87b03b92967e6ffaed5d9c7998058ad54f8a9913"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-12354-1372179102::In-text #6120d28b","item":"In-text #6120d28b","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"3b98cb7abffe46cefca432d5019a629a4fe2863e69a6290f381f442f9ef0d0e5","prominence":"central","quote":{"exact":"More generally, an a-by-b rectangle can be covered with square tiles of"},"quote_capped":true,"section":["Overview","A geometric view"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"More generally, an a-by-b rectangle can be covered with square tiles of side length c only if c is a common divisor of a and b.","segments":[{"text":"More generally, an a-by-b rectangle can be covered with square tiles of side length c only if c is a common divisor of a and b."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":0,"queries":4,"sha256":"5ec7811d2fe1fee7044f0196c758612448b9adc54f9b51c13cec5bb2d7c6b4b5"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-12354-1372179102::In-text #bbfaae8c","item":"In-text #bbfaae8c","kind":"example","locations":[{"challenge":"sampled_out","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Nat.gcd_mul_right","end_line":145,"library":"lean-core","line":144,"location_key":"b98d944cf4a1099226df5898b451027008bab2188b5d236761b19fb641160b98","module":"Init.Data.Nat.Gcd","note":"It pulls a factor shared by both arguments out of a gcd, so reaching the value fourteen from it still needs the separate fact that three and four share no factor.","pair_key":"694a7628f841da75f55398b54a4d3037b72e34441b5bae5d0b719bc4d7161983","path":"src/Init/Data/Nat/Gcd.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Nat.gcd_mul_right (m n k : Nat) : (m * n).gcd (k * n) = m.gcd k * n"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"f13a4fc2fe48437bea2b243c2b1a9d176ab152d2bd55d985d10a65555791c22b","prominence":"supporting","quote":{"exact":"For example, gcd(42, 56) = 14, therefore"},"quote_capped":false,"section":["Applications","Reducing fractions"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"For example, gcd(42, 56) = 14, therefore","segments":[{"text":"For example, gcd(42, 56) = 14, therefore"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":0,"queries":4,"sha256":"aa660d200eafdff4367aa79f07acd0703cfb65ca9efbb6b6a319e61e14e66ece"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-12354-1372179102::In-text #3d4ff0bf","item":"In-text #3d4ff0bf","kind":"example","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"mul_div_mul_right","end_line":364,"library":"mathlib","line":363,"location_key":"49f91fac20673a1ec2f3e3c144aead9eb20136872959205cc3c397435474cd17","module":"Mathlib.Algebra.GroupWithZero.Units.Basic","note":"It cancels a nonzero factor carried by both numerator and denominator; the passage asserts an equation between two numerals, which is arithmetic evaluation rather than this identity.","pair_key":"9669339753ad50c7d09ad651a75260a08d634a15852766c2753b719b79033711","path":"Mathlib/Algebra/GroupWithZero/Units/Basic.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem mul_div_mul_right {G₀ : Type*} [GroupWithZero G₀] {c : G₀} (a b : G₀) : c ≠ 0 → a * c / (b * c) = a / b"},"statement":false},{"challenge":"sampled_out","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Nat.coprime_div_gcd_div_gcd","end_line":65,"library":"lean-core","line":63,"location_key":"58d5515437341718d5e891857cc09bd23d900359ff0f89a11748e6dec6091181","module":"Init.Data.Nat.Coprime","note":"It says that dividing two numbers by their gcd leaves them with no shared factor, which is why reduction terminates, not what these two numerals reduce to.","pair_key":"0e856e53d946d1c4fff54669c794ac5c6e21879424f907ecd20ac4beb75df390","path":"src/Init/Data/Nat/Coprime.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Nat.coprime_div_gcd_div_gcd {m n : Nat} : 0 < m.gcd n → (m / m.gcd n).Coprime (n / m.gcd n)"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"164a8dfe2a660a70aff8ae3d4e7cc1530df6b4aea4874d3fe56972e87a74ca37","prominence":"supporting","quote":{"exact":"42 56 = 3 ⋅ 14 4 ⋅ 14 = 3 4"},"quote_capped":true,"section":["Applications","Reducing fractions"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"before":{"layer":"For example, gcd(42, 56) = 14, therefore, ","lead_in":true,"segments":[{"text":"For example, gcd(42, 56) = 14, therefore, "}]},"layer":"42 56 = 3 ⋅ 14 4 ⋅ 14 = 3 4 . {\\displaystyle {\\frac {42}{56}}={\\frac {3\\cdot 14}{4\\cdot 14}}={\\frac {3}{4}}.}","segments":[{"tex":"{\\frac {42}{56}}={\\frac {3\\cdot 14}{4\\cdot 14}}={\\frac {3}{4}}."}]},"unresolved":null},{"absence":null,"basis":"091c93e2de1389ecd13f4e4350f51edb83cce52d9927045344d2b8784a587d95","coverage":null,"id":"enwiki-12354-1372179102::In-text #e48d85de","item":"In-text #e48d85de","kind":"theorem","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Int.lcm_eq_mul_div","end_line":448,"library":"lean-core","line":447,"location_key":"091c93e2de1389ecd13f4e4350f51edb83cce52d9927045344d2b8784a587d95","module":"Init.Data.Int.Gcd","note":"Lean returns both the gcd and the lcm of integers as natural numbers and writes the absolute value of the product as the product of the two natAbs factors, with division taken in the naturals, where it is exact whenever the two integers are not both zero.","pair_key":"99dee4ffe480d60bfc5a96d03768399cf92365d2212053a3a1dfec90e78c3768","path":"src/Init/Data/Int/Gcd.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Int.lcm_eq_mul_div (m n : Int) : m.lcm n = m.natAbs * n.natAbs / m.gcd n"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Nat.lcm_eq_mul_div","end_line":36,"library":"lean-core","line":36,"location_key":"e702528bbb829493b3e4c126dab9f981b56ec4e77210b6b166d270319f739af3","module":"Init.Data.Nat.Lcm","note":"Both binders are ℕ, so it reaches the passage only at nonnegative arguments, where the absolute values may be dropped.","pair_key":"14376501afadc4daa18073264fb558b3a5387944885d7685f82246562fababdc","path":"src/Init/Data/Nat/Lcm.lean","proof_status":"proved","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Nat.lcm_eq_mul_div (m n : Nat) : m.lcm n = m * n / m.gcd n"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Int.gcd_mul_lcm","end_line":451,"library":"lean-core","line":450,"location_key":"f7ca8a373e83661ecc5fe3f281b1b8d2cc54c2c42c0ad50201217ec1d1edfffa","module":"Init.Data.Int.Gcd","note":"It states the product form, that the gcd times the lcm is the product of the absolute values; turning that into the passage's quotient needs a cancellation lemma for a nonzero gcd.","pair_key":"f62bf26f3785e4aad0075401c57f0938e83ff76cac732200188c4427e64f5fc4","path":"src/Init/Data/Int/Gcd.lean","proof_status":"proved","rank":3,"relation":"relatedMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Int.gcd_mul_lcm (m n : Int) : m.gcd n * m.lcm n = m.natAbs * n.natAbs"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"69b76d1e1e0984c22e70af89b9272bf02cc0247f2217200e6bf471b749482976","prominence":"central","quote":{"exact":"The least common multiple of two integers that are not both zero"},"quote_capped":true,"section":["Applications","Least common multiple"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"The least common multiple of two integers that are not both zero can be computed from their greatest common divisor, by using the relation lcm ⁡ ( a , b ) = | a ⋅ b | gcd ⁡ ( a , b ) . {\\displaystyle \\operatorname {lcm} (a,b)={\\frac {|a\\cdot b|}{\\operatorname {gcd} (a,b)}}.}","segments":[{"text":"The least common multiple of two integers that are not both zero can be computed from their greatest common divisor, by using the relation "},{"tex":"\\operatorname {lcm} (a,b)={\\frac {|a\\cdot b|}{\\operatorname {gcd} (a,b)}}."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":0,"queries":4,"sha256":"3e7605246ef4fa8c61f99fa61e67728bf6ceab5d46f352fd53e14ada5fcd0b24"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-12354-1372179102::In-text #01fb962e","item":"In-text #01fb962e","kind":"example","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.prod_factorization_pow_eq_self","end_line":100,"library":"mathlib","line":97,"location_key":"90dabe9922482bf807509295964fefe70a24a5ed12182f1754b495e80eba687a","module":"Mathlib.Data.Nat.Factorization.Defs","note":"It says that a nonzero natural number is the product of the prime powers recorded in its own factorization, and it fixes no exponent for either of the two numbers the passage factors.","pair_key":"5e1d84354ff7743d8dc39c09fca3284e33f933ce0497d4d3b44468d0076bafcd","path":"Mathlib/Data/Nat/Factorization/Defs.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.prod_factorization_pow_eq_self {n : ℕ} : n ≠ 0 → (n.factorization.prod fun x1 x2 ↦ x1 ^ x2) = n"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"d5edce871d540dbdacbc33a3dd4bed20859816d81054e75cc54c1f2d9483c0ae","prominence":"supporting","quote":{"exact":"For example, to compute gcd(48, 180), we find the prime factorizations 48"},"quote_capped":true,"section":["Calculation","Using prime factorizations"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"after":{"layer":"; the GCD is then 2min(4,2) · 3min(1,2) · 5min(0,1) = 22 · 31 · 50 = 12 The corresponding LCM is then 2max(4,2) · 3max(1,2) · 5max(0,1) = 24 · 32 · 51 = 720.","segments":[{"text":"; the GCD is then 2min(4,2) · 3min(1,2) · 5min(0,1) = 22 · 31 · 50 = 12 The corresponding LCM is then 2max(4,2) · 3max(1,2) · 5max(0,1) = 24 · 32 · 51 = 720."}]},"layer":"For example, to compute gcd(48, 180), we find the prime factorizations 48 = 24 · 31 and 180 = 22 · 32 · 51","segments":[{"text":"For example, to compute gcd(48, 180), we find the prime factorizations 48 = 24 · 31 and 180 = 22 · 32 · 51"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":0,"queries":4,"sha256":"72725cf37333f2aba32207791d11b1cd7152238014972b07610e03dfb1c575da"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-12354-1372179102::In-text #56e25cec","item":"In-text #56e25cec","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.factorization_gcd","end_line":368,"library":"mathlib","line":355,"location_key":"e3932089543c8a53d72717606862085753abd4b737003314bceb1f2954c7504a","module":"Mathlib.Data.Nat.Factorization.Basic","note":"It states that the factorization of a gcd of two nonzero numbers is the pointwise minimum of their factorizations; getting the value twelve from it still requires computing both factorizations and their product.","pair_key":"6a31c5643a1ccbdf6efafa3b0169b0333be6292c5727d41df7cdd9293df07d32","path":"Mathlib/Data/Nat/Factorization/Basic.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.factorization_gcd {a b : ℕ} : a ≠ 0 → b ≠ 0 → (a.gcd b).factorization = a.factorization ⊓ b.factorization"},"statement":false},{"challenge":"sampled_out","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.Nat.gcd_eq_gcd_ordCompl_mul_pow_min","end_line":71,"library":"tauceti","line":62,"location_key":"ed2af1893baf45022c194747e5182514201c231d140f01c91760780cc5957580","module":"TauCeti.Data.Nat.Factorization.GcdSplit","note":"It splits off one prime at a time, giving the gcd as a gcd of prime complements times that prime to the minimum exponent, and it never reaches a numerical value.","pair_key":"23b1e59a3de078c59638ecd7ff633ff28c94c34f4b0c67511e5f8d355bf92c33","path":"TauCeti/Data/Nat/Factorization/GcdSplit.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem TauCeti.Nat.gcd_eq_gcd_ordCompl_mul_pow_min {p m n : ℕ} : Nat.Prime p → m ≠ 0 → n ≠ 0 → m.gcd n = (m / p ^ m.factorization p).gcd (n / p ^ n.factorization p) * p ^ Min.min (m.factorization p) (n.factorization p)"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"ca6ebd26cfee3eacaae138ba6a24cd0b47bf8cd41cb2c610d49135414539aa2a","prominence":"supporting","quote":{"exact":"the GCD is then 2min(4,2) · 3min(1,2) · 5min(0,1) = 22 ·"},"quote_capped":true,"section":["Calculation","Using prime factorizations"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"after":{"layer":" The corresponding LCM is then 2max(4,2) · 3max(1,2) · 5max(0,1) = 24 · 32 · 51 = 720.","segments":[{"text":" The corresponding LCM is then 2max(4,2) · 3max(1,2) · 5max(0,1) = 24 · 32 · 51 = 720."}]},"before":{"layer":"For example, to compute gcd(48, 180), we find the prime factorizations 48 = 24 · 31 and 180 = 22 · 32 · 51; ","segments":[{"text":"For example, to compute gcd(48, 180), we find the prime factorizations 48 = 24 · 31 and 180 = 22 · 32 · 51; "}]},"layer":"the GCD is then 2min(4,2) · 3min(1,2) · 5min(0,1) = 22 · 31 · 50 = 12","segments":[{"text":"the GCD is then 2min(4,2) · 3min(1,2) · 5min(0,1) = 22 · 31 · 50 = 12"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":0,"queries":4,"sha256":"fec22934a215c659c392c5b245d5e4c0495b97a996a44430a9138ccd5403974c"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-12354-1372179102::In-text #8a5f72e0","item":"In-text #8a5f72e0","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.factorization_lcm","end_line":376,"library":"mathlib","line":370,"location_key":"2979543b8eee74231735c8db433d708b5b2f05a85d359ccbca2f4cf50ff7bf0f","module":"Mathlib.Data.Nat.Factorization.Basic","note":"It states that the factorization of a least common multiple of two nonzero numbers is the pointwise maximum of their factorizations, and it stops short of any numerical value.","pair_key":"6d65c7039dabf1264a8e5c0483fc5be34ca5ea0231c321ff02c518e64ebb4334","path":"Mathlib/Data/Nat/Factorization/Basic.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.factorization_lcm {a b : ℕ} : a ≠ 0 → b ≠ 0 → (a.lcm b).factorization = a.factorization ⊔ b.factorization"},"statement":false},{"challenge":"sampled_out","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"Nat.lcm_eq_mul_div","end_line":36,"library":"lean-core","line":36,"location_key":"441db54e332993dc24619862560559548a6d30127bbb7ed69e960016de61c05b","module":"Init.Data.Nat.Lcm","note":"It gives the least common multiple as the product divided by the gcd, which is another route to the example's number but not an assertion about these two arguments.","pair_key":"4ae7b568af45be45707ef4009719b6b26b3f340deec8b1b05c948eb00bf4a8e9","path":"src/Init/Data/Nat/Lcm.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Nat.lcm_eq_mul_div (m n : Nat) : m.lcm n = m * n / m.gcd n"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"5917cc4319d0ba874efe76be7c71c83c84a389eb9a46b6c4aa8a14807fd87f24","prominence":"supporting","quote":{"exact":"The corresponding LCM is then 2max(4,2) · 3max(1,2) · 5max(0,1) = 24"},"quote_capped":true,"section":["Calculation","Using prime factorizations"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"before":{"layer":"For example, to compute gcd(48, 180), we find the prime factorizations 48 = 24 · 31 and 180 = 22 · 32 · 51; the GCD is then 2min(4,2) · 3min(1,2) · 5min(0,1) = 22 · 31 · 50 = 12 ","segments":[{"text":"For example, to compute gcd(48, 180), we find the prime factorizations 48 = 24 · 31 and 180 = 22 · 32 · 51; the GCD is then 2min(4,2) · 3min(1,2) · 5min(0,1) = 22 · 31 · 50 = 12 "}]},"layer":"The corresponding LCM is then 2max(4,2) · 3max(1,2) · 5max(0,1) = 24 · 32 · 51 = 720.","segments":[{"text":"The corresponding LCM is then 2max(4,2) · 3max(1,2) · 5max(0,1) = 24 · 32 · 51 = 720."}]},"unresolved":null},{"absence":null,"basis":"37233a34fc637e2c899c84d8b9e4bf2381fec31e334bd7da3925df6b713cb046","coverage":null,"id":"enwiki-12354-1372179102::In-text #69e0c8db","item":"In-text #69e0c8db","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"dvd_sub_left","end_line":138,"library":"mathlib","line":137,"location_key":"37233a34fc637e2c899c84d8b9e4bf2381fec31e334bd7da3925df6b713cb046","module":"Mathlib.Algebra.Ring.Divisibility.Basic","note":"It is stated for one divisor of b at a time and over any non-unital ring; the passage's two collections agree because divisibility of b is shared by both sides of the equivalence.","pair_key":"491f5a1bfa7743e3ec93dd1bb65a01b604e891a8a0cd088c5e0978259b739b1c","path":"Mathlib/Algebra/Ring/Divisibility/Basic.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem dvd_sub_left {α : Type*} [NonUnitalRing α] {a b c : α} : a ∣ c → (a ∣ b - c ↔ a ∣ b)"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Int.gcd_sub_self_left","end_line":314,"library":"lean-core","line":313,"location_key":"dcb201f6b813107cb1ccf0d4954306e59d6cd2a1b63e05003ef1406a3ce26ca6","module":"Init.Data.Int.Gcd","note":"It says the gcd is unchanged when one integer is subtracted from the other, which is an equation between two greatest common divisors rather than the agreement of the two collections of common divisors.","pair_key":"81b52e33d0c41021c1eca959c53c2fb1d29f2da29af7092ae5d1dd12622abd03","path":"src/Init/Data/Int/Gcd.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Int.gcd_sub_self_left (m n : Int) : (n - m).gcd m = n.gcd m"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"c43bf0f9730a988231c48d2ce24113cd925bde3c9a447c6539e03f12f63c9749","prominence":"central","quote":{"exact":"The method introduced by Euclid for computing greatest common divisors is based"},"quote_capped":true,"section":["Calculation","Euclid's algorithm"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"The method introduced by Euclid for computing greatest common divisors is based on the fact that, given two positive integers a and b such that a > b, the common divisors of a and b are the same as the common divisors of a – b and b.","segments":[{"text":"The method introduced by Euclid for computing greatest common divisors is based on the fact that, given two positive integers a and b such that a > b, the common divisors of a and b are the same as the common divisors of a – b and b."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":0,"queries":3,"sha256":"b3faf01eef7e5e3d21e2103d7bf892da8350d18cb9052dfb111054e4b78768be"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-12354-1372179102::In-text #f1541263","item":"In-text #f1541263","kind":"construction","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Nat.gcd","end_line":41,"library":"lean-core","line":35,"location_key":"c31de81c5226bfaa2823d0b2623f5022d453b3258c2e83389d68636eb59cfa1a","module":"Init.Data.Nat.Gcd","note":"Lean's gcd on naturals recurses on the remainder of a division rather than on the difference of the two numbers, so it is a different construction that happens to take the same values.","pair_key":"c7680c564ba0bd8d4917545e29175af3bf79f820ebe082b6c3b5f77d5da49b1b","path":"src/Init/Data/Nat/Gcd.lean","proof_status":"definition","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"def Nat.gcd : Nat → Nat → Nat"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Nat.gcd_sub_self_left","end_line":330,"library":"lean-core","line":329,"location_key":"327478679d3a2cae51794383596b1596ca71ab9bc84b41905bfa6cfd89f94bf5","module":"Init.Data.Nat.Gcd","note":"It states that one subtraction step leaves the gcd unchanged, and says nothing about iterating the step, about stopping when the two numbers agree, or about the value then reached.","pair_key":"3bbc7a6798c878b4cce7a7a5a3e7346214af715c19640ff566bda31b4c407c4a","path":"src/Init/Data/Nat/Gcd.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Nat.gcd_sub_self_left {m n : Nat} : m ≤ n → (n - m).gcd m = n.gcd m"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"d70fe14597eadab39b93654cd4263e29281d0a3db53f108b364edff7a6f68e07","prominence":"central","quote":{"exact":"So, Euclid's method for computing the greatest common divisor of two positive"},"quote_capped":true,"section":["Calculation","Euclid's algorithm"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"So, Euclid's method for computing the greatest common divisor of two positive integers consists of replacing the larger number with the difference of the numbers, and repeating this until the two numbers are equal: that is their greatest common divisor.","segments":[{"text":"So, Euclid's method for computing the greatest common divisor of two positive integers consists of replacing the larger number with the difference of the numbers, and repeating this until the two numbers are equal: that is their greatest common divisor."}]},"unresolved":null},{"absence":null,"basis":"e3749554800e9951b2043dd3a4dfa53cd75614bf620106ff4220bdc28887916a","coverage":null,"id":"enwiki-12354-1372179102::In-text #2b49060c","item":"In-text #2b49060c","kind":"example","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"Nat.gcd_sub_self_left","end_line":330,"library":"lean-core","line":329,"location_key":"e3749554800e9951b2043dd3a4dfa53cd75614bf620106ff4220bdc28887916a","module":"Init.Data.Nat.Gcd","note":"Lean states for naturals that subtracting the smaller number from the larger leaves the pair's gcd unchanged, which is the law each step of this computation uses.","pair_key":"00e70eb42423941daa594997dc467b49f6a2924ba44cecec499df89f947c4108","path":"src/Init/Data/Nat/Gcd.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Nat.gcd_sub_self_left {m n : Nat} : m ≤ n → (n - m).gcd m = n.gcd m"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"Nat.gcd_sub_self_right","end_line":324,"library":"lean-core","line":323,"location_key":"1a04962d8eb94d8598af24cae87d6d24424ef85dfbc65c729783150cc5ca3d76","module":"Init.Data.Nat.Gcd","note":"The companion lemma subtracts the first entry from the second and keeps the gcd, which is the step that turns the pair twelve and eighteen into twelve and six.","pair_key":"c563daefe441a85a8f9ab74d891a025f7a5fec6957a22af74167c82db729d5b9","path":"src/Init/Data/Nat/Gcd.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Nat.gcd_sub_self_right {m n : Nat} : m ≤ n → m.gcd (n - m) = m.gcd n"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"890dec4c7e4ef421fa223e3a4ae1477db6721799b8099eeec668c5d12eb9c1ec","prominence":"supporting","quote":{"exact":"For example, to compute gcd(48,18), one proceeds as follows: gcd ( 48"},"quote_capped":true,"section":["Calculation","Euclid's algorithm"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"For example, to compute gcd(48,18), one proceeds as follows: gcd ( 48 , 18 ) → gcd ( 48 − 18 , 18 ) = gcd ( 30 , 18 ) → gcd ( 30 − 18 , 18 ) = gcd ( 12 , 18 ) → gcd ( 12 , 18 − 12 ) = gcd ( 12 , 6 ) → gcd ( 12 − 6 , 6 ) = gcd ( 6 , 6 ) . {\\displaystyle {\\begin{aligned}\\gcd(48,18)\\quad &\\to \\quad \\gcd(48-18,18)=\\gcd(30,18)\\\\&\\to \\quad \\gcd(30-18,18)=\\gcd(12,18)\\\\&\\to \\quad \\gcd(12,18-12)=\\gcd(12,6)\\\\&\\to \\quad \\gcd(12-6,6)=\\gcd(6,6).\\end{aligned}}}","segments":[{"text":"For example, to compute gcd(48,18), one proceeds as follows: "},{"tex":"\\begin{aligned}\\gcd(48,18)\\quad &\\to \\quad \\gcd(48-18,18)=\\gcd(30,18)\\\\&\\to \\quad \\gcd(30-18,18)=\\gcd(12,18)\\\\&\\to \\quad \\gcd(12,18-12)=\\gcd(12,6)\\\\&\\to \\quad \\gcd(12-6,6)=\\gcd(6,6).\\end{aligned}"}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":3,"queries":4,"sha256":"3deab2c6ccf0f9dc689265eb109d9b81f5a15b310e909fbcc0e0d013d04a2b07"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-12354-1372179102::In-text #7ef16bfc","item":"In-text #7ef16bfc","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"309c63ec542a7a08406c80ff1c90004dc4f0c91ae6a7c78700a22e5e0ac51fb1","prominence":"supporting","quote":{"exact":"So gcd(48, 18) = 6."},"quote_capped":false,"section":["Calculation","Euclid's algorithm"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"So gcd(48, 18) = 6.","segments":[{"text":"So gcd(48, 18) = 6."}]},"unresolved":null},{"absence":null,"basis":"0d0425de5a07f5aa3da094adf5620305e0450b33faf747ef39cb3dff9dc1a7d8","coverage":null,"id":"enwiki-12354-1372179102::In-text #517a7d3c","item":"In-text #517a7d3c","kind":"construction","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Nat.gcd","end_line":41,"library":"lean-core","line":35,"location_key":"0d0425de5a07f5aa3da094adf5620305e0450b33faf747ef39cb3dff9dc1a7d8","module":"Init.Data.Nat.Gcd","note":"Lean defines this function by the recursion that divides one argument by the other and keeps the remainder, taking the pair in the order with the divisor second and stopping once the first entry is zero.","pair_key":"f5a86da64e4afd365ebe20503321bbd7e7ef9d1d8407c79d70e413e112ecc817","path":"src/Init/Data/Nat/Gcd.lean","proof_status":"definition","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"def Nat.gcd : Nat → Nat → Nat"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"EuclideanDomain.gcd","end_line":185,"library":"mathlib","line":180,"location_key":"f811c21ac3a21bbb22aa0aee8869de4ca6888c8ec930851d5e067e76f4e445af","module":"Mathlib.Algebra.EuclideanDomain.Defs","note":"Mathlib builds the same remainder recursion for every ring with Euclidean division, so the passage's integers are one instance of its setting.","pair_key":"be0ee42043217d4793bd9dc0f075cc2e84e0f1f0b1d83f7151fbd8cf3320d9c1","path":"Mathlib/Algebra/EuclideanDomain/Defs.lean","proof_status":"definition","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def EuclideanDomain.gcd {R : Type u} [EuclideanDomain R] [DecidableEq R] : R → R → R"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Nat.gcd_rec","end_line":77,"library":"lean-core","line":74,"location_key":"177abdc4cdd71f4f2ef5c6bf4e75d6c3456c189a0443eac064705e5ef1e4e6ec","module":"Init.Data.Nat.Gcd","note":"The lemma records the remainder step of the recursion as an equation between gcd values, without naming the method as a whole.","pair_key":"b0d992eb2365ba015fc13f3577ec8ebfa4025c7fcabda626a4b5882410487fb2","path":"src/Init/Data/Nat/Gcd.lean","proof_status":"proved","rank":3,"relation":"hasPart","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Nat.gcd_rec (m n : Nat) : m.gcd n = (n % m).gcd m"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"6177602ae1ff90dd55f45aaa796dc06917703d5c1e7c04f37f3ed2bdaea8d97e","prominence":"central","quote":{"exact":"A more efficient method is the Euclidean algorithm, a variant in which"},"quote_capped":true,"section":["Calculation","Euclidean algorithm"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"A more efficient method is the Euclidean algorithm, a variant in which the difference of the two numbers a and b is replaced by the remainder of the Euclidean division (also called division with remainder) of a by b.","segments":[{"text":"A more efficient method is the Euclidean algorithm, a variant in which the difference of the two numbers a and b is replaced by the remainder of the Euclidean division (also called division with remainder) of a by b."}]},"unresolved":null},{"absence":null,"basis":"f5b3f996c589cc929a13344056898342a97671dd54eb3020b26bfe66a48e8b20","coverage":null,"id":"enwiki-12354-1372179102::In-text #af653571","item":"In-text #af653571","kind":"construction","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Nat.gcd","end_line":41,"library":"lean-core","line":35,"location_key":"f5b3f996c589cc929a13344056898342a97671dd54eb3020b26bfe66a48e8b20","module":"Init.Data.Nat.Gcd","note":"Lean's recursion carries the pair with the divisor in second position, recurses on the remainder of the second entry by the first, and returns the second entry as soon as the first is zero.","pair_key":"bbd6636c2723366adafdebb960ef2027e13195769d945972f79aa5f21b8f91b6","path":"src/Init/Data/Nat/Gcd.lean","proof_status":"definition","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"def Nat.gcd : Nat → Nat → Nat"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"EuclideanDomain.gcd","end_line":185,"library":"mathlib","line":180,"location_key":"fe95fa5ca777b0bdb461e14fdb698f442e415031833cd1a4813c9efdd87fcfe3","module":"Mathlib.Algebra.EuclideanDomain.Defs","note":"Mathlib's construction performs the same loop in any ring with Euclidean division, with the zero entry ending the recursion.","pair_key":"23cb7c5cfd38fc8d10db3a1e573776359db5acd4bdbc3f87675ef52aeff4d3a3","path":"Mathlib/Algebra/EuclideanDomain/Defs.lean","proof_status":"definition","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def EuclideanDomain.gcd {R : Type u} [EuclideanDomain R] [DecidableEq R] : R → R → R"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Nat.gcd_rec","end_line":77,"library":"lean-core","line":74,"location_key":"a409b72d335383eb9af2a64d934a918270c5297a9ef72b4ac5ecdcd0e9a7978f","module":"Init.Data.Nat.Gcd","note":"The lemma states the loop's single step as an equation, leaving the stopping condition to other declarations.","pair_key":"4ff8aa29f951aaaf356bc0be38db7a07f7748e42938814e0b0070df766ce50df","path":"src/Init/Data/Nat/Gcd.lean","proof_status":"proved","rank":3,"relation":"hasPart","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Nat.gcd_rec (m n : Nat) : m.gcd n = (n % m).gcd m"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Nat.gcd_zero_right","end_line":65,"library":"lean-core","line":59,"location_key":"6177f2688ff0629e07dc72f3d4264c529dc10a67cc35bcb6183e8c1a14d123c2","module":"Init.Data.Nat.Gcd","note":"The lemma gives the value at the terminating pair, which is where the passage stops the loop.","pair_key":"779abe5e1c729744c707c2ece64760ff7142320260d2a98d0ddd744d678d9926","path":"src/Init/Data/Nat/Gcd.lean","proof_status":"proved","rank":4,"relation":"hasPart","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Nat.gcd_zero_right (n : Nat) : n.gcd 0 = n"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"e56ee9dc9d426c424c82403ef2cbe93644171865053959713de3a11ac97570c2","prominence":"central","quote":{"exact":"Denoting this remainder as a mod b, the algorithm replaces (a, b)"},"quote_capped":true,"section":["Calculation","Euclidean algorithm"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"Denoting this remainder as a mod b, the algorithm replaces (a, b) with (b, a mod b) repeatedly until the pair is (d, 0), where d is the greatest common divisor.","segments":[{"text":"Denoting this remainder as a mod b, the algorithm replaces (a, b) with (b, a mod b) repeatedly until the pair is (d, 0), where d is the greatest common divisor."}]},"unresolved":null},{"absence":null,"basis":"f8d34445f705bc37ae020dcf22f36efc371c79d1026da2df654b2fcacbc9ee95","coverage":null,"id":"enwiki-12354-1372179102::In-text #70fd3c20","item":"In-text #70fd3c20","kind":"example","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"Nat.gcd_rec","end_line":77,"library":"lean-core","line":74,"location_key":"f8d34445f705bc37ae020dcf22f36efc371c79d1026da2df654b2fcacbc9ee95","module":"Init.Data.Nat.Gcd","note":"Lean states the remainder step for arbitrary naturals, with the remainder taken of the second argument by the first, which the example performs at the numbers forty eight and eighteen.","pair_key":"4f9af92056934bef4f31f318464926df84a1ffba247ac85fbc76724e7561eca4","path":"src/Init/Data/Nat/Gcd.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Nat.gcd_rec (m n : Nat) : m.gcd n = (n % m).gcd m"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"Nat.gcd_succ","end_line":47,"library":"lean-core","line":46,"location_key":"d367cf2d3ed1f02fe073dfca8f5ab036bcebffc3909a0238f046ea9a0b06ebdc","module":"Init.Data.Nat.Gcd","note":"This form of the recursion is written for a nonzero first argument, which is the situation at every step of the computation before the last.","pair_key":"0b31a474e083d7700d6662f44dfe1c2ebaae5725f5a49f03d6f686c1da27cbf3","path":"src/Init/Data/Nat/Gcd.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Nat.gcd_succ (x y : Nat) : x.succ.gcd y = (y % x.succ).gcd x.succ"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"2bfc04448e1df461e1ea9bd3164adefc7b6502309ed8ce62c3413062a03ea8d6","prominence":"supporting","quote":{"exact":"For example, to compute gcd(48,18), the computation is as follows: gcd ("},"quote_capped":true,"section":["Calculation","Euclidean algorithm"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"For example, to compute gcd(48,18), the computation is as follows: gcd ( 48 , 18 ) → gcd ( 18 , 48 mod 1 8 ) = gcd ( 18 , 12 ) → gcd ( 12 , 18 mod 1 2 ) = gcd ( 12 , 6 ) → gcd ( 6 , 12 mod 6 ) = gcd ( 6 , 0 ) . {\\displaystyle {\\begin{aligned}\\gcd(48,18)\\quad &\\to \\quad \\gcd(18,48{\\bmod {1}}8)=\\gcd(18,12)\\\\&\\to \\quad \\gcd(12,18{\\bmod {1}}2)=\\gcd(12,6)\\\\&\\to \\quad \\gcd(6,12{\\bmod {6}})=\\gcd(6,0).\\end{aligned}}}","segments":[{"text":"For example, to compute gcd(48,18), the computation is as follows: "},{"tex":"\\begin{aligned}\\gcd(48,18)\\quad &\\to \\quad \\gcd(18,48{\\bmod {1}}8)=\\gcd(18,12)\\\\&\\to \\quad \\gcd(12,18{\\bmod {1}}2)=\\gcd(12,6)\\\\&\\to \\quad \\gcd(6,12{\\bmod {6}})=\\gcd(6,0).\\end{aligned}"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":3,"queries":4,"sha256":"c6162ad2edbfebe494102881bb112b3363ab68ce4ef10291a85e5b9c0f35d19d"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-12354-1372179102::In-text #dbab8077","item":"In-text #dbab8077","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"aa66aaf41da2a6dc228ae3a6b1c9c21e8177d50893450bc80b0de119fb3039ab","prominence":"supporting","quote":{"exact":"This again gives gcd(48, 18) = 6."},"quote_capped":false,"section":["Calculation","Euclidean algorithm"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"This again gives gcd(48, 18) = 6.","segments":[{"text":"This again gives gcd(48, 18) = 6."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":3,"queries":4,"sha256":"6a35517a77bbda25862829f8abb64dc76ef80f1780a7e1bb05ae1ed2a70de5c6"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-12354-1372179102::In-text #b91567f2","item":"In-text #b91567f2","kind":"construction","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"70cdd33aff74d3a2c7495c93af93c1bfb5e9849e778a1f2335229fc8451a6022","prominence":"supporting","quote":{"exact":"If a and b are both even, then divide both by two"},"quote_capped":true,"section":["Calculation","Binary GCD algorithm"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"If a and b are both even, then divide both by two until at least one of them becomes odd; let d be the number of these paired divisions.","segments":[{"text":"If a and b are both even, then divide both by two until at least one of them becomes odd; let d be the number of these paired divisions."}]},"unresolved":null},{"absence":null,"basis":"d2992c34ef8c90bf9b4b71b82609247212824c4621c6111a1040e314c31bd624","coverage":null,"id":"enwiki-12354-1372179102::In-text #44686da2","item":"In-text #44686da2","kind":"construction","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Nat.divMaxPow","end_line":54,"library":"mathlib","line":54,"location_key":"d2992c34ef8c90bf9b4b71b82609247212824c4621c6111a1040e314c31bd624","module":"Mathlib.Data.Nat.MaxPowDiv","note":"Mathlib defines this as the quotient of a number by the largest power of the base dividing it, and at base two that quotient is the odd number the passage's halving reaches.","pair_key":"eed2e82503bde74739d0bdf94e07be05d1c4e18ab31b4483106c58ef37e9a977","path":"Mathlib/Data/Nat/MaxPowDiv.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Nat.divMaxPow : ℕ → ℕ → ℕ"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Nat.maxPowDvdDiv","end_line":51,"library":"mathlib","line":32,"location_key":"33ba31c17752ce332a63f2a981b8845624e6a8414d665cb766e92fd4dad53907","module":"Mathlib.Data.Nat.MaxPowDiv","note":"This construction returns both how many times the base divides the number and the quotient that remains, the latter being the odd number the passage's halving produces.","pair_key":"913dcad04ec1af546994dcb0600c5b1c506ba5faa7fedcf6dca83895dc403fa4","path":"Mathlib/Data/Nat/MaxPowDiv.lean","proof_status":"definition","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Nat.maxPowDvdDiv : ℕ → ℕ → ℕ × ℕ"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"0ddf24794d846826c5d96c5c4c3db6ec919c49d63b0836338f8c75a41b88296f","prominence":"supporting","quote":{"exact":"If a is even, then divide it by two until it becomes"},"quote_capped":true,"section":["Calculation","Binary GCD algorithm"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"If a is even, then divide it by two until it becomes odd.","segments":[{"text":"If a is even, then divide it by two until it becomes odd."}]},"unresolved":null},{"absence":null,"basis":"267548637b3c8e113d12da3239b8993e525528a9d45ade058c30d929103eaf5f","coverage":null,"id":"enwiki-12354-1372179102::In-text #3d0cfe30","item":"In-text #3d0cfe30","kind":"construction","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Nat.divMaxPow","end_line":54,"library":"mathlib","line":54,"location_key":"267548637b3c8e113d12da3239b8993e525528a9d45ade058c30d929103eaf5f","module":"Mathlib.Data.Nat.MaxPowDiv","note":"Mathlib divides a number by the largest power of an arbitrary base dividing it, and the passage uses the base two.","pair_key":"496afda6f3f8b2f5969d192c3e6fd288c8e47138d0c7a067041895440d2759cd","path":"Mathlib/Data/Nat/MaxPowDiv.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Nat.divMaxPow : ℕ → ℕ → ℕ"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Nat.maxPowDvdDiv","end_line":51,"library":"mathlib","line":32,"location_key":"7995b201f010bef6a55654ce0c6f352562a8cbea2102e6263301183387e63624","module":"Mathlib.Data.Nat.MaxPowDiv","note":"It returns both the number of divisions performed and the quotient, where the passage keeps only the quotient.","pair_key":"3637e589de74e8533504cb295a5aa418111e388318e8c991c3e9fc9a099b0fa6","path":"Mathlib/Data/Nat/MaxPowDiv.lean","proof_status":"definition","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Nat.maxPowDvdDiv : ℕ → ℕ → ℕ × ℕ"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"b8eb7af09427527a3a9450acc3186b8f43d9d8ff4c9b02ab3657b7262a29b936","prominence":"supporting","quote":{"exact":"If b is even, then divide it by two until it becomes"},"quote_capped":true,"section":["Calculation","Binary GCD algorithm"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"If b is even, then divide it by two until it becomes odd.","segments":[{"text":"If b is even, then divide it by two until it becomes odd."}]},"unresolved":null},{"absence":null,"basis":"a95757787bad2fb3be423991ce8d020ebbc30e27b22c55046ed70707ace0ad1e","coverage":null,"id":"enwiki-12354-1372179102::In-text #f9ad694f","item":"In-text #f9ad694f","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Nat.exists_eq_two_pow_mul_odd","end_line":285,"library":"mathlib","line":282,"location_key":"a95757787bad2fb3be423991ce8d020ebbc30e27b22c55046ed70707ace0ad1e","module":"Mathlib.Data.Nat.Factorization.Basic","note":"It fixes the oddness reached by the halving steps, and says nothing about the later loop keeping the two numbers odd.","pair_key":"df4538e5b688d261bc528af259860240ec747ccc05ba194750a15593394b913e","path":"Mathlib/Data/Nat/Factorization/Basic.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.exists_eq_two_pow_mul_odd {n : ℕ} : n ≠ 0 → ∃ k m, Odd m ∧ n = 2 ^ k * m"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Nat.not_dvd_divMaxPow","end_line":96,"library":"mathlib","line":95,"location_key":"de04c7b47f1496beacd9b6e7ddb62fd2717f32d0982bda0e17720d75dc4ee79e","module":"Mathlib.Data.Nat.MaxPowDiv","note":"It pins the result of a halving as odd whenever one is performed, but does not model the algorithm's later iterations.","pair_key":"732f56b977c9b63dc18495a77bac5401be7d8c285d5b1aa0b615d3b9f2993a1b","path":"Mathlib/Data/Nat/MaxPowDiv.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.not_dvd_divMaxPow {p n : ℕ} : 1 < p → n ≠ 0 → ¬p ∣ n.divMaxPow p"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"4671e6bee30191131db471155ec12e8ec77f5a821fc85d74e4e5f97d5f757995","prominence":"supporting","quote":{"exact":"Now, a and b are both odd and will remain odd until"},"quote_capped":true,"section":["Calculation","Binary GCD algorithm"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"Now, a and b are both odd and will remain odd until the end of the computation","segments":[{"text":"Now, a and b are both odd and will remain odd until the end of the computation"}]},"unresolved":null},{"absence":null,"basis":null,"coverage":null,"id":"enwiki-12354-1372179102::In-text #cb4dc3cd","item":"In-text #cb4dc3cd","kind":"construction","locations":[],"outcome":"unresolved","passage_ends_in_suffix":false,"passage_key":"8ed74852644eb87501be81506ba651957ff8f5a9ead484f76001e8c8d66a2478","prominence":"supporting","quote":{"exact":"While a ≠ b do"},"quote_capped":false,"section":["Calculation","Binary GCD algorithm"],"status":null,"subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"after":{"layer":" If a > b, then replace a with a – b and divide the result by two until a becomes odd (as a and b are both odd, there is, at least, one division by 2).","segments":[{"text":" If a > b, then replace a with a – b and divide the result by two until a becomes odd (as a and b are both odd, there is, at least, one division by 2)."}]},"before":{"layer":"Now, a and b are both odd and will remain odd until the end of the computation ","lead_in":true,"segments":[{"text":"Now, a and b are both odd and will remain odd until the end of the computation "}]},"layer":"While a ≠ b do","segments":[{"text":"While a ≠ b do"}]},"unresolved":{"challenge":"sampled_out"}},{"absence":null,"basis":"46f6ee70cf436cfbbcb874c689dfbe4f21945eb9fc3a4c2da06cffc6759e3f36","coverage":null,"id":"enwiki-12354-1372179102::In-text #28f295c8","item":"In-text #28f295c8","kind":"construction","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.Odd.sub_odd","end_line":297,"library":"mathlib","line":297,"location_key":"46f6ee70cf436cfbbcb874c689dfbe4f21945eb9fc3a4c2da06cffc6759e3f36","module":"Mathlib.Algebra.Ring.Parity","note":"It yields the guarantee of a division by two attached to this step, not the replacement of a by the halved difference.","pair_key":"d79691d3a622470f6d82af24816fdd3d0ee85bc58c651c45c5898982ac6c0886","path":"Mathlib/Algebra/Ring/Parity.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.Odd.sub_odd {m n : ℕ} : Odd m → Odd n → Even (m - n)"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Nat.divMaxPow","end_line":54,"library":"mathlib","line":54,"location_key":"5e71db768de876a2bed3cb802b6c6cd53d03938f1cc7c3c4e322553a2e26bd19","module":"Mathlib.Data.Nat.MaxPowDiv","note":"It supplies the halving half of the step; the branch test and the guarantee of one division come from elsewhere.","pair_key":"5d86b00da4c85aa7b9d3fb1276e1305dc24ff3ab5fe629289a1b556993a4a538","path":"Mathlib/Data/Nat/MaxPowDiv.lean","proof_status":"definition","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Nat.divMaxPow : ℕ → ℕ → ℕ"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Nat.gcd_sub_self_left","end_line":330,"library":"lean-core","line":329,"location_key":"c4221970c9dda87fb2779b21599c14ff5b14eb74abcfac69eff81aaca84aa679","module":"Init.Data.Nat.Gcd","note":"Replacing the larger number by the difference leaves the gcd alone; the passage prescribes the replacement rather than asserting its correctness.","pair_key":"951a8d63da2b15ea4d19238263594fbd9c33e61755aa2b445c9d0c322acd456d","path":"src/Init/Data/Nat/Gcd.lean","proof_status":"proved","rank":3,"relation":"relatedMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Nat.gcd_sub_self_left {m n : Nat} : m ≤ n → (n - m).gcd m = n.gcd m"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"2927573f1559d455c2e92e1300a4e2722d636a55f4923f3b8079a4c0342c0bf4","prominence":"supporting","quote":{"exact":"If a > b, then replace a with a – b and"},"quote_capped":true,"section":["Calculation","Binary GCD algorithm"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"before":{"layer":"While a ≠ b do ","segments":[{"text":"While a ≠ b do "}]},"layer":"If a > b, then replace a with a – b and divide the result by two until a becomes odd (as a and b are both odd, there is, at least, one division by 2).","segments":[{"text":"If a > b, then replace a with a – b and divide the result by two until a becomes odd (as a and b are both odd, there is, at least, one division by 2)."}]},"unresolved":null},{"absence":null,"basis":"34ff3608e0438cc85c0160bba643767e87f72c0e97c703917712543d7a105d31","coverage":null,"id":"enwiki-12354-1372179102::In-text #e6f4b8d3","item":"In-text #e6f4b8d3","kind":"construction","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Nat.divMaxPow","end_line":54,"library":"mathlib","line":54,"location_key":"34ff3608e0438cc85c0160bba643767e87f72c0e97c703917712543d7a105d31","module":"Mathlib.Data.Nat.MaxPowDiv","note":"Mathlib removes the largest power of an arbitrary base, and the passage applies the base two to the difference it has just formed.","pair_key":"749dad437dc76b5ccf6f98d2036eebf5108c465dbdd3aad94fe2196a74ceed15","path":"Mathlib/Data/Nat/MaxPowDiv.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Nat.divMaxPow : ℕ → ℕ → ℕ"},"statement":false},{"challenge":"sampled_out","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Nat.gcd_sub_self_right","end_line":324,"library":"lean-core","line":323,"location_key":"fe890333101124176b9d1cde2d2214071ace599433fbaaf05a734418bc79aebb","module":"Init.Data.Nat.Gcd","note":"Subtracting the smaller number from the larger leaves the gcd unchanged, which is a fact about gcd rather than this replacement step.","pair_key":"8777c3545cd490e2a5f2d37d99d4663477322c3ae53f937191f2153f7b54ec7c","path":"src/Init/Data/Nat/Gcd.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Nat.gcd_sub_self_right {m n : Nat} : m ≤ n → m.gcd (n - m) = m.gcd n"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"2ca2a6e8c2ee512a6e722c7fadc2cbd65deaae5c0b9a364285c3355d922b512b","prominence":"supporting","quote":{"exact":"If a < b, then replace b with b – a and"},"quote_capped":true,"section":["Calculation","Binary GCD algorithm"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"If a < b, then replace b with b – a and divide the result by two until b becomes odd.","segments":[{"text":"If a < b, then replace b with b – a and divide the result by two until b becomes odd."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"5e8fb4debaa8141052913ee05ace3db1feae2c058083d91b96935ace3f7b9082"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-12354-1372179102::In-text #ade0b80b","item":"In-text #ade0b80b","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"561bf1b40d6248735d3ed7108ae6341fb4d7faf5fcf9f930cb22cc5174035cfb","prominence":"supporting","quote":{"exact":"Now, a = b"},"quote_capped":false,"section":["Calculation","Binary GCD algorithm"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"after":{"layer":", and the greatest common divisor is 2 d a . {\\displaystyle 2^{d}a.}","segments":[{"text":", and the greatest common divisor is "},{"tex":"2^{d}a."}]},"layer":"Now, a = b","segments":[{"text":"Now, a = b"}]},"unresolved":null},{"absence":null,"basis":"59d4b76326e7e0d1c1b7d0054cad69b57beadf2208e9496d85add606f05a0413","coverage":null,"id":"enwiki-12354-1372179102::In-text #9fb8a520","item":"In-text #9fb8a520","kind":"theorem","locations":[{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.Nat.gcd_eq_gcd_ordCompl_mul_pow_min","end_line":71,"library":"tauceti","line":62,"location_key":"59d4b76326e7e0d1c1b7d0054cad69b57beadf2208e9496d85add606f05a0413","module":"TauCeti.Data.Nat.Factorization.GcdSplit","note":"It accounts for the factor two to the d and leaves unstated that the value the iteration ends on is the gcd of the odd parts.","pair_key":"cf2da5e8d5ccc9cf57c709ea305d0428386cdc00f36c8003a800dd534f31aabf","path":"TauCeti/Data/Nat/Factorization/GcdSplit.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem TauCeti.Nat.gcd_eq_gcd_ordCompl_mul_pow_min {p m n : ℕ} : Nat.Prime p → m ≠ 0 → n ≠ 0 → m.gcd n = (m / p ^ m.factorization p).gcd (n / p ^ n.factorization p) * p ^ Min.min (m.factorization p) (n.factorization p)"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Nat.gcd_mul_left","end_line":142,"library":"lean-core","line":139,"location_key":"d472f5e7e7a8e4c40a82653ec44e675db66ec094f4a208945418a6c91c03f051","module":"Init.Data.Nat.Gcd","note":"It pulls a shared factor out of a gcd, with no mention of the paired halvings or of the value the iteration ends on.","pair_key":"e03442731be5ee1598fe137151a5816c4a4b1bbfa3067351af732ef2b4769dbc","path":"src/Init/Data/Nat/Gcd.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Nat.gcd_mul_left (m n k : Nat) : (m * n).gcd (m * k) = m * n.gcd k"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"ce3728d76ce7bbe966967d9ff9b6fdb8376cf3db7922980ed40b7db8b6315c10","prominence":"central","quote":{"exact":"the greatest common divisor is 2 d a . {\\displaystyle 2^{d}a.}"},"quote_capped":false,"section":["Calculation","Binary GCD algorithm"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"before":{"layer":"Now, a = b, and ","segments":[{"text":"Now, a = b, and "}]},"layer":"the greatest common divisor is 2 d a . {\\displaystyle 2^{d}a.}","segments":[{"text":"the greatest common divisor is "},{"tex":"2^{d}a."}]},"unresolved":null},{"absence":null,"basis":"529f55f73b956e60e517292f4bd4e4421022bbf2861020aa77edd42dbf28fcda","coverage":null,"id":"enwiki-12354-1372179102::In-text #fd8abbc1","item":"In-text #fd8abbc1","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Nat.factorization_gcd","end_line":368,"library":"mathlib","line":355,"location_key":"529f55f73b956e60e517292f4bd4e4421022bbf2861020aa77edd42dbf28fcda","module":"Mathlib.Data.Nat.Factorization.Basic","note":"Mathlib records the exponents of every prime at once, and the passage reads the entry at two.","pair_key":"6db2491f4f6bbca0d104472955661a63f157c54af5c131210e94b35ccdf3e2e7","path":"Mathlib/Data/Nat/Factorization/Basic.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.factorization_gcd {a b : ℕ} : a ≠ 0 → b ≠ 0 → (a.gcd b).factorization = a.factorization ⊓ b.factorization"},"statement":false},{"challenge":"sampled_out","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.Nat.gcd_eq_gcd_ordCompl_mul_pow_min","end_line":71,"library":"tauceti","line":62,"location_key":"7c2c46dd4dcd611ae75a154846a7d4a4192abb816ea1063064c4665d0f188925","module":"TauCeti.Data.Nat.Factorization.GcdSplit","note":"It displays the power of two inside the gcd without naming it as the full exponent of two there.","pair_key":"e9bc2a4b1b2505148536d0f33dc1fbd79d1d60969f22c1c52506cb54bb731ffd","path":"TauCeti/Data/Nat/Factorization/GcdSplit.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem TauCeti.Nat.gcd_eq_gcd_ordCompl_mul_pow_min {p m n : ℕ} : Nat.Prime p → m ≠ 0 → n ≠ 0 → m.gcd n = (m / p ^ m.factorization p).gcd (n / p ^ n.factorization p) * p ^ Min.min (m.factorization p) (n.factorization p)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"f1da3d33e6d58d54f80af333c213f16bafa4415f253e90331398f56c00f97680","prominence":"supporting","quote":{"exact":"Step 1 determines d as the highest power of 2 that divides"},"quote_capped":true,"section":["Calculation","Binary GCD algorithm"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"Step 1 determines d as the highest power of 2 that divides a and b, and thus their greatest common divisor.","segments":[{"text":"Step 1 determines d as the highest power of 2 that divides a and b, and thus their greatest common divisor."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"2f66090d79959ce840859910cde12e9ad8e6008d2cee5737cf1f472e048111de"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-12354-1372179102::In-text #144f19a4","item":"In-text #144f19a4","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"c544afe9475e28e665204aaa9359cbd244e86f0e9f85fff8dfeb4c1a23168287","prominence":"supporting","quote":{"exact":"None of the steps changes the set of the odd common divisors"},"quote_capped":true,"section":["Calculation","Binary GCD algorithm"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"None of the steps changes the set of the odd common divisors of a and b.","segments":[{"text":"None of the steps changes the set of the odd common divisors of a and b."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"81f5d7488d48bdb58d07fe878275c2ba03a536504fa7d5ac5983ec561bca0ca0"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-12354-1372179102::In-text #2f1caac0","item":"In-text #2f1caac0","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"72e7ff48c1f53d70ef1cbaefe05729f74dc13b984aceb5793134aa79136a1c0f","prominence":"central","quote":{"exact":"This shows that when the algorithm stops, the result is correct."},"quote_capped":false,"section":["Calculation","Binary GCD algorithm"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"This shows that when the algorithm stops, the result is correct.","segments":[{"text":"This shows that when the algorithm stops, the result is correct."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":1,"queries":3,"sha256":"0c9ed68ce47690cae0cd1fd9e38eb169b741f9169176aac21c6835f5872cee53"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-12354-1372179102::In-text #017930df","item":"In-text #017930df","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"bd2ddd3eb897acc56db836a54836177282fcd22decc7750ce6cc5166657d85b4","prominence":"supporting","quote":{"exact":"The algorithm stops eventually"},"quote_capped":false,"section":["Calculation","Binary GCD algorithm"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"after":{"layer":", since each steps divides at least one of the operands by at least 2.","segments":[{"text":", since each steps divides at least one of the operands by at least 2."}]},"layer":"The algorithm stops eventually","segments":[{"text":"The algorithm stops eventually"}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":1,"queries":3,"sha256":"e4d3de8353bffe68af9bf5864c9d6e54fcbdf7aaf339290f0719c6ef582eaec1"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-12354-1372179102::In-text #f92b4330","item":"In-text #f92b4330","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"983e95a8c6b6375cdb53ac74500b1d6be87302d25473b2552299f4312ad83c12","prominence":"supporting","quote":{"exact":"each steps divides at least one of the operands by at least"},"quote_capped":true,"section":["Calculation","Binary GCD algorithm"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"before":{"layer":"The algorithm stops eventually, since ","segments":[{"text":"The algorithm stops eventually, since "}]},"layer":"each steps divides at least one of the operands by at least 2.","segments":[{"text":"each steps divides at least one of the operands by at least 2."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"ac44c12c98d4d835eec3db693a206b12d08cfd6c9d93074830bbc55f4e8811ee"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-12354-1372179102::In-text #d1352066","item":"In-text #d1352066","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"399fde62119b3cd3934c47728b0c3c76b76d7680a7ac7b948d4b71875dd4f315","prominence":"supporting","quote":{"exact":"the number of divisions by 2 and thus the number of subtractions"},"quote_capped":true,"section":["Calculation","Binary GCD algorithm"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"before":{"layer":"Moreover, ","segments":[{"text":"Moreover, "}]},"layer":"the number of divisions by 2 and thus the number of subtractions is at most the total number of digits.","segments":[{"text":"the number of divisions by 2 and thus the number of subtractions is at most the total number of digits."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":0,"queries":3,"sha256":"39d634d1d73d6a3150f51c69d0825cccdc1ba29a6514364908e0524b33cd384e"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-12354-1372179102::In-text #1df54564","item":"In-text #1df54564","kind":"example","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"9936a3ebb99d2eafb66027b71682e8ab0f94ecd77f4ea428e4c9d4525b461129","prominence":"supporting","quote":{"exact":"Example: (a, b, d) = (48, 18, 0) → (24, 9, 1)"},"quote_capped":true,"section":["Calculation","Binary GCD algorithm"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"after":{"layer":" ; the original GCD is thus the product 6 of 2d = 21 and a = b = 3.","segments":[{"text":" ; the original GCD is thus the product 6 of 2d = 21 and a = b = 3."}]},"layer":"Example: (a, b, d) = (48, 18, 0) → (24, 9, 1) → (12, 9, 1) → (6, 9, 1) → (3, 9, 1) → (3, 3, 1)","segments":[{"text":"Example: (a, b, d) = (48, 18, 0) → (24, 9, 1) → (12, 9, 1) → (6, 9, 1) → (3, 9, 1) → (3, 3, 1)"}]},"unresolved":null},{"absence":null,"basis":"00bd56547d87072336d46d498773ada79ceaab91332109280d01559b64833910","coverage":null,"id":"enwiki-12354-1372179102::In-text #d155e89a","item":"In-text #d155e89a","kind":"theorem","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"Nat.gcd_mul_left","end_line":142,"library":"lean-core","line":139,"location_key":"00bd56547d87072336d46d498773ada79ceaab91332109280d01559b64833910","module":"Init.Data.Nat.Gcd","note":"Lean states it for natural numbers, where the passage's 48 and 18 live; the factor pulled out is the power of two the article writes as 2 to the power d.","pair_key":"2373fbf07f02251e1ea98e52d516b6d274c9c0f5387bf97b1b77c50b4014da19","path":"src/Init/Data/Nat/Gcd.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Nat.gcd_mul_left (m n k : Nat) : (m * n).gcd (m * k) = m * n.gcd k"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"8f2ecb5b38a25a1e2f44389652ae0c9bcb4f868f426afd4da743c3adf900133d","prominence":"supporting","quote":{"exact":"the original GCD is thus the product 6 of 2d = 21"},"quote_capped":true,"section":["Calculation","Binary GCD algorithm"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"before":{"layer":"Example: (a, b, d) = (48, 18, 0) → (24, 9, 1) → (12, 9, 1) → (6, 9, 1) → (3, 9, 1) → (3, 3, 1) ; ","segments":[{"text":"Example: (a, b, d) = (48, 18, 0) → (24, 9, 1) → (12, 9, 1) → (6, 9, 1) → (3, 9, 1) → (3, 3, 1) ; "}]},"layer":"the original GCD is thus the product 6 of 2d = 21 and a = b = 3.","segments":[{"text":"the original GCD is thus the product 6 of 2d = 21 and a = b = 3."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"29371dece00070ac9c3268e3000adbc5923492a8ec2fd85f45641ba3198b9d84"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-12354-1372179102::In-text #2d508c89","item":"In-text #2d508c89","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"ed56807a0b8dbb3cc36e102cea15832f5f4c48f8f80448ef53228cfe3bfc1b7c","prominence":"central","quote":{"exact":"Its computational complexity is O ( ( log ⁡ a + log"},"quote_capped":true,"section":["Calculation","Binary GCD algorithm"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"Its computational complexity is O ( ( log ⁡ a + log ⁡ b ) 2 ) . {\\displaystyle O((\\log a+\\log b)^{2}).}","segments":[{"text":"Its computational complexity is "},{"tex":"O((\\log a+\\log b)^{2})."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":1,"queries":4,"sha256":"f769e6b117c8c181ad2dfcb27b5cef619389b9bb73b47d3c7e780b1fee614290"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-12354-1372179102::In-text #13fdbbe4","item":"In-text #13fdbbe4","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"59ed61c156a2509f4ed2320f54011845c0f82618cfa19d66bfc488f488593a8d","prominence":"supporting","quote":{"exact":"The square in this complexity comes from the fact that division by"},"quote_capped":true,"section":["Calculation","Binary GCD algorithm"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"The square in this complexity comes from the fact that division by 2 and subtraction take a time that is proportional to the number of bits of the input.","segments":[{"text":"The square in this complexity comes from the fact that division by 2 and subtraction take a time that is proportional to the number of bits of the input."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":0,"queries":3,"sha256":"4bfee0dd522120f4ea698bc8b0cb99cb8faad846061bd35e2f7ff3abcf7c9d76"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-12354-1372179102::In-text #62ebc38c","item":"In-text #62ebc38c","kind":"notation","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"d9349d8b344e1229716854abb12ec69fd6b0dbba752b8a2c199c06b25e4414df","prominence":"supporting","quote":{"exact":"Here, this length is n = log a + log b"},"quote_capped":false,"section":["Calculation","Binary GCD algorithm"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"after":{"layer":", and the complexity is thus","segments":[{"text":", and the complexity is thus"}]},"layer":"Here, this length is n = log a + log b","segments":[{"text":"Here, this length is n = log a + log b"}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":1,"queries":4,"sha256":"faaa586a7ec12867231cc8486f21d37e2fb9797c14cd4631f9707400054c92d1"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-12354-1372179102::In-text #be3dfceb","item":"In-text #be3dfceb","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"c2cd66b47167b267b16c6178b5ef5ab2285e7e050c92b45384f22610c8d38e41","prominence":"central","quote":{"exact":"the complexity is thus O ( n 2 ) {\\displaystyle O(n^{2})} ."},"quote_capped":false,"section":["Calculation","Binary GCD algorithm"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"before":{"layer":"Here, this length is n = log a + log b, and ","segments":[{"text":"Here, this length is n = log a + log b, and "}]},"layer":"the complexity is thus O ( n 2 ) {\\displaystyle O(n^{2})} .","segments":[{"text":"the complexity is thus "},{"tex":"O(n^{2})"},{"text":" ."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":0,"queries":4,"sha256":"51311e7d21006949033e9b20d3ddc7c1ca6c66b2cb351e25e381878edc96a278"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-12354-1372179102::In-text #2c198615","item":"In-text #2c198615","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"bc08b1e07ee83e7fb9a3e307ef737d17715532d48b96d9ec4649e59318d40901","prominence":"central","quote":{"exact":"Lehmer's algorithm is based on the observation that the initial quotients produced"},"quote_capped":true,"section":["Calculation","Lehmer's GCD algorithm"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"after":{"layer":"; this is useful for numbers that are larger than a computer word.","segments":[{"text":"; this is useful for numbers that are larger than a computer word."}]},"layer":"Lehmer's algorithm is based on the observation that the initial quotients produced by Euclid's algorithm can be determined based on only the first few digits","segments":[{"text":"Lehmer's algorithm is based on the observation that the initial quotients produced by Euclid's algorithm can be determined based on only the first few digits"}]},"unresolved":null},{"absence":null,"basis":"4e16ff10f6f8779a6ec2aa84299907aed9ae00affe1ee3cd157723acb7614a72","coverage":null,"id":"enwiki-12354-1372179102::In-text #b4320be9","item":"In-text #b4320be9","kind":"theorem","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Int.gcd_mul_lcm","end_line":451,"library":"lean-core","line":450,"location_key":"4e16ff10f6f8779a6ec2aa84299907aed9ae00affe1ee3cd157723acb7614a72","module":"Init.Data.Int.Gcd","note":"Lean clears the denominator, equating the product of gcd and lcm with the product of the two absolute values, which is how a library states it when integer division truncates; the extra zero cases read 0 = 0.","pair_key":"3138189ab879d91f67b7804f7c411e406f0a2e88ebdb9e620a0f03cbdb55b0bf","path":"src/Init/Data/Int/Gcd.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Int.gcd_mul_lcm (m n : Int) : m.gcd n * m.lcm n = m.natAbs * n.natAbs"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Nat.gcd_mul_lcm","end_line":40,"library":"lean-core","line":38,"location_key":"649600eb4800ebaa92aadbcbd20838883a14116f2d44b0d7afd5ee5ac6cfecf0","module":"Init.Data.Nat.Lcm","note":"The statement lives over ℕ, so it covers the positive inputs of the sentence and reaches negative ones only through their absolute values.","pair_key":"adc7d5abb6edda23236e57b0de1ddbb7f294bcd23b78bfdf48349d110abafdd3","path":"src/Init/Data/Nat/Lcm.lean","proof_status":"proved","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Nat.gcd_mul_lcm (m n : Nat) : m.gcd n * m.lcm n = m * n"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"3acc6fe4319f1f3996f28ba3d58f8619b668f74fba3561915da06a8ec90dd5c7","prominence":"central","quote":{"exact":"If a and b are both nonzero, the greatest common divisor of"},"quote_capped":true,"section":["Calculation","Other methods"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"If a and b are both nonzero, the greatest common divisor of a and b can be computed by using least common multiple (LCM) of a and b: gcd ( a , b ) = | a ⋅ b | lcm ⁡ ( a , b ) {\\displaystyle \\gcd(a,b)={\\frac {|a\\cdot b|}{\\operatorname {lcm} (a,b)}}} , but more commonly the LCM is computed from the GCD.","segments":[{"text":"If a and b are both nonzero, the greatest common divisor of a and b can be computed by using least common multiple (LCM) of a and b: "},{"tex":"\\gcd(a,b)={\\frac {|a\\cdot b|}{\\operatorname {lcm} (a,b)}}"},{"text":" , but more commonly the LCM is computed from the GCD."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":0,"queries":4,"sha256":"f5ed5151a205179cea94cb84cf62800b5058a032485166cdffe06b6b29658fcd"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-12354-1372179102::In-text #553aea9d","item":"In-text #553aea9d","kind":"theorem","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"Rat.den_divInt","end_line":238,"library":"lean-core","line":230,"location_key":"67217aeab93325b69f238fa393ae2a6d08dde44eba26851888c33e5f3d6ff2be","module":"Init.Data.Rat.Lemmas","note":"It computes the reduced denominator of a quotient of two integers, and that denominator is the reciprocal of the value Thomae's function takes there.","pair_key":"4b618dd37e0c92fceca8fa73ce797f90cd2cf98ae63115539b58a6e2113130a4","path":"src/Init/Data/Rat/Lemmas.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Rat.den_divInt (a b : Int) : (Rat.divInt a b).den = if b = 0 then 1 else b.natAbs / b.gcd a"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"26922d687f16e17eb5d74ecc50fdf9201bc7524f65f342adbcd78df495ff9cae","prominence":"central","quote":{"exact":"Using Thomae's function f, gcd ( a , b ) = a"},"quote_capped":true,"section":["Calculation","Other methods"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"Using Thomae's function f, gcd ( a , b ) = a f ( b a ) , {\\displaystyle \\gcd(a,b)=af\\left({\\frac {b}{a}}\\right),} which generalizes to a and b rational numbers or commensurable real numbers.","segments":[{"text":"Using Thomae's function f, "},{"tex":"\\gcd(a,b)=af\\left({\\frac {b}{a}}\\right),"},{"text":" which generalizes to a and b rational numbers or commensurable real numbers."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":0,"queries":4,"sha256":"ae6bff787db8be7d8ca39bb7da1cc30398d72bccd0cbbaa0648a4a187f185be6"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-12354-1372179102::In-text #cd974ef2","item":"In-text #cd974ef2","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"fec7bdc27a1d2302e1dd7600f72ba222a54f9cecb78094e2ad6d576a886447ff","prominence":"supporting","quote":{"exact":"Keith Slavin has shown that for odd a ≥ 1: gcd ("},"quote_capped":true,"section":["Calculation","Other methods"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"Keith Slavin has shown that for odd a ≥ 1: gcd ( a , b ) = log 2 ⁡ ∏ k = 0 a − 1 ( 1 + e − 2 i π k b / a ) {\\displaystyle \\gcd(a,b)=\\log _{2}\\prod _{k=0}^{a-1}(1+e^{-2i\\pi kb/a})} which is a function that can be evaluated for complex b.","segments":[{"text":"Keith Slavin has shown that for odd a ≥ 1: "},{"tex":"\\gcd(a,b)=\\log _{2}\\prod _{k=0}^{a-1}(1+e^{-2i\\pi kb/a})"},{"text":" which is a function that can be evaluated for complex b."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":1,"queries":4,"sha256":"261bd991cdf4360060e59df9581235dc2b028256f6041a3a8c3851db8ab565d4"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-12354-1372179102::In-text #fc0c98e0","item":"In-text #fc0c98e0","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"0717587bb7881988ca6713755de522a361186f2339d66cf5270ef65894e7e614","prominence":"supporting","quote":{"exact":"Wolfgang Schramm has shown that gcd ( a , b ) ="},"quote_capped":true,"section":["Calculation","Other methods"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"Wolfgang Schramm has shown that gcd ( a , b ) = ∑ k = 1 a exp ⁡ ( 2 π i k b / a ) ⋅ ∑ d | a c d ( k ) d {\\displaystyle \\gcd(a,b)=\\sum \\limits _{k=1}^{a}\\exp(2\\pi ikb/a)\\cdot \\sum \\limits _{d\\left|a\\right.}{\\frac {c_{d}(k)}{d}}} is an entire function in the variable b for all positive integers a where cd(k) is Ramanujan's sum.","segments":[{"text":"Wolfgang Schramm has shown that "},{"tex":"\\gcd(a,b)=\\sum \\limits _{k=1}^{a}\\exp(2\\pi ikb/a)\\cdot \\sum \\limits _{d\\left|a\\right.}{\\frac {c_{d}(k)}{d}}"},{"text":" is an entire function in the variable b for all positive integers a where cd(k) is Ramanujan's sum."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"8bbd63c2bf06a390830c858883a64bec8167f32a75553167838949d249fb7f74"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-12354-1372179102::In-text #2e25f541","item":"In-text #2e25f541","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"55a21cbcf0cc69ab77a999fab2ed03d764c5b33cf306e32fd6b3eed4c5cae59c","prominence":"central","quote":{"exact":"If one uses the Euclidean algorithm and the elementary algorithms for multiplication"},"quote_capped":true,"section":["Calculation","Complexity"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"after":{"layer":" This means that the computation of greatest common divisor has, up to a constant factor, the same complexity as the multiplication.","segments":[{"text":" This means that the computation of greatest common divisor has, up to a constant factor, the same complexity as the multiplication."}]},"layer":"If one uses the Euclidean algorithm and the elementary algorithms for multiplication and division, the computation of the greatest common divisor of two integers of at most n bits is O(n2).[citation needed]","segments":[{"text":"If one uses the Euclidean algorithm and the elementary algorithms for multiplication and division, the computation of the greatest common divisor of two integers of at most n bits is O(n2).[citation needed]"}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"f5ecb8d1f957eaa936d7197c013e9be7eb8f4abf3caa30632a4bd152664017fc"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-12354-1372179102::In-text #eb9c9d28","item":"In-text #eb9c9d28","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"bce8474bb4beedb9eea622d5dc3ae6be11325928346d35d7f5013b82482f3d9c","prominence":"supporting","quote":{"exact":"This means that the computation of greatest common divisor has, up to"},"quote_capped":true,"section":["Calculation","Complexity"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"before":{"layer":"If one uses the Euclidean algorithm and the elementary algorithms for multiplication and division, the computation of the greatest common divisor of two integers of at most n bits is O(n2).[citation needed] ","segments":[{"text":"If one uses the Euclidean algorithm and the elementary algorithms for multiplication and division, the computation of the greatest common divisor of two integers of at most n bits is O(n2).[citation needed] "}]},"layer":"This means that the computation of greatest common divisor has, up to a constant factor, the same complexity as the multiplication.","segments":[{"text":"This means that the computation of greatest common divisor has, up to a constant factor, the same complexity as the multiplication."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"c8ca4f144334211fb45c853dc6984d5beed819f260cd1cd685cdef1679fc94a9"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-12354-1372179102::In-text #b53eddb3","item":"In-text #b53eddb3","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"9847c46bb2a2c994b41ac595468e42d8186caa1bb017760f2530d276bbe3abf0","prominence":"central","quote":{"exact":"More precisely, if the multiplication of two integers of n bits takes"},"quote_capped":true,"section":["Calculation","Complexity"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"More precisely, if the multiplication of two integers of n bits takes a time of T(n), then the fastest known algorithm for greatest common divisor has a complexity O(T(n) log n).","segments":[{"text":"More precisely, if the multiplication of two integers of n bits takes a time of T(n), then the fastest known algorithm for greatest common divisor has a complexity O(T(n) log n)."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"514cf00e66754a98c6fa162324e06671b294748f18432b89ea450aadb7fa368e"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-12354-1372179102::In-text #b7138b2d","item":"In-text #b7138b2d","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"74eeaf57cbbd68295c48cd873570c84aea886ebacd71123a4927c24bb64bcd07","prominence":"supporting","quote":{"exact":"This implies that the fastest known algorithm has a complexity of O(n"},"quote_capped":true,"section":["Calculation","Complexity"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"This implies that the fastest known algorithm has a complexity of O(n (log n)2).","segments":[{"text":"This implies that the fastest known algorithm has a complexity of O(n (log n)2)."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"b80b7e381cb4b75a7a616e4667ba5c2d785a0f910650c5ec29f562144fc2c178"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-12354-1372179102::In-text #e1678d5a","item":"In-text #e1678d5a","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"89100a3bb81236098799a5632709d475eb7903c72a4fc678fda742f85078e005","prominence":"central","quote":{"exact":"The computation of the greatest common divisors belongs thus to the class"},"quote_capped":true,"section":["Calculation","Complexity"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"The computation of the greatest common divisors belongs thus to the class of problems solvable in quasilinear time.","segments":[{"text":"The computation of the greatest common divisors belongs thus to the class of problems solvable in quasilinear time."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"f152aba1a343b4677ba727b97b2922a5012b2ea130b09840841aed1d8036a56d"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-12354-1372179102::In-text #22764246","item":"In-text #22764246","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"6ba312821a34bbeb5110d7ac2429d7599aa7a8781fa40cf315696a3b85d06fb2","prominence":"supporting","quote":{"exact":"A fortiori, the corresponding decision problem belongs to the class P of"},"quote_capped":true,"section":["Calculation","Complexity"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"A fortiori, the corresponding decision problem belongs to the class P of problems solvable in polynomial time.","segments":[{"text":"A fortiori, the corresponding decision problem belongs to the class P of problems solvable in polynomial time."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"37d221d14568459bf7f722431e2059ddaa10ef60cffdbf3bfefcbb354bba90f8"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-12354-1372179102::In-text #062b455e","item":"In-text #062b455e","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"f7e31330767747f2c9b5d8d12b818e2c63d2172f79655c50a11ce34dd8a4e7a3","prominence":"supporting","quote":{"exact":"Shallcross et al. showed that a related problem (EUGCD, determining the remainder"},"quote_capped":true,"section":["Calculation","Complexity"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"after":{"layer":"; if either problem is in NC or is P-complete, the other is as well.","segments":[{"text":"; if either problem is in NC or is P-complete, the other is as well."}]},"layer":"Shallcross et al. showed that a related problem (EUGCD, determining the remainder sequence arising during the Euclidean algorithm) is NC-equivalent to the problem of integer linear programming with two variables","segments":[{"text":"Shallcross et al. showed that a related problem (EUGCD, determining the remainder sequence arising during the Euclidean algorithm) is NC-equivalent to the problem of integer linear programming with two variables"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"4b9e4a4b8b5a87dd783897c7e5486fd2e3172ad08b87f635d84c13dc34cb800d"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-12354-1372179102::In-text #2bcad7c7","item":"In-text #2bcad7c7","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"6fd1741d6fe3dc40c5fbc7a597724a770db711491e21422e8df7917342f2526b","prominence":"supporting","quote":{"exact":"if either problem is in NC or is P-complete, the other is"},"quote_capped":true,"section":["Calculation","Complexity"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"before":{"layer":"Shallcross et al. showed that a related problem (EUGCD, determining the remainder sequence arising during the Euclidean algorithm) is NC-equivalent to the problem of integer linear programming with two variables; ","segments":[{"text":"Shallcross et al. showed that a related problem (EUGCD, determining the remainder sequence arising during the Euclidean algorithm) is NC-equivalent to the problem of integer linear programming with two variables; "}]},"layer":"if either problem is in NC or is P-complete, the other is as well.[19]","segments":[{"text":"if either problem is in NC or is P-complete, the other is as well."},{"ref":"[19]"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":3,"queries":4,"sha256":"4a80b3c8d109cbd1f29cefedbe42b210ff12cb43a455c4e9f08dc777fab85e2f"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-12354-1372179102::In-text #6239e72f","item":"In-text #6239e72f","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"117d3f148e117489205db17b702bec78b69b39706906cdbc44bcf3ce7be96308","prominence":"supporting","quote":{"exact":"NC contains NL"},"quote_capped":false,"section":["Calculation","Complexity"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"after":{"layer":", it is also unknown whether a space-efficient algorithm for computing the GCD exists, even for nondeterministic Turing machines.","segments":[{"text":", it is also unknown whether a space-efficient algorithm for computing the GCD exists, even for nondeterministic Turing machines."}]},"before":{"layer":"Since ","segments":[{"text":"Since "}]},"layer":"NC contains NL","segments":[{"text":"NC contains NL"}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"52643404b9b59ef7b867dcca16737dc38cc3efc6040d0d43ace5befef3569553"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-12354-1372179102::In-text #cce0f65d","item":"In-text #cce0f65d","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"6862c80ca40b91bb29220a91724c1b2f14e99bc2d98fc6056ef26acb87003e24","prominence":"central","quote":{"exact":"Although the problem is not known to be in NC, parallel algorithms"},"quote_capped":true,"section":["Calculation","Complexity"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"after":{"layer":"; the fastest known deterministic algorithm is by Chor and Goldreich, which (in the CRCW-PRAM model) can solve the problem in O(n/log n) time with n1+ε processors.","segments":[{"text":"; the fastest known deterministic algorithm is by Chor and Goldreich, which (in the CRCW-PRAM model) can solve the problem in O(n/log n) time with n1+ε processors."}]},"layer":"Although the problem is not known to be in NC, parallel algorithms asymptotically faster than the Euclidean algorithm exist","segments":[{"text":"Although the problem is not known to be in NC, parallel algorithms asymptotically faster than the Euclidean algorithm exist"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"2bd9745b40876949ad65fecdc8248933daceac5bffc4a217ce01753de5aca0cf"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-12354-1372179102::In-text #56700f09","item":"In-text #56700f09","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"09c86b4922ec42fd047c952015abd624e575b9b3137965eaa3b212176ce97be0","prominence":"supporting","quote":{"exact":"the fastest known deterministic algorithm is by Chor and Goldreich, which (in"},"quote_capped":true,"section":["Calculation","Complexity"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"before":{"layer":"Although the problem is not known to be in NC, parallel algorithms asymptotically faster than the Euclidean algorithm exist; ","segments":[{"text":"Although the problem is not known to be in NC, parallel algorithms asymptotically faster than the Euclidean algorithm exist; "}]},"layer":"the fastest known deterministic algorithm is by Chor and Goldreich, which (in the CRCW-PRAM model) can solve the problem in O(n/log n) time with n1+ε processors.[20]","segments":[{"text":"the fastest known deterministic algorithm is by Chor and Goldreich, which (in the CRCW-PRAM model) can solve the problem in O(n/log n) time with n1+ε processors."},{"ref":"[20]"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"ab2f4f1576e0f165457fe3f095732003171b166780669b34a57d8c9f2f31ca8a"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-12354-1372179102::In-text #bc4603c9","item":"In-text #bc4603c9","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"a8e2d1b1d0f7f667c4d539dead20a14aeccde83dbf37a88180d735c31f963779","prominence":"supporting","quote":{"exact":"Randomized algorithms can solve the problem in O((log n)2) time on O"},"quote_capped":true,"section":["Calculation","Complexity"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"Randomized algorithms can solve the problem in O((log n)2) time on O ( e n log ⁡ n ) {\\displaystyle O\\left(e^{\\sqrt {n\\log n}}\\right)} processors (this is superpolynomial).","segments":[{"text":"Randomized algorithms can solve the problem in O((log n)2) time on "},{"tex":"O\\left(e^{\\sqrt {n\\log n}}\\right)"},{"text":" processors (this is superpolynomial)."}]},"unresolved":null},{"absence":null,"basis":"361bbd36ed381fe04aea11f15712986e3ad148c1ecf52881eb7c712f6d7e4481","coverage":null,"id":"enwiki-12354-1372179102::In-text #c05d792b","item":"In-text #c05d792b","kind":"theorem","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Int.gcd_self","end_line":67,"library":"lean-core","line":67,"location_key":"361bbd36ed381fe04aea11f15712986e3ad148c1ecf52881eb7c712f6d7e4481","module":"Init.Data.Int.Gcd","note":"Lean's Int.gcd takes values in ℕ and writes the answer as natAbs, the natural-number absolute value; the lemma is stated for every integer, not only the positive ones the passage names.","pair_key":"8c19d67b9ee9bfe365f809079baea26cc707226bfafa508a768db27d3314f0a6","path":"src/Init/Data/Int/Gcd.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Int.gcd_self {a : Int} : a.gcd a = a.natAbs"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Nat.gcd_self","end_line":71,"library":"lean-core","line":70,"location_key":"d6cff101114cd9d6472e03e894e4fc8f9a72486c30ad2d7e0b35ff040359223c","module":"Init.Data.Nat.Gcd","note":"The binder here is ℕ rather than ℤ, so the lemma speaks of natural numbers; the passage quantifies only over positive integers, which are exactly the nonzero naturals under the usual inclusion, and Nat.gcd agrees there with the article's gcd, so the passage is fully stated.","pair_key":"8e987f3112bbfd1ca3a1c4cbc039cc0b7219c47baacb318c7d3fec56776799e8","path":"src/Init/Data/Nat/Gcd.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Nat.gcd_self (n : Nat) : n.gcd n = n"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"2f95f0de8211b90bb314132d6872e777fa2de0b1180ebe24b8509840c542a729","prominence":"central","quote":{"exact":"For every positive integer a, gcd(a, a) = a."},"quote_capped":false,"section":["Properties"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"For every positive integer a, gcd(a, a) = a.","segments":[{"text":"For every positive integer a, gcd(a, a) = a."}]},"unresolved":null},{"absence":null,"basis":"3d64ee78300b7b18049982600125022a4e1e369b65033cef61773e3f9b122467","coverage":null,"id":"enwiki-12354-1372179102::In-text #a176aba6","item":"In-text #a176aba6","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"dvd_gcd_iff","end_line":387,"library":"mathlib","line":385,"location_key":"3d64ee78300b7b18049982600125022a4e1e369b65033cef61773e3f9b122467","module":"Mathlib.Algebra.GCDMonoid.Basic","note":"Mathlib proves the two-way version, so divisibility of the gcd is characterised rather than merely implied, and it does so for any gcd monoid rather than for ℤ alone.","pair_key":"0718a6abbf5705258054fb0a4f7f7b9d18a39ee4812298b48ab995598154d9e3","path":"Mathlib/Algebra/GCDMonoid/Basic.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem dvd_gcd_iff {α : Type*} [CommMonoidWithZero α] [GCDMonoid α] (a b c : α) : a ∣ GCDMonoid.gcd b c ↔ a ∣ b ∧ a ∣ c"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Int.dvd_gcd","end_line":94,"library":"lean-core","line":93,"location_key":"fc8a6bb8b2c81755da19ce24f969d07b7e1cee625df85df27a2ccf834840e1eb","module":"Init.Data.Int.Gcd","note":"The divisor slot is ℕ rather than ℤ, so the statement covers the nonnegative common divisors only; reaching a negative divisor needs Int.natAbs_dvd on top of it.","pair_key":"77e67efc67abe5419144a4712f6499b2583b7648164600a8ed41c1457144a503","path":"src/Init/Data/Int/Gcd.lean","proof_status":"proved","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Int.dvd_gcd {a b : Int} {c : Nat} : ↑c ∣ a → ↑c ∣ b → c ∣ a.gcd b"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"Nat.dvd_gcd","end_line":103,"library":"lean-core","line":100,"location_key":"6aeb2f57d4ce51003607dd22c019855b9b145ba1adc25d7ea4e7d0853db81a22","module":"Init.Data.Nat.Gcd","note":"Every binder is ℕ, so this is the article's property restricted to natural numbers, where the passage ranges over integers.","pair_key":"85fdb73d71a90829f1535de1a9300dfb2a97882eec223b3a9123aa90197ed7ab","path":"src/Init/Data/Nat/Gcd.lean","proof_status":"proved","rank":3,"relation":"narrowMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Nat.dvd_gcd {k m n : Nat} : k ∣ m → k ∣ n → k ∣ m.gcd n"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"47ba4709db128cac027ecda1f16b5a539c40ed4fc78bcd5b277804838357fe90","prominence":"central","quote":{"exact":"Every common divisor of a and b is a divisor of gcd(a,"},"quote_capped":true,"section":["Properties"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"Every common divisor of a and b is a divisor of gcd(a, b).","segments":[{"text":"Every common divisor of a and b is a divisor of gcd(a, b)."}]},"unresolved":null},{"absence":null,"basis":"35e133f5ad54e4c3e6bafa2923fa2e7481b5a60e90da264c86a3aa461d243bcf","coverage":null,"id":"enwiki-12354-1372179102::In-text #d0c65162","item":"In-text #d0c65162","kind":"theorem","locations":[{"challenge":"downgraded","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Int.gcd_least_linear","end_line":255,"library":"mathlib","line":249,"location_key":"35e133f5ad54e4c3e6bafa2923fa2e7481b5a60e90da264c86a3aa461d243bcf","module":"Mathlib.Data.Int.GCD","note":"Mathlib writes the candidate set over ℕ, with positivity as 0 < n and Int.gcd returning a natural number, while the coefficients x and y stay in ℤ; the article's docstring-level reading and this one agree once that ℕ-valued packaging is unwound.","pair_key":"1df57e4e1762dcd8cd4cb419a8ce275cc6190c15d0c7cf83f3f73bef3ac4cc75","path":"Mathlib/Data/Int/GCD.lean","proof_status":"proved","rank":1,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Int.gcd_least_linear {a b : ℤ} : a ≠ 0 → IsLeast {n | 0 < n ∧ ∃ x y, ↑n = a * x + b * y} (a.gcd b)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"38aff9b5a89ff733078ccc6305911704afc3ca90c531304a031e7a621cc45905","prominence":"central","quote":{"exact":"gcd(a, b), where a and b are not both zero, may be"},"quote_capped":true,"section":["Properties"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"gcd(a, b), where a and b are not both zero, may be defined alternatively and equivalently as the smallest positive integer d which can be written in the form d = a⋅p + b⋅q, where p and q are integers.","segments":[{"text":"gcd(a, b), where a and b are not both zero, may be defined alternatively and equivalently as the smallest positive integer d which can be written in the form d = a⋅p + b⋅q, where p and q are integers."}]},"unresolved":null},{"absence":null,"basis":"49ba3b0ef9a7b9fc45d809c239cfbf938c529c5731c00b10b297fbba2f296a4a","coverage":null,"id":"enwiki-12354-1372179102::In-text #970b546d","item":"In-text #970b546d","kind":"theorem","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Int.gcd_zero_right","end_line":65,"library":"lean-core","line":65,"location_key":"49ba3b0ef9a7b9fc45d809c239cfbf938c529c5731c00b10b297fbba2f296a4a","module":"Init.Data.Int.Gcd","note":"Lean's Int.gcd is ℕ-valued and the right-hand side is natAbs, the natural-number absolute value; the lemma drops the article's restriction to nonzero a and keeps the equation at a = 0 as well.","pair_key":"9278aea372328a38b820344907cb2ab920f2bf195e372cd00260927229ef8f9f","path":"src/Init/Data/Int/Gcd.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Int.gcd_zero_right (a : Int) : a.gcd 0 = a.natAbs"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"Nat.gcd_zero_right","end_line":65,"library":"lean-core","line":59,"location_key":"957813f25d7609531d83eb5010e1b68800fbcc1929aabc2a820046e5bb06609a","module":"Init.Data.Nat.Gcd","note":"The binder is ℕ, so negative a is outside its reach altogether, and the absolute value on the right collapses to the argument.","pair_key":"f680610ff5071ac4aa82e3dda403d88b971f080bcdc07e4010cca58f4097912f","path":"src/Init/Data/Nat/Gcd.lean","proof_status":"proved","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Nat.gcd_zero_right (n : Nat) : n.gcd 0 = n"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"5085ae62a241b24ee0035221004b73ee4ce54738ef763295dfccc5782d753daa","prominence":"central","quote":{"exact":"gcd(a, 0) = |a|, for a ≠ 0"},"quote_capped":false,"section":["Properties"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"after":{"layer":", since any number is a divisor of 0, and the greatest divisor of a is |a|.","segments":[{"text":", since any number is a divisor of 0, and the greatest divisor of a is |a|."}]},"layer":"gcd(a, 0) = |a|, for a ≠ 0","segments":[{"text":"gcd(a, 0) = |a|, for a ≠ 0"}]},"unresolved":null},{"absence":null,"basis":"c2d2063d47057c8efb65acf9bf11c5c10afbadb12b2b0aafe9c3e50bf1f63658","coverage":null,"id":"enwiki-12354-1372179102::In-text #49ab9d04","item":"In-text #49ab9d04","kind":"theorem","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Int.dvd_zero","end_line":31,"library":"lean-core","line":31,"location_key":"c2d2063d47057c8efb65acf9bf11c5c10afbadb12b2b0aafe9c3e50bf1f63658","module":"Init.Data.Int.DivMod.Bootstrap","note":"Both the passage and this declaration quantify over all of the integers.","pair_key":"5cd05b8a5ae2de3df49273de94acea9ff32229bf37e887aad1e9b46ec7c0f539","path":"src/Init/Data/Int/DivMod/Bootstrap.lean","proof_status":"proved","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Int.dvd_zero (n : Int) : n ∣ 0"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"dvd_zero","end_line":44,"library":"mathlib","line":43,"location_key":"eed2e21becdfcfbef62a5ec042bb71d9e348df3799aa4ae9ad20914980219f20","module":"Mathlib.Algebra.GroupWithZero.Divisibility","note":"It is stated for any semigroup with a zero element, the integers being one such.","pair_key":"1b2426290740bdcd2e09fd0b6edb5a44698ab9acb187deadd89db7ace94c6272","path":"Mathlib/Algebra/GroupWithZero/Divisibility.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem dvd_zero {α : Type*} [SemigroupWithZero α] (a : α) : a ∣ 0"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"25883d8bd35ef2c24cdbfdd7c1bc0323a8dab6486fb72f13e7a1386d0817d296","prominence":"supporting","quote":{"exact":"any number is a divisor of 0"},"quote_capped":false,"section":["Properties"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"after":{"layer":", and the greatest divisor of a is |a|.","segments":[{"text":", and the greatest divisor of a is |a|."}]},"before":{"layer":"gcd(a, 0) = |a|, for a ≠ 0, since ","segments":[{"text":"gcd(a, 0) = |a|, for a ≠ 0, since "}]},"layer":"any number is a divisor of 0","segments":[{"text":"any number is a divisor of 0"}]},"unresolved":null},{"absence":null,"basis":"75d8e1cd03f6efc8dfb007d4b2eb6a413e0d201822baf4034fe2fff9c4d52f1c","coverage":null,"id":"enwiki-12354-1372179102::In-text #e9220589","item":"In-text #e9220589","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Int.natAbs_dvd_self","end_line":98,"library":"lean-core","line":96,"location_key":"75d8e1cd03f6efc8dfb007d4b2eb6a413e0d201822baf4034fe2fff9c4d52f1c","module":"Init.Data.Int.DivMod.Lemmas","note":"Lean writes the absolute value as the cast of natAbs back to the integers.","pair_key":"a3c0eecf0f35d230739a04e0ea9774a05833323bf6e02a679cef23a84c479d6f","path":"src/Init/Data/Int/DivMod/Lemmas.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Int.natAbs_dvd_self {a : Int} : ↑a.natAbs ∣ a"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Int.le_abs_of_dvd","end_line":283,"library":"mathlib","line":282,"location_key":"f599a02de555e6bb4b662b3aef4be0b50d7d7d0991cf647baab1100691c748d5","module":"Mathlib.Algebra.Order.Ring.Abs","note":"It bounds each divisor of a nonzero integer by that integer's absolute value.","pair_key":"10fd3dca45905429656f9d0e1342042909174e6e5dd9d3e704ebc16e1438e611","path":"Mathlib/Algebra/Order/Ring/Abs.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Int.le_abs_of_dvd {a b : ℤ} : b ≠ 0 → a ∣ b → a ≤ |b|"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"72fce678d318e9c7c366b73a421887a3304034905309fd9187c97616ff733a8a","prominence":"supporting","quote":{"exact":"the greatest divisor of a is |a|.[2][5]"},"quote_capped":false,"section":["Properties"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"before":{"layer":"gcd(a, 0) = |a|, for a ≠ 0, since any number is a divisor of 0, and ","segments":[{"text":"gcd(a, 0) = |a|, for a ≠ 0, since any number is a divisor of 0, and "}]},"layer":"the greatest divisor of a is |a|.[2][5]","segments":[{"text":"the greatest divisor of a is |a|."},{"ref":"[2][5]"}]},"unresolved":null},{"absence":null,"basis":"88c281d4121291be5be171b9e12f1ec9a75cf44c1ed8f667c451afde4acb62e8","coverage":null,"id":"enwiki-12354-1372179102::In-text #d921f0f4","item":"In-text #d921f0f4","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Int.dvd_of_dvd_mul_right_of_gcd_one","end_line":245,"library":"mathlib","line":242,"location_key":"88c281d4121291be5be171b9e12f1ec9a75cf44c1ed8f667c451afde4acb62e8","module":"Mathlib.Data.Int.GCD","note":"Euclid's lemma, which is the passage read at d equal to one, where the quotient a/d is a itself.","pair_key":"6727d53c694f21df772260dfb3acfc6f0aed299bf2df5cc90d2aa31354883a29","path":"Mathlib/Data/Int/GCD.lean","proof_status":"proved","rank":1,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Int.dvd_of_dvd_mul_right_of_gcd_one {a b c : ℤ} : a ∣ b * c → a.gcd b = 1 → a ∣ c"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"IsCoprime.dvd_of_dvd_mul_left","end_line":106,"library":"mathlib","line":103,"location_key":"c22fe8fac7673ba4ea54a4ea2d2128af6090664c0661a50c0e36f79c9c69ef76","module":"Mathlib.RingTheory.Coprime.Basic","note":"Coprimality here is Mathlib's IsCoprime, which over the integers amounts to the gcd being one.","pair_key":"dd30849d6c8060b7980c7ddd18e06884e0dfb4bb6a208a9206b4f183b59e0bbb","path":"Mathlib/RingTheory/Coprime/Basic.lean","proof_status":"proved","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem IsCoprime.dvd_of_dvd_mul_left {R : Type u} [CommSemiring R] {x y z : R} : IsCoprime x y → x ∣ y * z → x ∣ z"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"dd0ffaeeee43c0e221f850ff9ec5406f2416a47dd7c768696f3aa8450b34c9b1","prominence":"central","quote":{"exact":"If a divides the product b⋅c, and gcd(a, b) = d, then"},"quote_capped":true,"section":["Properties"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"If a divides the product b⋅c, and gcd(a, b) = d, then a/d divides c.","segments":[{"text":"If a divides the product b⋅c, and gcd(a, b) = d, then a/d divides c."}]},"unresolved":null},{"absence":null,"basis":"7418d20f0d26ba9ff299e6f159b7502bf77d940db985f6387234eef0a6b1dc07","coverage":null,"id":"enwiki-12354-1372179102::In-text #c6153d8c","item":"In-text #c6153d8c","kind":"theorem","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Int.gcd_mul_left","end_line":123,"library":"lean-core","line":122,"location_key":"7418d20f0d26ba9ff299e6f159b7502bf77d940db985f6387234eef0a6b1dc07","module":"Init.Data.Int.Gcd","note":"It is stated for every integer multiplier, carrying the multiplier's absolute value on the right-hand side.","pair_key":"207580f05ddd99a43bc995a7eedb9749aae2abd024b149815bfc201528fcccb8","path":"src/Init/Data/Int/Gcd.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Int.gcd_mul_left (m n k : Int) : (m * n).gcd (m * k) = m.natAbs * n.gcd k"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"gcd_mul_left","end_line":501,"library":"mathlib","line":490,"location_key":"8a6ec9f61ade0ba371513e277c0410659b6b9b7104dcda314321eccbaf11fdaf","module":"Mathlib.Algebra.GCDMonoid.Basic","note":"Stated over any such monoid, with normalize of the multiplier in place of the multiplier.","pair_key":"fa61375899d69c3bbc57913dfeadf1370262b67ca700eec6c4fef9322582d11b","path":"Mathlib/Algebra/GCDMonoid/Basic.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem gcd_mul_left {α : Type*} [CommMonoidWithZero α] [StrongNormalizedGCDMonoid α] (a b c : α) : GCDMonoid.gcd (a * b) (a * c) = normalize a * GCDMonoid.gcd b c"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Nat.gcd_mul_left","end_line":142,"library":"lean-core","line":139,"location_key":"f40517bf573811f931fe01ba19f18781bae520d600e6e18de805c0d7b473fefb","module":"Init.Data.Nat.Gcd","note":"Its binders are ℕ, so it reaches only the nonnegative instances of the passage; the multiplier zero makes both sides vanish.","pair_key":"0c4ee9b58dd57768061eaef26209913305d8f8732b4729c5d0bf489f4e964f79","path":"src/Init/Data/Nat/Gcd.lean","proof_status":"proved","rank":3,"relation":"narrowMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Nat.gcd_mul_left (m n k : Nat) : (m * n).gcd (m * k) = m * n.gcd k"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"4de5746d606ecfd40a100b06575427cc492cbb102d009e9361251a47143f647a","prominence":"central","quote":{"exact":"If m is a positive integer, then gcd(m⋅a, m⋅b) = m⋅gcd(a, b)."},"quote_capped":false,"section":["Properties"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"If m is a positive integer, then gcd(m⋅a, m⋅b) = m⋅gcd(a, b).","segments":[{"text":"If m is a positive integer, then gcd(m⋅a, m⋅b) = m⋅gcd(a, b)."}]},"unresolved":null},{"absence":null,"basis":"8c839a35ebd4d8950a22e5399091a9b089fc4844cd5f46d07e7260dec22ca131","coverage":null,"id":"enwiki-12354-1372179102::In-text #5363ed8d","item":"In-text #5363ed8d","kind":"theorem","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Int.gcd_add_mul_right_left","end_line":244,"library":"lean-core","line":243,"location_key":"8c839a35ebd4d8950a22e5399091a9b089fc4844cd5f46d07e7260dec22ca131","module":"Init.Data.Int.Gcd","note":"Its multiplier ranges over all of the integers, exactly as the passage's m does.","pair_key":"a81379e61cd1efb53eaefb6c93e151b3d29fd81beed5f4e142c2477319aaf324","path":"src/Init/Data/Int/Gcd.lean","proof_status":"proved","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Int.gcd_add_mul_right_left (m n k : Int) : (n + k * m).gcd m = n.gcd m"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Nat.gcd_add_mul_right_left","end_line":252,"library":"lean-core","line":251,"location_key":"c51c91dc919052f6109901470f03c8b088a5150b95edbfb6a08580de89045d7c","module":"Init.Data.Nat.Gcd","note":"Its binders are ℕ, so it covers the nonnegative instances of the passage only.","pair_key":"bc7d4bc4eec8629404d5986e28f7f0013809f7eccca5a7cd297daa9e61fa52a8","path":"src/Init/Data/Nat/Gcd.lean","proof_status":"proved","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Nat.gcd_add_mul_right_left (m n k : Nat) : (n + k * m).gcd m = n.gcd m"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"686b661885cbe1d8f2fc72f997874f8e42ff1375b855926ca7f5ede27ebeedd8","prominence":"central","quote":{"exact":"If m is any integer, then gcd(a + m⋅b, b) = gcd(a,"},"quote_capped":true,"section":["Properties"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"If m is any integer, then gcd(a + m⋅b, b) = gcd(a, b).","segments":[{"text":"If m is any integer, then gcd(a + m⋅b, b) = gcd(a, b)."}]},"unresolved":null},{"absence":null,"basis":"ecde7f32a6b654a89f84c1b680805dcede1bc941755a0eaa711ef5683da10363","coverage":null,"id":"enwiki-12354-1372179102::In-text #206424a7","item":"In-text #206424a7","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Int.gcd_emod","end_line":90,"library":"mathlib","line":89,"location_key":"ecde7f32a6b654a89f84c1b680805dcede1bc941755a0eaa711ef5683da10363","module":"Mathlib.Data.Int.Basic","note":"Here % is Lean's remainder on the integers, which is the operation the passage writes as mod.","pair_key":"3051e0687fb04bfd0e37b83449234fe0764d89db187dc20d3e0771e173674cb5","path":"Mathlib/Data/Int/Basic.lean","proof_status":"proved","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Int.gcd_emod (m n : ℤ) : (m % n).gcd n = m.gcd n"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"d1409060e3ec27ef53ae141534ee00e57d2a13e57ef5f428e64a39635acad27d","prominence":"central","quote":{"exact":"Equivalently, gcd(a mod b,b) = gcd(a,b)."},"quote_capped":false,"section":["Properties"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"Equivalently, gcd(a mod b,b) = gcd(a,b).","segments":[{"text":"Equivalently, gcd(a mod b,b) = gcd(a,b)."}]},"unresolved":null},{"absence":null,"basis":"05b4299c4997f176dcc1b42c34cae6f2070e85852c6ba4113f6a93f0df804833","coverage":null,"id":"enwiki-12354-1372179102::In-text #f1200b95","item":"In-text #f1200b95","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Int.gcd_div","end_line":186,"library":"mathlib","line":186,"location_key":"05b4299c4997f176dcc1b42c34cae6f2070e85852c6ba4113f6a93f0df804833","module":"Mathlib.Data.Int.GCD","note":"Stated for any common divisor, negative ones included, with the divisor's absolute value on the right.","pair_key":"f33b21ac43755f47a0fcbe064f483657c8708172bb5a0bff6fd86ec4335db43a","path":"Mathlib/Data/Int/GCD.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Int.gcd_div {a b c : ℤ} : c ∣ a → c ∣ b → (a / c).gcd (b / c) = a.gcd b / c.natAbs"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Nat.gcd_div","end_line":179,"library":"lean-core","line":172,"location_key":"8abba694f5ba2d88e775e7fd7f709149dd875b5ba6f94fb640fc382b416e95c9","module":"Init.Data.Nat.Gcd","note":"Its binders are ℕ, so it reaches the nonnegative instances of the passage; the divisor zero forces both arguments to vanish.","pair_key":"10eb02cbb299afb5054f1f3c4a7fa49c37b10275caeb2460b55e46c7adaaf3b3","path":"src/Init/Data/Nat/Gcd.lean","proof_status":"proved","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Nat.gcd_div {m n k : Nat} : k ∣ m → k ∣ n → (m / k).gcd (n / k) = m.gcd n / k"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"22cd3a06cf8cfd4cac75bf9eb57493f4c45cca29907089c112fb1c7162310cf2","prominence":"central","quote":{"exact":"If m is a positive common divisor of a and b, then"},"quote_capped":true,"section":["Properties"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"If m is a positive common divisor of a and b, then gcd(a/m, b/m) = gcd(a, b)/m.","segments":[{"text":"If m is a positive common divisor of a and b, then gcd(a/m, b/m) = gcd(a, b)/m."}]},"unresolved":null},{"absence":null,"basis":"c2a3ae9b3c3234c099ef7150d22f25a07473e9709f073dd25a861900e79e1654","coverage":null,"id":"enwiki-12354-1372179102::In-text #9b02c707","item":"In-text #9b02c707","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Int.gcd_div_gcd_div_gcd","end_line":187,"library":"mathlib","line":187,"location_key":"c2a3ae9b3c3234c099ef7150d22f25a07473e9709f073dd25a861900e79e1654","module":"Mathlib.Data.Int.GCD","note":"Lean's integer gcd takes its values in ℕ and is cast back to the integers for the two divisions, and the conclusion is an equation of natural numbers.","pair_key":"3257fdb5263372b25c1b4ef01faaa555ec541f65b81eb0b4e1d42eaf481afa28","path":"Mathlib/Data/Int/GCD.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Int.gcd_div_gcd_div_gcd {i j : ℤ} : 0 < i.gcd j → (i / ↑(i.gcd j)).gcd (j / ↑(i.gcd j)) = 1"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"isCoprime_div_gcd_div_gcd_of_gcd_ne_zero","end_line":62,"library":"mathlib","line":57,"location_key":"0fac0618978c4d4923e3384266e7bf148320ec774e9694e9b3b0ac7d3b3b93dd","module":"Mathlib.RingTheory.EuclideanDomain","note":"Stated over any Euclidean domain with a gcd, and phrased with Mathlib's IsCoprime, which over the integers means the gcd is one.","pair_key":"3abf101333679061c00b6aecb1314494690b6a19775a67c7f70fa4e7c20093dc","path":"Mathlib/RingTheory/EuclideanDomain.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem isCoprime_div_gcd_div_gcd_of_gcd_ne_zero {R : Type*} [EuclideanDomain R] [GCDMonoid R] {p q : R} : GCDMonoid.gcd p q ≠ 0 → IsCoprime (p / GCDMonoid.gcd p q) (q / GCDMonoid.gcd p q)"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Nat.coprime_div_gcd_div_gcd","end_line":65,"library":"lean-core","line":63,"location_key":"29f4ff4ffd1c4099bea0d69526c9e6ce0f87c6c84224ad95cadca0b5b3b2c134","module":"Init.Data.Nat.Coprime","note":"Its binders are ℕ, so it reaches the nonnegative instances of the passage; Nat.Coprime is by definition the gcd being one.","pair_key":"6130d36e3acf1467286d7886e57cc1b1c0c9f25972a9e5e82740f96ea4885bef","path":"src/Init/Data/Nat/Coprime.lean","proof_status":"proved","rank":3,"relation":"narrowMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Nat.coprime_div_gcd_div_gcd {m n : Nat} : 0 < m.gcd n → (m / m.gcd n).Coprime (n / m.gcd n)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"7b0181b4978ee83836f184b6a483dd69b539203b84d5ee4758398e6b6af409a7","prominence":"central","quote":{"exact":"If gcd(a, b) = d, then gcd(a/d, b/d) = 1."},"quote_capped":false,"section":["Properties"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"If gcd(a, b) = d, then gcd(a/d, b/d) = 1.","segments":[{"text":"If gcd(a, b) = d, then gcd(a/d, b/d) = 1."}]},"unresolved":null},{"absence":null,"basis":"9e6942af1ee2d48c3d2bfa48efe3e4137d92b139ccd910d6b06a8c76e2027540","coverage":null,"id":"enwiki-12354-1372179102::In-text #819bd91b","item":"In-text #819bd91b","kind":"theorem","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Int.gcd_comm","end_line":103,"library":"lean-core","line":103,"location_key":"9e6942af1ee2d48c3d2bfa48efe3e4137d92b139ccd910d6b06a8c76e2027540","module":"Init.Data.Int.Gcd","note":"Lean's gcd of two integers is the natural number the article calls the greatest common divisor, and at the pair of zeros it returns zero, the value the article also adopts there.","pair_key":"58d52d035b58aac8ba874e0e9be6a50b9cb56830f2edb9add593195e2ccc99f2","path":"src/Init/Data/Int/Gcd.lean","proof_status":"proved","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Int.gcd_comm (a b : Int) : a.gcd b = b.gcd a"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"gcd_comm","end_line":392,"library":"mathlib","line":389,"location_key":"843362ce4a3f907323fabc023b2837700770d99bfed197cad4a8427b861e4b9e","module":"Mathlib.Algebra.GCDMonoid.Basic","note":"Stated for every carrier with a normalized gcd operation, the integers being one such carrier.","pair_key":"219ab06424b8fdc3b364c117957a1068a146035b117913ed07c270f459644bf2","path":"Mathlib/Algebra/GCDMonoid/Basic.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem gcd_comm {α : Type*} [CommMonoidWithZero α] [NormalizedGCDMonoid α] (a b : α) : GCDMonoid.gcd a b = GCDMonoid.gcd b a"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Nat.gcd_comm","end_line":112,"library":"lean-core","line":109,"location_key":"9ac30fde77d02e832e3393553d2c88df5ace0c60635abaf9e91de14f109eb702","module":"Init.Data.Nat.Gcd","note":"Its two binders are natural numbers, so it covers the swap identity only for nonnegative arguments.","pair_key":"7db6fd79fe80d57006121e49373d4e506d059311302201a5181ccd40d28ba9d9","path":"src/Init/Data/Nat/Gcd.lean","proof_status":"proved","rank":3,"relation":"narrowMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Nat.gcd_comm (m n : Nat) : m.gcd n = n.gcd m"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"5df60226e229b6c47aa2e91e3d52983ea99e4e71440de357372fe2cfd0f6c1d2","prominence":"central","quote":{"exact":"The GCD is a commutative function: gcd(a, b) = gcd(b, a)."},"quote_capped":false,"section":["Properties"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"The GCD is a commutative function: gcd(a, b) = gcd(b, a).","segments":[{"text":"The GCD is a commutative function: gcd(a, b) = gcd(b, a)."}]},"unresolved":null},{"absence":null,"basis":"1107dcfb757e6102f5bd36e7ade3742df83000e6c2929410d04e09d80de6ee6c","coverage":null,"id":"enwiki-12354-1372179102::In-text #79593f32","item":"In-text #79593f32","kind":"theorem","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Int.gcd_assoc","end_line":118,"library":"lean-core","line":118,"location_key":"1107dcfb757e6102f5bd36e7ade3742df83000e6c2929410d04e09d80de6ee6c","module":"Init.Data.Int.Gcd","note":"Lean's gcd of two integers is a natural number, so the declaration casts the inner gcd back into the integers before taking the outer one, and both sides name the two nested gcds of the passage's identity.","pair_key":"638d41fb06fdaf790984d8e3c8b32e08f61cdb5c6b3937e205ff8899629d9fb5","path":"src/Init/Data/Int/Gcd.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Int.gcd_assoc (a b c : Int) : (↑(a.gcd b)).gcd c = a.gcd ↑(b.gcd c)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"gcd_assoc","end_line":404,"library":"mathlib","line":398,"location_key":"a611d55e0695641603b546531e92525b99a9b159cbec7f341135ef4f62d033e8","module":"Mathlib.Algebra.GCDMonoid.Basic","note":"Stated for every carrier with a normalized gcd operation, with the integers as one instance of that structure.","pair_key":"0ea7a1c505e4ab18b00743fa111c8be448e33b1dc0dd13c27ebd672db7d826ba","path":"Mathlib/Algebra/GCDMonoid/Basic.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem gcd_assoc {α : Type*} [CommMonoidWithZero α] [NormalizedGCDMonoid α] (m n k : α) : GCDMonoid.gcd (GCDMonoid.gcd m n) k = GCDMonoid.gcd m (GCDMonoid.gcd n k)"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Nat.gcd_assoc","end_line":131,"library":"lean-core","line":122,"location_key":"dbf12f6e19b846b718a02155e7b772243ed30dc46bc13a46b04c667830d2ef2c","module":"Init.Data.Nat.Gcd","note":"Its three binders are natural numbers, so it covers the identity only for nonnegative arguments.","pair_key":"9b3bfc7dd187f1c9cc5ba4e8f7d3543fa0977f2e80ab7a2af14b0a35afb84371","path":"src/Init/Data/Nat/Gcd.lean","proof_status":"proved","rank":3,"relation":"narrowMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Nat.gcd_assoc (m n k : Nat) : (m.gcd n).gcd k = m.gcd (n.gcd k)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"b6c5b22fc475c8e69c047da29403b191c426e64fa3ed1ab29502070dc2ec7577","prominence":"central","quote":{"exact":"The GCD is an associative function: gcd(a, gcd(b, c)) = gcd(gcd(a, b),"},"quote_capped":true,"section":["Properties"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"The GCD is an associative function: gcd(a, gcd(b, c)) = gcd(gcd(a, b), c).","segments":[{"text":"The GCD is an associative function: gcd(a, gcd(b, c)) = gcd(gcd(a, b), c)."}]},"unresolved":null},{"absence":null,"basis":"5100ac4e09b462889f35521783776a786a02207390831adb8928aa22a0ba0e12","coverage":null,"id":"enwiki-12354-1372179102::In-text #09f67183","item":"In-text #09f67183","kind":"notation","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Finset.gcd","end_line":125,"library":"mathlib","line":124,"location_key":"5100ac4e09b462889f35521783776a786a02207390831adb8928aa22a0ba0e12","module":"Mathlib.Algebra.GCDMonoid.Finset","note":"The declaration defines the gcd of a finite indexed family over any carrier with a normalized gcd, where the passage writes the gcd of several integers; a Mathlib statement such as isCoprime_of_gcd_eq_one_of_FLT uses it in exactly that way for three integers.","pair_key":"f3ad1358d927aa481101913f8665f065fd2f58f2e98f3af8715940c7361077ee","path":"Mathlib/Algebra/GCDMonoid/Finset.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Finset.gcd {α : Type*} {β : Type*} [CommMonoidWithZero α] [NormalizedGCDMonoid α] : Finset β → (β → α) → α"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Multiset.gcd","end_line":120,"library":"mathlib","line":119,"location_key":"0adbf2a3fc4faba3e74eca177cbe5346ef63ba524adb0476192eb22e082127d7","module":"Mathlib.Algebra.GCDMonoid.Multiset","note":"It defines the gcd of a finite collection of elements of any carrier with a normalized gcd, which at the integers is the many-argument gcd the passage's notation denotes.","pair_key":"2547711a6a214ba0ddab9696a476f0ef049f3b54b1085d6761fd97cccb9b7972","path":"Mathlib/Algebra/GCDMonoid/Multiset.lean","proof_status":"definition","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Multiset.gcd {α : Type*} [CommMonoidWithZero α] [NormalizedGCDMonoid α] : Multiset α → α"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"68cc4b36d9c44c16e02152127e7c74761bcb92a242be2de5194d6e18173f9df0","prominence":"supporting","quote":{"exact":"Thus gcd(a, b, c, ...) can be used to denote the GCD"},"quote_capped":true,"section":["Properties"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"Thus gcd(a, b, c, ...) can be used to denote the GCD of multiple arguments.","segments":[{"text":"Thus gcd(a, b, c, ...) can be used to denote the GCD of multiple arguments."}]},"unresolved":null},{"absence":null,"basis":"88859ed38559496f9cfe7452cfb1efbda2affcecca16f88052712207e0a51942","coverage":null,"id":"enwiki-12354-1372179102::In-text #61bae5f4","item":"In-text #61bae5f4","kind":"theorem","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Nat.Coprime.mul_gcd","end_line":185,"library":"lean-core","line":184,"location_key":"88859ed38559496f9cfe7452cfb1efbda2affcecca16f88052712207e0a51942","module":"Init.Data.Nat.Coprime","note":"Its binders are natural numbers and its coprimality hypothesis is Nat.Coprime, so it states the passage's identity for nonnegative a1, a2 and b.","pair_key":"3834f1c31006f4c48404eb86e069e66116cb455e4336052701a7737bb5d1c759","path":"src/Init/Data/Nat/Coprime.lean","proof_status":"proved","rank":1,"relation":"narrowMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Nat.Coprime.mul_gcd {m n : Nat} : m.Coprime n → ∀ (k : Nat), (m * n).gcd k = m.gcd k * n.gcd k"},"statement":false},{"challenge":"downgraded","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Nat.Coprime.gcd_mul","end_line":182,"library":"lean-core","line":177,"location_key":"e0af43645a2a7dcda96b5240b2ec306b81435ac4b183d43e7e77c7e417e01da9","module":"Init.Data.Nat.Coprime","note":"Again stated for natural numbers, so it reaches the passage's identity only for nonnegative arguments.","pair_key":"af87fba27dd815a970ccb32c3f72bbcb156e90d3a9a8bbc86b12f239a2506003","path":"src/Init/Data/Nat/Coprime.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Nat.Coprime.gcd_mul {m n : Nat} (k : Nat) : m.Coprime n → k.gcd (m * n) = k.gcd m * k.gcd n"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"155a7b7d646a7354153f6cb1ee744926b4fb942dd429b2afa194bf286d7cf365","prominence":"central","quote":{"exact":"The GCD is a multiplicative function in the following sense: if a1"},"quote_capped":true,"section":["Properties"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"The GCD is a multiplicative function in the following sense: if a1 and a2 are relatively prime, then gcd(a1⋅a2, b) = gcd(a1, b)⋅gcd(a2, b).","segments":[{"text":"The GCD is a multiplicative function in the following sense: if a1 and a2 are relatively prime, then gcd(a1⋅a2, b) = gcd(a1, b)⋅gcd(a2, b)."}]},"unresolved":null},{"absence":null,"basis":"82936dbfa66894bd49aaf30e53630333c1550e5fe08c2ecf3e4c11f155178dd3","coverage":null,"id":"enwiki-12354-1372179102::In-text #61deda04","item":"In-text #61deda04","kind":"theorem","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Int.gcd_mul_lcm","end_line":451,"library":"lean-core","line":450,"location_key":"82936dbfa66894bd49aaf30e53630333c1550e5fe08c2ecf3e4c11f155178dd3","module":"Init.Data.Int.Gcd","note":"Lean's gcd and lcm of two integers are natural numbers, and the declaration writes its right-hand side in that natural-number encoding as the product of the two absolute values, the number the passage writes as the absolute value of the product.","pair_key":"70620c03fc9428bf53f760d0947f8f3ed4f41b79c04ab5051dfc72eec5e6dbad","path":"src/Init/Data/Int/Gcd.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Int.gcd_mul_lcm (m n : Int) : m.gcd n * m.lcm n = m.natAbs * n.natAbs"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Nat.gcd_mul_lcm","end_line":40,"library":"lean-core","line":38,"location_key":"ace173d3f63c03a7f40447070e8007083a21d8539b7dec20f248d0bc82788d7b","module":"Init.Data.Nat.Lcm","note":"Its binders are natural numbers, so it reaches the passage's identity only for nonnegative a and b.","pair_key":"62b61cd450bf93bb4dda9c7bb7ae41f6693a3d55565f06e9510145b2f5356feb","path":"src/Init/Data/Nat/Lcm.lean","proof_status":"proved","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Nat.gcd_mul_lcm (m n : Nat) : m.gcd n * m.lcm n = m * n"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"PNat.gcd_mul_lcm","end_line":87,"library":"mathlib","line":86,"location_key":"a052322225816924bc1d67bee188e6e3aacce62b02986ccfcd94cec6941ea717","module":"Mathlib.Data.PNat.Prime","note":"It is stated for the positive integers presented as the type of positive naturals.","pair_key":"d208a84e52a82e812acc00b1c15d36a333092ab9cc6292a4047cbaa581d06327","path":"Mathlib/Data/PNat/Prime.lean","proof_status":"proved","rank":3,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem PNat.gcd_mul_lcm (n m : ℕ+) : n.gcd m * n.lcm m = n * m"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"81ca50dac5754802b9deff489055e7f23038bdab085d4d1c7fd791e50855ecb6","prominence":"central","quote":{"exact":"gcd(a, b) is closely related to the least common multiple lcm(a, b):"},"quote_capped":true,"section":["Properties"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"gcd(a, b) is closely related to the least common multiple lcm(a, b): we have gcd(a, b)⋅lcm(a, b) = |a⋅b|.","segments":[{"text":"gcd(a, b) is closely related to the least common multiple lcm(a, b): we have gcd(a, b)⋅lcm(a, b) = |a⋅b|."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":3,"queries":4,"sha256":"3d159eefccb3d6f5db3ea3936d50eb27ba29ea4ff17c96e8971ebcc64d5e190a"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-12354-1372179102::In-text #fff5b3c8","item":"In-text #fff5b3c8","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"01465803e63721e8ef58203acb6f5de202c7c634b6ffaa25c589509be12102f2","prominence":"central","quote":{"exact":"The following versions of distributivity hold true: gcd(a, lcm(b, c)) = lcm(gcd(a,"},"quote_capped":true,"section":["Properties"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"after":{"layer":" lcm(a, gcd(b, c)) = gcd(lcm(a, b), lcm(a, c)).","segments":[{"text":" lcm(a, gcd(b, c)) = gcd(lcm(a, b), lcm(a, c))."}]},"layer":"The following versions of distributivity hold true: gcd(a, lcm(b, c)) = lcm(gcd(a, b), gcd(a, c))","segments":[{"text":"The following versions of distributivity hold true: gcd(a, lcm(b, c)) = lcm(gcd(a, b), gcd(a, c))"}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":3,"queries":4,"sha256":"eb665a329925ab2bc2692ce3e4fd88dc1e6bd26b7a852d9cf4701cd30e08fcee"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-12354-1372179102::In-text #41f5e239","item":"In-text #41f5e239","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"faa87affa4c64ffae054505cad54f4c5c2190c35dc703745f021c0733fe7ab53","prominence":"central","quote":{"exact":"lcm(a, gcd(b, c)) = gcd(lcm(a, b), lcm(a, c))."},"quote_capped":false,"section":["Properties"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"before":{"layer":"The following versions of distributivity hold true: gcd(a, lcm(b, c)) = lcm(gcd(a, b), gcd(a, c)) ","segments":[{"text":"The following versions of distributivity hold true: gcd(a, lcm(b, c)) = lcm(gcd(a, b), gcd(a, c)) "}]},"layer":"lcm(a, gcd(b, c)) = gcd(lcm(a, b), lcm(a, c)).","segments":[{"text":"lcm(a, gcd(b, c)) = gcd(lcm(a, b), lcm(a, c))."}]},"unresolved":null},{"absence":null,"basis":"ed8b66504a34e182fcc3eeb68ab1785a1fe0f3d4314315bd8461edcf44d81020","coverage":null,"id":"enwiki-12354-1372179102::In-text #4b0174b3","item":"In-text #4b0174b3","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Nat.factorization_gcd","end_line":368,"library":"mathlib","line":355,"location_key":"ed8b66504a34e182fcc3eeb68ab1785a1fe0f3d4314315bd8461edcf44d81020","module":"Mathlib.Data.Nat.Factorization.Basic","note":"The declaration carries each number's prime factorization as the finitely supported exponent function Nat.factorization, whose binders are natural numbers as the passage's factorized a and b are, and it says that each prime's exponent in the gcd is the smaller of its exponents in a and in b.","pair_key":"b683b3f03630af69bfeaa5e7d2d8b68b9bada6f93964438f8855652404c57f57","path":"Mathlib/Data/Nat/Factorization/Basic.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.factorization_gcd {a b : ℕ} : a ≠ 0 → b ≠ 0 → (a.gcd b).factorization = a.factorization ⊓ b.factorization"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"PNat.factorMultiset_gcd","end_line":363,"library":"mathlib","line":354,"location_key":"3dad45e59e6ff00b91ae537444014eb28fdd6a01e820f3411c3551369adde032","module":"Mathlib.Data.PNat.Factors","note":"It writes each positive integer's factorization as a multiset of primes and states that the gcd's multiset is the meet of the two, keeping each prime with the smaller of its two multiplicities.","pair_key":"e9981e2b6b9ef234938ea03485d23b242817362072017f4bff59c87f064a8827","path":"Mathlib/Data/PNat/Factors.lean","proof_status":"proved","rank":2,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem PNat.factorMultiset_gcd (m n : ℕ+) : (m.gcd n).factorMultiset = m.factorMultiset ⊓ n.factorMultiset"},"statement":false},{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.Nat.prodPrimePow_gcd","end_line":450,"library":"tauceti","line":427,"location_key":"874c1226d1e9fdf6e347789d72a6c00d2ec59fac61edb3e9e2d752ed4c3fd216","module":"TauCeti.Data.Nat.ExactDivisor","note":"Its two numbers share each exponent they both carry, so the minimum in the passage's formula reduces to that common exponent or to zero.","pair_key":"a7492fd079a277b9a364f5bbbe24797f2b5f2f836f7b6a102c6e08e098e5854f","path":"TauCeti/Data/Nat/ExactDivisor.lean","proof_status":"proved","rank":3,"relation":"narrowMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem TauCeti.Nat.prodPrimePow_gcd {N : ℕ} {s t : Finset ℕ} : s ⊆ N.primeFactors → t ⊆ N.primeFactors → TauCeti.Nat.prodPrimePow N (s ∩ t) = (TauCeti.Nat.prodPrimePow N s).gcd (TauCeti.Nat.prodPrimePow N t)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"a1e7faf00436407ba69e876e98ede9fd40d647e7e8efe4f32dae5075ef664247","prominence":"central","quote":{"exact":"If we have the unique prime factorizations of a = p1e1 p2e2"},"quote_capped":true,"section":["Properties"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"If we have the unique prime factorizations of a = p1e1 p2e2 ⋅⋅⋅ pmem and b = p1f1 p2f2 ⋅⋅⋅ pmfm where ei ≥ 0 and fi ≥ 0, then the GCD of a and b is gcd(a,b) = p1min(e1,f1) p2min(e2,f2) ⋅⋅⋅ pmmin(em,fm).","segments":[{"text":"If we have the unique prime factorizations of a = p1e1 p2e2 ⋅⋅⋅ pmem and b = p1f1 p2f2 ⋅⋅⋅ pmfm where ei ≥ 0 and fi ≥ 0, then the GCD of a and b is gcd(a,b) = p1min(e1,f1) p2min(e2,f2) ⋅⋅⋅ pmmin(em,fm)."}]},"unresolved":null},{"absence":null,"basis":null,"coverage":{"basis":true,"bundle_key":"fe06c7aef2470f322948755e412b0265d458563487a91fd9e53ce122b200fda4","challenge":"survived","complete":true,"conjuncts":[{"id":"c1","part":"976b7d4fabe3c41a28e82ceeb0317e49997fcd78596258b0320d179e6630000a","text":"the greatest common divisor of 0 and 0 is taken to be 0"},{"id":"c2","part":"5882a0b2d10ecda218119782c533ac24837b5ba62d638c2e41dba9516cfe9ac2","text":"the least common multiple of 0 and 0 is taken to be 0"}],"parts":["976b7d4fabe3c41a28e82ceeb0317e49997fcd78596258b0320d179e6630000a","5882a0b2d10ecda218119782c533ac24837b5ba62d638c2e41dba9516cfe9ac2"],"relation":"broadMatch","status":"formalized"},"id":"enwiki-12354-1372179102::In-text #2aab212a","item":"In-text #2aab212a","kind":"definition","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Nat.gcd_zero_left","end_line":44,"library":"lean-core","line":43,"location_key":"976b7d4fabe3c41a28e82ceeb0317e49997fcd78596258b0320d179e6630000a","module":"Init.Data.Nat.Gcd","note":"Lean core fixes the left argument at zero and quantifies over the right one, and the value it gives at a right argument of zero is zero, the number the passage sets.","pair_key":"7aabcc205ec1bba203fd39999cdabe4e000ea2484b3d0355b9a76d88880b1395","path":"src/Init/Data/Nat/Gcd.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Nat.gcd_zero_left (y : Nat) : Nat.gcd 0 y = y"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Nat.lcm_zero_left","end_line":59,"library":"lean-core","line":59,"location_key":"5882a0b2d10ecda218119782c533ac24837b5ba62d638c2e41dba9516cfe9ac2","module":"Init.Data.Nat.Lcm","note":"Lean core fixes the left argument at zero and quantifies over the right one, returning zero throughout, so the passage's case is covered.","pair_key":"73155c49d28550d9bfa198b36cbaa999dbc635b46622c9f1056b4d159d982e0b","path":"src/Init/Data/Nat/Lcm.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Nat.lcm_zero_left (m : Nat) : Nat.lcm 0 m = 0"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"4ef7eb92b71e4fd6300a523159651bab49f38214b0839b3549fb9b1a7105a3de","prominence":"supporting","quote":{"exact":"It is sometimes useful to define gcd(0, 0) = 0 and lcm(0,"},"quote_capped":true,"section":["Properties"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"after":{"layer":" because then the natural numbers become a complete distributive lattice with GCD as meet and LCM as join operation.","segments":[{"text":" because then the natural numbers become a complete distributive lattice with GCD as meet and LCM as join operation."}]},"layer":"It is sometimes useful to define gcd(0, 0) = 0 and lcm(0, 0) = 0","segments":[{"text":"It is sometimes useful to define gcd(0, 0) = 0 and lcm(0, 0) = 0"}]},"unresolved":null},{"absence":null,"basis":"bb73067925a58aea908cbdefb8ad7b8b3adb2f062dd39f3e23878cfa38ff9d9b","coverage":null,"id":"enwiki-12354-1372179102::In-text #abe180a2","item":"In-text #abe180a2","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"instStrongNormalizedGCDMonoidNat","end_line":53,"library":"mathlib","line":49,"location_key":"bb73067925a58aea908cbdefb8ad7b8b3adb2f062dd39f3e23878cfa38ff9d9b","module":"Mathlib.Algebra.GCDMonoid.Nat","note":"The instance supplies the divisibility meet and join on the naturals, with the zero conventions the passage adopts, but it says nothing about infima of infinite families or about the distributive law.","pair_key":"f60fb7c643eff451d0e5bf4c343901b7c1a74d92e1a0c9ec9612da88642130bf","path":"Mathlib/Algebra/GCDMonoid/Nat.lean","proof_status":"definition","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance instStrongNormalizedGCDMonoidNat : StrongNormalizedGCDMonoid ℕ"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"ff01fb725df217953880b823be83d5e9045271430e8b4559bfb16a6c2d3b36f2","prominence":"central","quote":{"exact":"the natural numbers become a complete distributive lattice with GCD as meet"},"quote_capped":true,"section":["Properties"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"before":{"layer":"It is sometimes useful to define gcd(0, 0) = 0 and lcm(0, 0) = 0 because then ","segments":[{"text":"It is sometimes useful to define gcd(0, 0) = 0 and lcm(0, 0) = 0 because then "}]},"layer":"the natural numbers become a complete distributive lattice with GCD as meet and LCM as join operation.[22]","segments":[{"text":"the natural numbers become a complete distributive lattice with GCD as meet and LCM as join operation."},{"ref":"[22]"}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"9fc783fdaf48ccb9292d06b55d15fb4e154230d23e69f8b918ea38e97db237e7"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-12354-1372179102::In-text #475f451f","item":"In-text #475f451f","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"cebfdfa8d0d605aa523d47d523c535988363a9ccc97a504d98b62c9338c428e4","prominence":"central","quote":{"exact":"In a Cartesian coordinate system, gcd(a, b) can be interpreted as the"},"quote_capped":true,"section":["Properties"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"In a Cartesian coordinate system, gcd(a, b) can be interpreted as the number of segments between points with integral coordinates on the straight line segment joining the points (0, 0) and (a, b).","segments":[{"text":"In a Cartesian coordinate system, gcd(a, b) can be interpreted as the number of segments between points with integral coordinates on the straight line segment joining the points (0, 0) and (a, b)."}]},"unresolved":null},{"absence":null,"basis":"0b441f9233f258cf14ee35f425bb61b9d31fd0ae73f44297f2a0ff5291a24e16","coverage":null,"id":"enwiki-12354-1372179102::In-text #f59381ae","item":"In-text #f59381ae","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.pow_sub_one_gcd_pow_sub_one","end_line":73,"library":"mathlib","line":68,"location_key":"0b441f9233f258cf14ee35f425bb61b9d31fd0ae73f44297f2a0ff5291a24e16","module":"Mathlib.Data.Nat.GCD.Basic","note":"Mathlib states this for naturals, and the passage's non-negative integers are exactly ℕ; subtraction is truncated there, which bites only in the degenerate cases where both sides come out zero, and the lemma drops the passage's condition that the exponents are not both zero.","pair_key":"601571b01e307ba3204d2fcdd4750fe6c4a4a7b29af01986d9ebf96453d32179","path":"Mathlib/Data/Nat/GCD/Basic.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.pow_sub_one_gcd_pow_sub_one (a b c : ℕ) : (a ^ b - 1).gcd (a ^ c - 1) = a ^ b.gcd c - 1"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"e2a176284b9f64fa240fffa134906e09207e0a33428756e8c225e13d2a473ec4","prominence":"central","quote":{"exact":"For non-negative integers a and b, where a and b are not"},"quote_capped":true,"section":["Properties"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"For non-negative integers a and b, where a and b are not both zero, provable by considering the Euclidean algorithm in base n:[23] gcd(na − 1, nb − 1) = ngcd(a,b) − 1.","segments":[{"text":"For non-negative integers a and b, where a and b are not both zero, provable by considering the Euclidean algorithm in base n:"},{"ref":"[23]"},{"text":" gcd(na − 1, nb − 1) = ngcd(a,b) − 1."}]},"unresolved":null},{"absence":null,"basis":"5b0acd43c2de11894d7efe1175d30854a3fa97ea1341daa49407fd9b25fed2be","coverage":null,"id":"enwiki-12354-1372179102::In-text #e440afc9","item":"In-text #e440afc9","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Nat.sum_totient","end_line":172,"library":"mathlib","line":163,"location_key":"5b0acd43c2de11894d7efe1175d30854a3fa97ea1341daa49407fd9b25fed2be","module":"Mathlib.Data.Nat.Totient","note":"Mathlib indexes the sum by the ℕ-divisors of a single number, and at the gcd those are precisely the positive numbers dividing both a and b that the passage sums over, so writing the index set either way picks out the same finite set of positive divisors.","pair_key":"c2481acdb293c94dcb0a60bc6073f2e7666da93ec96d4c3153af461a5f812e19","path":"Mathlib/Data/Nat/Totient.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.sum_totient (n : ℕ) : n.divisors.sum Nat.totient = n"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Nat.sum_totient'","end_line":177,"library":"mathlib","line":174,"location_key":"ae5c2eaf2d83d5a7484b3c300dc9cdacf164120048a424c53a6ae6ff4d3b74ac","module":"Mathlib.Data.Nat.Totient","note":"This variant writes the index set as the naturals below the number that divide it, which at the gcd lists the positive common divisors of a and b, the ones the passage sums over.","pair_key":"7b71c525deae46d96f5df4b8cb0ed7d42e76a0e54c3027bab62c671efe81f856","path":"Mathlib/Data/Nat/Totient.lean","proof_status":"proved","rank":2,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Nat.sum_totient' (n : ℕ) : ∑ m ∈ Finset.range n.succ with m ∣ n, m.totient = n"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"d7b0ad953f977b8368d91e040d9e610880f053db1ab8ff167680c37478ebd410","prominence":"central","quote":{"exact":"An identity involving Euler's totient function: gcd ( a , b )"},"quote_capped":true,"section":["Properties"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"An identity involving Euler's totient function: gcd ( a , b ) = ∑ k | a and k | b φ ( k ) . {\\displaystyle \\gcd(a,b)=\\sum _{k|a{\\text{ and }}k|b}\\varphi (k).}","segments":[{"text":"An identity involving Euler's totient function: "},{"tex":"\\gcd(a,b)=\\sum _{k|a{\\text{ and }}k|b}\\varphi (k)."}]},"unresolved":null},{"absence":null,"basis":"35d14a0405dcb50291f194ce4fc0f4cf21b3a9ec55dfa2653d8bd5d818bdca93","coverage":null,"id":"enwiki-12354-1372179102::In-text #b298eb97","item":"In-text #b298eb97","kind":"theorem","locations":[{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"medium","declaration":"MetaMathlibExt.gcd_sum_eq_totient_sum","library":"atlas","line":72,"location_key":"35d14a0405dcb50291f194ce4fc0f4cf21b3a9ec55dfa2653d8bd5d818bdca93","module":"MathlibExt.NumberTheory.ArithmeticFunction.GcdSumTotient","note":"The atlas theorem reaches one of the expressions the passage lists for the gcd summatory function, but not the product over the primes dividing n that the passage ends with.","pair_key":"1d79fe45b314019bb931c0416ee5c0470382049a049d978451f1dbc87cab5b87","path":"MathlibExt/NumberTheory/ArithmeticFunction/GcdSumTotient.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"theorem MetaMathlibExt.gcd_sum_eq_totient_sum (n : ℕ) : 0 < n → ∑ j ∈ Finset.Icc 1 n, ↑(j.gcd n) = ↑n * ∑ d ∈ n.divisors, ↑d.totient / ↑d"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"cb9687fdaca3d14710003e00f6f8ffa1f51f9e3ce3cc2c07172a2362a22ed936","prominence":"central","quote":{"exact":"∑ k = 1 n gcd ( k , n ) ="},"quote_capped":true,"section":["Properties"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"∑ k = 1 n gcd ( k , n ) = ∑ d | n d φ ( n d ) = n ∑ d | n φ ( d ) d = n ∏ p | n ( 1 + ν p ( n ) ( 1 − 1 p ) ) {\\displaystyle \\sum _{k=1}^{n}\\gcd(k,n)=\\sum _{d|n}d\\varphi \\left({\\frac {n}{d}}\\right)=n\\sum _{d|n}{\\frac {\\varphi (d)}{d}}=n\\prod _{p|n}\\left(1+\\nu _{p}(n)\\left(1-{\\frac {1}{p}}\\right)\\right)} where ν p ( n ) {\\displaystyle \\nu _{p}(n)} is the p-adic valuation.","segments":[{"tex":"\\sum _{k=1}^{n}\\gcd(k,n)=\\sum _{d|n}d\\varphi \\left({\\frac {n}{d}}\\right)=n\\sum _{d|n}{\\frac {\\varphi (d)}{d}}=n\\prod _{p|n}\\left(1+\\nu _{p}(n)\\left(1-{\\frac {1}{p}}\\right)\\right)"},{"text":" where "},{"tex":"\\nu _{p}(n)"},{"text":" is the p-adic valuation."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"225568860532ea334118211286bde73e5098642ed405222d4929446f17ebe74d"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-12354-1372179102::In-text #4c300358","item":"In-text #4c300358","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"d5f9bb6eed0675f7976fe771009a8552fb3195e61d039395565a364ecb038c12","prominence":"central","quote":{"exact":"In 1972, James E. Nymann showed that k integers, chosen independently and"},"quote_capped":true,"section":["Probabilities and expected value"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"In 1972, James E. Nymann showed that k integers, chosen independently and uniformly from {1, ..., n}, are coprime with probability 1/ζ(k) as n goes to infinity, where ζ refers to the Riemann zeta function.","segments":[{"text":"In 1972, James E. Nymann showed that k integers, chosen independently and uniformly from {1, ..., n}, are coprime with probability 1/ζ(k) as n goes to infinity, where ζ refers to the Riemann zeta function."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"505b33618f246f9d5501dbe1e88c3e3588342d4f92f960aa8630345453aeaf25"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-12354-1372179102::In-text #acf5eb8e","item":"In-text #acf5eb8e","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"219c6a3a9fb848d8128129ee3d94325997ba05c8a665d5a95b67d17577fb89c8","prominence":"central","quote":{"exact":"This result was extended in 1987 to show that the probability that"},"quote_capped":true,"section":["Probabilities and expected value"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"before":{"layer":"(See coprime for a derivation.) ","segments":[{"text":"(See coprime for a derivation.) "}]},"layer":"This result was extended in 1987 to show that the probability that k random integers have greatest common divisor d is d−k/ζ(k).","segments":[{"text":"This result was extended in 1987 to show that the probability that k random integers have greatest common divisor d is d−k/ζ(k)."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"fc70e8ee14f21c5e5a4e22b6a4eb66feb601edefa820fa18c8fed6c8775ac6dd"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-12354-1372179102::In-text #75d12d05","item":"In-text #75d12d05","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"7ae82311ed5263bbe6ff360c839108a6b9780487c6903a2e6c29177f7d0f4766","prominence":"supporting","quote":{"exact":"Using this information, the expected value of the greatest common divisor function"},"quote_capped":true,"section":["Probabilities and expected value"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"Using this information, the expected value of the greatest common divisor function can be seen (informally) to not exist when k = 2.","segments":[{"text":"Using this information, the expected value of the greatest common divisor function can be seen (informally) to not exist when k = 2."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":1,"queries":3,"sha256":"66fa59640ec2582744da014a9cf921c7764ee0f963aa5d380a5b9bb05a8f9c81"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-12354-1372179102::In-text #f82bf03b","item":"In-text #f82bf03b","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"7b2ffe174b145e6762c17a4930a030f9af4bf3b32a3806ec4f528d9d720f0402","prominence":"supporting","quote":{"exact":"In this case the probability that the GCD equals d is d−2/ζ(2)"},"quote_capped":false,"section":["Probabilities and expected value"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"after":{"layer":", so we have","segments":[{"text":", so we have"}]},"layer":"In this case the probability that the GCD equals d is d−2/ζ(2)","segments":[{"text":"In this case the probability that the GCD equals d is d−2/ζ(2)"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"a6055dc9d9c0de224019ce589508dbaf302e9738da96682b8b02186dba8c5466"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-12354-1372179102::In-text #70b27b9a","item":"In-text #70b27b9a","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"274989ca3577a2cfa41c6b2e6c0a990d27643c2d0828b71deab4c97d65ce1842","prominence":"supporting","quote":{"exact":"we have E ( 2 ) = ∑ d = 1 ∞"},"quote_capped":true,"section":["Probabilities and expected value"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"before":{"layer":"In this case the probability that the GCD equals d is d−2/ζ(2), so ","segments":[{"text":"In this case the probability that the GCD equals d is d−2/ζ(2), so "}]},"layer":"we have E ( 2 ) = ∑ d = 1 ∞ d ( d − 2 / ζ ( 2 ) ) = 1 ζ ( 2 ) ∑ d = 1 ∞ 1 d . {\\displaystyle \\mathrm {E} (\\mathrm {2} )=\\sum _{d=1}^{\\infty }d(d^{-2}/\\zeta (2))={\\frac {1}{\\zeta (2)}}\\sum _{d=1}^{\\infty }{\\frac {1}{d}}.}","segments":[{"text":"we have "},{"tex":"\\mathrm {E} (\\mathrm {2} )=\\sum _{d=1}^{\\infty }d(d^{-2}/\\zeta (2))={\\frac {1}{\\zeta (2)}}\\sum _{d=1}^{\\infty }{\\frac {1}{d}}."}]},"unresolved":null},{"absence":null,"basis":"ba126e02482c19271b5a4e8abb7c47398d32c40c7f4cf27460ad359de02d25fd","coverage":null,"id":"enwiki-12354-1372179102::In-text #c31ede2e","item":"In-text #c31ede2e","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Real.tendsto_sum_range_one_div_nat_succ_atTop","end_line":365,"library":"mathlib","line":361,"location_key":"ba126e02482c19271b5a4e8abb7c47398d32c40c7f4cf27460ad359de02d25fd","module":"Mathlib.Analysis.PSeries","note":"Lean writes the terms as 1/(i+1) with i a natural number (ℕ) below n, which lists precisely the reciprocals of the positive integers the passage sums from d equal to one, so the same series is stated.","pair_key":"3114b81790723229f3b20aaf99b1d48174d35628bfba9d56927675a59184a7e9","path":"Mathlib/Analysis/PSeries.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Real.tendsto_sum_range_one_div_nat_succ_atTop : Filter.Tendsto (fun n ↦ ∑ i ∈ Finset.range n, 1 / (↑i + 1)) Filter.atTop Filter.atTop"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Real.not_summable_one_div_natCast","end_line":358,"library":"mathlib","line":357,"location_key":"f0a1ff7be7c3ce28e4b556fa4069e1582bf81321ab524af7bb870483dfd01f8b","module":"Mathlib.Analysis.PSeries","note":"Mathlib records divergence as the absence of a sum rather than as growth of the running totals, and indexes by natural numbers (ℕ) so that the one index outside the passage's positive d contributes zero.","pair_key":"1c761f44c1a093a0439e63c65c570d58dc818a6c8bece1e73ab091ebfafc9aa7","path":"Mathlib/Analysis/PSeries.lean","proof_status":"proved","rank":2,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Real.not_summable_one_div_natCast : ¬Summable fun n ↦ 1 / ↑n"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"c6427b93649cc8d75b1f4c09cfe1c22f21598e4f4d4e6fbf0bfdf61d6a3e8a70","prominence":"supporting","quote":{"exact":"This last summation is the harmonic series, which diverges."},"quote_capped":false,"section":["Probabilities and expected value"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"This last summation is the harmonic series, which diverges.","segments":[{"text":"This last summation is the harmonic series, which diverges."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"3bf636fd9538a68a577f2ae8591702b449bfe03c535f21bda2fa2d3d6e5a5b1f"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-12354-1372179102::In-text #6479b5c7","item":"In-text #6479b5c7","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"9f211cdad2ae77825bd4520d5aea88f57be3820f8098690955c1d252abc03a5b","prominence":"central","quote":{"exact":"However, when k ≥ 3, the expected value is well-defined, and by"},"quote_capped":true,"section":["Probabilities and expected value"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"However, when k ≥ 3, the expected value is well-defined, and by the above argument, it is E ( k ) = ∑ d = 1 ∞ d 1 − k ζ ( k ) − 1 = ζ ( k − 1 ) ζ ( k ) . {\\displaystyle \\mathrm {E} (k)=\\sum _{d=1}^{\\infty }d^{1-k}\\zeta (k)^{-1}={\\frac {\\zeta (k-1)}{\\zeta (k)}}.}","segments":[{"text":"However, when k ≥ 3, the expected value is well-defined, and by the above argument, it is "},{"tex":"\\mathrm {E} (k)=\\sum _{d=1}^{\\infty }d^{1-k}\\zeta (k)^{-1}={\\frac {\\zeta (k-1)}{\\zeta (k)}}."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":1,"queries":3,"sha256":"c78dddd7eefdcb6965000ff98e8d1089add15f832c831c600d8fa08f0d9e232f"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-12354-1372179102::In-text #37d37461","item":"In-text #37d37461","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"6e1708191cfb4159d5342801e53f57243fcb94d7d5827982688037d56528dd35","prominence":"supporting","quote":{"exact":"For k = 3, this is approximately equal to 1.3684."},"quote_capped":false,"section":["Probabilities and expected value"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"For k = 3, this is approximately equal to 1.3684.","segments":[{"text":"For k = 3, this is approximately equal to 1.3684."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":1,"queries":3,"sha256":"e0de0773d10527842da5de78b04ac176a401a18500603ec6b1539fa4eac0bc8c"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-12354-1372179102::In-text #522ee925","item":"In-text #522ee925","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"bcf66d3072622612618a0e10784e8d62b20a412ba1713dbc1df8870802ac4c49","prominence":"supporting","quote":{"exact":"For k = 4, it is approximately 1.1106."},"quote_capped":false,"section":["Probabilities and expected value"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"For k = 4, it is approximately 1.1106.","segments":[{"text":"For k = 4, it is approximately 1.1106."}]},"unresolved":null},{"absence":null,"basis":"2c9ca461c2b7b3883d94997d9defb4bb4a81387c2c4ee3b77561f222d2d93a2f","coverage":null,"id":"enwiki-12354-1372179102::In-text #7e72785f","item":"In-text #7e72785f","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"GCDMonoid","end_line":323,"library":"mathlib","line":307,"location_key":"2c9ca461c2b7b3883d94997d9defb4bb4a81387c2c4ee3b77561f222d2d93a2f","module":"Mathlib.Algebra.GCDMonoid.Basic","note":"This is the generalized notion the passage describes, but Mathlib packages it as an assumption that gcds are available, so it does not record that some pair of ring elements can lack one.","pair_key":"2fc944a0e6e5c5547a507f1dc551938c361f06fa99506578f712fc8f75801057","path":"Mathlib/Algebra/GCDMonoid/Basic.lean","proof_status":"definition","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"class GCDMonoid (α : Type*) [CommMonoidWithZero α]"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"isGCDMonoid_iff_exists_gcd","end_line":1342,"library":"mathlib","line":1339,"location_key":"14ecf7234d10f65c232cf1e664b4d97c9b66247ec172a929a6c4035205467ebe","module":"Mathlib.Algebra.GCDMonoid.Basic","note":"It states the divisibility definition of a gcd in the general setting and treats availability of gcds as a hypothesis, yet it does not exhibit a ring where a pair has none.","pair_key":"5c1591da48c9d5e44e94d0f74354f1b841e62d89bd3b6f06fabf5bc599f0e180","path":"Mathlib/Algebra/GCDMonoid/Basic.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem isGCDMonoid_iff_exists_gcd {α : Type*} [CommMonoidWithZero α] : IsGCDMonoid α ↔ IsCancelMulZero α ∧ ∀ (a b : α), ∃ c, ∀ (d : α), d ∣ a ∧ d ∣ b ↔ d ∣ c"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"cc697144fa02762f3e07c67bdfd606b37e7a0256e0bef2645561e79d0e85fd59","prominence":"central","quote":{"exact":"The notion of greatest common divisor can more generally be defined for"},"quote_capped":true,"section":["In commutative rings"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"The notion of greatest common divisor can more generally be defined for elements of an arbitrary commutative ring, although in general there need not exist one for every pair of elements.","segments":[{"text":"The notion of greatest common divisor can more generally be defined for elements of an arbitrary commutative ring, although in general there need not exist one for every pair of elements."}]},"unresolved":null},{"absence":null,"basis":"be4240f7907516648c897731b567b58e2403e3c4da62f864cee7bda846c24aa4","coverage":null,"id":"enwiki-12354-1372179102::In-text #eaf1f740","item":"In-text #eaf1f740","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"dvd_def","end_line":61,"library":"mathlib","line":60,"location_key":"be4240f7907516648c897731b567b58e2403e3c4da62f864cee7bda846c24aa4","module":"Mathlib.Algebra.Divisibility.Basic","note":"Lean fixes divisibility for any semigroup, and a commutative ring supplies that structure.","pair_key":"b8cf3aa3541b1476b1be664a3eec00a8b9d6446f0cba8e3c1c24cceec023560d","path":"Mathlib/Algebra/Divisibility/Basic.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem dvd_def {α : Type*} [Semigroup α] {a b : α} : a ∣ b ↔ ∃ c, b = a * c"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"dvd_iff_exists_eq_mul_right","end_line":63,"library":"mathlib","line":63,"location_key":"a26ed8e51850fa602a78f653a52fd49cee5522dce9dab346cccf3bd71e703b48","module":"Mathlib.Algebra.Divisibility.Basic","note":"This is the same equivalence under its longer name in Lean.","pair_key":"48f59f83b6f2081c56420c7f3fd9681ccf088e7034d090c4a830747777da67ae","path":"Mathlib/Algebra/Divisibility/Basic.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem dvd_iff_exists_eq_mul_right {α : Type*} [Semigroup α] {a b : α} : a ∣ b ↔ ∃ c, b = a * c"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"semigroupDvd","end_line":48,"library":"mathlib","line":47,"location_key":"8677ed72f411770bedd10350b049eefb706c98ceb5f71493624ebf08d5c86dfd","module":"Mathlib.Algebra.Divisibility.Basic","note":"This is the instance that attaches the divisibility notation to a ring.","pair_key":"855351dd76c2e502dec4c66b1bd699293820cc5ce7059408178c2dc4821d9e2e","path":"Mathlib/Algebra/Divisibility/Basic.lean","proof_status":"definition","rank":3,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance semigroupDvd {α : Type*} [Semigroup α] : Dvd α"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"ab67bb32a9bf00bede5264c7aa914716798ff163f1926552a0cb721a3c3c678b","prominence":"central","quote":{"exact":"If R is a commutative ring, and a and b are in"},"quote_capped":true,"section":["In commutative rings"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"If R is a commutative ring, and a and b are in R, then an element d of R is called a common divisor of a and b if it divides both a and b (that is, if there are elements x and y in R such that d·x = a and d·y = b).","segments":[{"text":"If R is a commutative ring, and a and b are in R, then an element d of R is called a common divisor of a and b if it divides both a and b (that is, if there are elements x and y in R such that d·x = a and d·y = b)."}]},"unresolved":null},{"absence":null,"basis":"f6064584bf38a8fad1d59dffc3ad7ad026b2e438ae0135377fd2644b0abd7311","coverage":null,"id":"enwiki-12354-1372179102::In-text #4051e746","item":"In-text #4051e746","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"dvd_gcd_iff","end_line":387,"library":"mathlib","line":385,"location_key":"f6064584bf38a8fad1d59dffc3ad7ad026b2e438ae0135377fd2644b0abd7311","module":"Mathlib.Algebra.GCDMonoid.Basic","note":"Lean assumes that every pair of elements already has a chosen greatest common divisor, where the article only names the condition.","pair_key":"2d139f1dfd1acf71b8d33cb9d5012b0cd91677a822f917f097bba024ee50067e","path":"Mathlib/Algebra/GCDMonoid/Basic.lean","proof_status":"proved","rank":1,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem dvd_gcd_iff {α : Type*} [CommMonoidWithZero α] [GCDMonoid α] (a b c : α) : a ∣ GCDMonoid.gcd b c ↔ a ∣ b ∧ a ∣ c"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"gcd_greatest_associated","end_line":697,"library":"mathlib","line":693,"location_key":"f1b85a11e1cdcbc551cf6d8fa00f1b8467c5573a985b544f554135aa957c9bab","module":"Mathlib.Algebra.GCDMonoid.Basic","note":"Its hypotheses are written exactly as the article's condition.","pair_key":"3d7269860c7c630bbaeacd0186d9b075a6f7fc2e5db5a110fc25e67d39240eca","path":"Mathlib/Algebra/GCDMonoid/Basic.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem gcd_greatest_associated {α : Type*} [CommMonoidWithZero α] [GCDMonoid α] {a b d : α} : d ∣ a → d ∣ b → (∀ (e : α), e ∣ a → e ∣ b → e ∣ d) → Associated d (GCDMonoid.gcd a b)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"isGCDMonoid_iff_exists_gcd","end_line":1342,"library":"mathlib","line":1339,"location_key":"cb2e73687d2bc88ce682dd0ce94352eded4f102caf9e2ec46f8f17614fbc3101","module":"Mathlib.Algebra.GCDMonoid.Basic","note":"The article's condition appears inside this equivalence as the body of an existential.","pair_key":"6188b840e0dde0dbc7c3499f2739bd040dde0f7a64f863fa8ac80cf3262e0455","path":"Mathlib/Algebra/GCDMonoid/Basic.lean","proof_status":"proved","rank":3,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem isGCDMonoid_iff_exists_gcd {α : Type*} [CommMonoidWithZero α] : IsGCDMonoid α ↔ IsCancelMulZero α ∧ ∀ (a b : α), ∃ c, ∀ (d : α), d ∣ a ∧ d ∣ b ↔ d ∣ c"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"edcecf663a21cecc8af30337cc206c1a634a162c0a583c68c9d3c2df7c91a006","prominence":"central","quote":{"exact":"If d is a common divisor of a and b, and every"},"quote_capped":true,"section":["In commutative rings"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"If d is a common divisor of a and b, and every common divisor of a and b divides d, then d is called a greatest common divisor of a and b.","segments":[{"text":"If d is a common divisor of a and b, and every common divisor of a and b divides d, then d is called a greatest common divisor of a and b."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":3,"queries":4,"sha256":"d07ea5aa4f3dcf3ecb544a7e59aa4b57c6befbfdf3c96d76baaf75d515864517"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-12354-1372179102::In-text #6ac2f1ef","item":"In-text #6ac2f1ef","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"133cb17e4d77cae315d1c4599477d4d21b114d01819ab7caa299b1a89dea330b","prominence":"supporting","quote":{"exact":"With this definition, two elements a and b may very well have"},"quote_capped":true,"section":["In commutative rings"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"With this definition, two elements a and b may very well have several greatest common divisors, or none at all.","segments":[{"text":"With this definition, two elements a and b may very well have several greatest common divisors, or none at all."}]},"unresolved":null},{"absence":null,"basis":"9f3a7661af4454b8b526227ce1a021ac3c8212665b389e2be327872f09d5c45d","coverage":null,"id":"enwiki-12354-1372179102::In-text #eb1a7a19","item":"In-text #eb1a7a19","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"associated_of_dvd_dvd","end_line":204,"library":"mathlib","line":190,"location_key":"9f3a7661af4454b8b526227ce1a021ac3c8212665b389e2be327872f09d5c45d","module":"Mathlib.Algebra.GroupWithZero.Associated","note":"Lean works in a monoid with zero whose left multiplications cancel, a setting the article's domain falls under.","pair_key":"1eb2d477ff4c55f9f478449af6be7e08e8f0241b2fcea1cf936431161527c6ed","path":"Mathlib/Algebra/GroupWithZero/Associated.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem associated_of_dvd_dvd {M : Type*} [MonoidWithZero M] [IsLeftCancelMulZero M] {a b : M} : a ∣ b → b ∣ a → Associated a b"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"dvd_dvd_iff_associated","end_line":208,"library":"mathlib","line":206,"location_key":"69c641a19ebdc4fa629603f4c9368aa37b0217384f0c680e94734849e3703e4d","module":"Mathlib.Algebra.GroupWithZero.Associated","note":"Lean packages the implication and its converse into a single equivalence.","pair_key":"9bd6c426c4e06ac6363216ce882ff1ac985af738f216e2d21a858d6e5876afc6","path":"Mathlib/Algebra/GroupWithZero/Associated.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem dvd_dvd_iff_associated {M : Type*} [MonoidWithZero M] [IsLeftCancelMulZero M] {a b : M} : a ∣ b ∧ b ∣ a ↔ Associated a b"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"gcd_greatest_associated","end_line":697,"library":"mathlib","line":693,"location_key":"3a6a4f31f0b1f568606064b99eef1309f01447356c435faef04a4068be79948e","module":"Mathlib.Algebra.GCDMonoid.Basic","note":"It assumes that a gcd has been chosen for every pair, which the article does not require of its domain.","pair_key":"e1cad01f5156b0730dd0ea6f0c6c1a39c1cb984840cb9ba430bf9ee7f50ba388","path":"Mathlib/Algebra/GCDMonoid/Basic.lean","proof_status":"proved","rank":3,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem gcd_greatest_associated {α : Type*} [CommMonoidWithZero α] [GCDMonoid α] {a b d : α} : d ∣ a → d ∣ b → (∀ (e : α), e ∣ a → e ∣ b → e ∣ d) → Associated d (GCDMonoid.gcd a b)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"6414f60e2a9e4eb702169c45ad3bbeec4750475a76b2808a8af5af70f1def612","prominence":"central","quote":{"exact":"If R is an integral domain, then any two GCDs of a"},"quote_capped":true,"section":["In commutative rings"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"after":{"layer":", since by definition either one must divide the other.","segments":[{"text":", since by definition either one must divide the other."}]},"layer":"If R is an integral domain, then any two GCDs of a and b must be associate elements","segments":[{"text":"If R is an integral domain, then any two GCDs of a and b must be associate elements"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":4,"queries":4,"sha256":"844b32191d3b752d960f133acb3374325fc45c9db4423c8811b046027d7f87e7"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-12354-1372179102::In-text #207579ad","item":"In-text #207579ad","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"3c7649ae4a5d514274b15d6925f629484a6dacd0cfcd11146da2fcdc58b7566d","prominence":"supporting","quote":{"exact":"Indeed, if a GCD exists, any one of its associates is a"},"quote_capped":true,"section":["In commutative rings"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"Indeed, if a GCD exists, any one of its associates is a GCD as well.","segments":[{"text":"Indeed, if a GCD exists, any one of its associates is a GCD as well."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":3,"queries":4,"sha256":"57309c2574de0164c88694524d3223ddc7f705eee892ec8c4fb5163a42c4e18a"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-12354-1372179102::In-text #c5625267","item":"In-text #c5625267","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"ac4199b2b8fe05addc517496950a861614ccc2ed10a3ac9b3295552be0f35eca","prominence":"central","quote":{"exact":"Existence of a GCD is not assured in arbitrary integral domains."},"quote_capped":false,"section":["In commutative rings"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"Existence of a GCD is not assured in arbitrary integral domains.","segments":[{"text":"Existence of a GCD is not assured in arbitrary integral domains."}]},"unresolved":null},{"absence":null,"basis":"606d9672fd5dac1b2253040554a845b8efdc968e46c04d499a025ea21dc97719","coverage":null,"id":"enwiki-12354-1372179102::In-text #0c690d43","item":"In-text #0c690d43","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"instIsGCDMonoidOfUniqueFactorizationMonoid","end_line":51,"library":"mathlib","line":50,"location_key":"606d9672fd5dac1b2253040554a845b8efdc968e46c04d499a025ea21dc97719","module":"Mathlib.RingTheory.UniqueFactorizationDomain.GCDMonoid","note":"Lean records the property that every pair has a greatest common divisor as the class IsGCDMonoid, which is the article's gcd domain, so the second hypothesis named is the conclusion itself.","pair_key":"3238f7e4a3f66b70763669b8e4965531541ac1ca94967f7709182fb5e737ca9b","path":"Mathlib/RingTheory/UniqueFactorizationDomain/GCDMonoid.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance instIsGCDMonoidOfUniqueFactorizationMonoid (α : Type*) [CommMonoidWithZero α] [UniqueFactorizationMonoid α] : IsGCDMonoid α"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"UniqueFactorizationMonoid.toGCDMonoid","end_line":48,"library":"mathlib","line":30,"location_key":"60bba0a31379fe572a4c7e558f2f81ab287faf39fe7740b5c9e5ce37359526e6","module":"Mathlib.RingTheory.UniqueFactorizationDomain.GCDMonoid","note":"Lean builds a chosen gcd operation together with a least common multiple, where the article asserts only that a greatest common divisor is available.","pair_key":"147b85291c12ce052ccc41bbc7ccdadc08fed44c060e0ae530c4276d34ee0ea8","path":"Mathlib/RingTheory/UniqueFactorizationDomain/GCDMonoid.lean","proof_status":"definition","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def UniqueFactorizationMonoid.toGCDMonoid (α : Type*) [CommMonoidWithZero α] [UniqueFactorizationMonoid α] : GCDMonoid α"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"isGCDMonoid_iff_exists_gcd","end_line":1342,"library":"mathlib","line":1339,"location_key":"b1ee54d22b7db1a04092602b0ef57e9f23d65514177841e192b0a3acfd00c215","module":"Mathlib.Algebra.GCDMonoid.Basic","note":"It spells out the class as pointwise existence of a greatest common divisor.","pair_key":"3cead675e2b103e50e764afaab326d63747401aa85a6d1116e53e9ef62853072","path":"Mathlib/Algebra/GCDMonoid/Basic.lean","proof_status":"proved","rank":3,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem isGCDMonoid_iff_exists_gcd {α : Type*} [CommMonoidWithZero α] : IsGCDMonoid α ↔ IsCancelMulZero α ∧ ∀ (a b : α), ∃ c, ∀ (d : α), d ∣ a ∧ d ∣ b ↔ d ∣ c"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"78c5cb5f57292026cbd67097f8b41813bdf47f37592ae4fc59951ab17a1c27ac","prominence":"central","quote":{"exact":"However, if R is a unique factorization domain or any other GCD"},"quote_capped":true,"section":["In commutative rings"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"However, if R is a unique factorization domain or any other GCD domain, then any two elements have a GCD.","segments":[{"text":"However, if R is a unique factorization domain or any other GCD domain, then any two elements have a GCD."}]},"unresolved":null},{"absence":null,"basis":"6aef48ef3d3732c3d08c08ad381f378c826db7ed0e58a3a018251d4b3effab27","coverage":null,"id":"enwiki-12354-1372179102::In-text #88e57c0f","item":"In-text #88e57c0f","kind":"construction","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"EuclideanDomain.gcd","end_line":185,"library":"mathlib","line":180,"location_key":"6aef48ef3d3732c3d08c08ad381f378c826db7ed0e58a3a018251d4b3effab27","module":"Mathlib.Algebra.EuclideanDomain.Defs","note":"Lean's function recurses on the remainder of the division and uses a decidable equality test to stop, which is the effective division the article assumes.","pair_key":"73ca9cd8ef4d77ecf7cb7d7e2ba4b1487830ba92697c38ce7e1e3f8511c03789","path":"Mathlib/Algebra/EuclideanDomain/Defs.lean","proof_status":"definition","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def EuclideanDomain.gcd {R : Type u} [EuclideanDomain R] [DecidableEq R] : R → R → R"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"EuclideanDomain.gcd_val","end_line":135,"library":"mathlib","line":133,"location_key":"aa8b9be44486b54c034e25510eaa194281338a9b4672d1afbca7369733b12b20","module":"Mathlib.Algebra.EuclideanDomain.Basic","note":"Lean writes the recursion step as an equation on the gcd function, exchanging the arguments for the remainder and the divisor.","pair_key":"232440f61d619f5ac103fae0b11870d8baddb9783dca4399ee2027d612bd844a","path":"Mathlib/Algebra/EuclideanDomain/Basic.lean","proof_status":"proved","rank":2,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem EuclideanDomain.gcd_val {R : Type u} [EuclideanDomain R] [DecidableEq R] (a b : R) : EuclideanDomain.gcd a b = EuclideanDomain.gcd (b % a) a"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"EuclideanDomain.gcdMonoid","end_line":78,"library":"mathlib","line":70,"location_key":"6426a55e9dfa9e72fe55deeb69b56c74d843344f1db119e483127860d614af25","module":"Mathlib.RingTheory.EuclideanDomain","note":"Lean packages the computed gcd together with a least common multiple into a single structure.","pair_key":"2c8c07f84d55e6ec0b2897714ab6ad3e4b5f27039095b1563fbd0689007b21e9","path":"Mathlib/RingTheory/EuclideanDomain.lean","proof_status":"definition","rank":3,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def EuclideanDomain.gcdMonoid (R : Type*) [EuclideanDomain R] [DecidableEq R] : GCDMonoid R"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"248eed454cf4460deee3ac35a51ed41df70d2f71c0dd1c680bf892880464e323","prominence":"central","quote":{"exact":"If R is a Euclidean domain in which euclidean division is given"},"quote_capped":true,"section":["In commutative rings"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"If R is a Euclidean domain in which euclidean division is given algorithmically (as is the case for instance when R = F[X] where F is a field, or when R is the ring of Gaussian integers), then greatest common divisors can be computed using a form of the Euclidean algorithm based on the division procedure.","segments":[{"text":"If R is a Euclidean domain in which euclidean division is given algorithmically (as is the case for instance when R = F[X] where F is a field, or when R is the ring of Gaussian integers), then greatest common divisors can be computed using a form of the Euclidean algorithm based on the division procedure."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":3,"queries":5,"sha256":"918ed3c15b61c361e69d4047eab3fb16628025a77497c876c8222eb38a0d59af"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-12354-1372179102::In-text #d72ac9c0","item":"In-text #d72ac9c0","kind":"example","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"120babd97c1e6adaf6e06a4ba10e4016a6f77397d4a490d37a6e398d8d9f2897","prominence":"central","quote":{"exact":"The following is an example of an integral domain with two elements"},"quote_capped":true,"section":["In commutative rings"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"The following is an example of an integral domain with two elements that do not have a GCD: R = Z [ − 3 ] , a = 4 = 2 ⋅ 2 = ( 1 + − 3 ) ( 1 − − 3 ) , b = ( 1 + − 3 ) ⋅ 2. {\\displaystyle R=\\mathbb {Z} \\left[{\\sqrt {-3}}\\,\\,\\right],\\quad a=4=2\\cdot 2=\\left(1+{\\sqrt {-3}}\\,\\,\\right)\\left(1-{\\sqrt {-3}}\\,\\,\\right),\\quad b=\\left(1+{\\sqrt {-3}}\\,\\,\\right)\\cdot 2.}","segments":[{"text":"The following is an example of an integral domain with two elements that do not have a GCD: "},{"tex":"R=\\mathbb {Z} \\left[{\\sqrt {-3}}\\,\\,\\right],\\quad a=4=2\\cdot 2=\\left(1+{\\sqrt {-3}}\\,\\,\\right)\\left(1-{\\sqrt {-3}}\\,\\,\\right),\\quad b=\\left(1+{\\sqrt {-3}}\\,\\,\\right)\\cdot 2."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":3,"queries":4,"sha256":"59687bdcd4e9d1f87d2ba31a57d2eed9d7fbeca1e1b74c891daa05a233b35521"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-12354-1372179102::In-text #4fd992fb","item":"In-text #4fd992fb","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"2956946a28a30bb9d4de00c5dd474b973dc2e7fbc99cfb19a62818c22c7859c2","prominence":"supporting","quote":{"exact":"The elements 2 and 1 + − 3 {\\displaystyle 1+{\\sqrt {-3}}} are"},"quote_capped":true,"section":["In commutative rings"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"after":{"layer":", so there is no greatest common divisor of a and b.","segments":[{"text":", so there is no greatest common divisor of a and b."}]},"layer":"The elements 2 and 1 + − 3 {\\displaystyle 1+{\\sqrt {-3}}} are two maximal common divisors (that is, any common divisor which is a multiple of 2 is associated to 2, the same holds for 1 + − 3 {\\displaystyle 1+{\\sqrt {-3}}} , but they are not associated","segments":[{"text":"The elements 2 and "},{"tex":"1+{\\sqrt {-3}}"},{"text":" are two maximal common divisors (that is, any common divisor which is a multiple of 2 is associated to 2, the same holds for "},{"tex":"1+{\\sqrt {-3}}"},{"text":" , but they are not associated"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"8bbf7758275993b6dd5354771029b3e6b55749a9091e7bc6f4c3a9e92cadd029"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-12354-1372179102::In-text #e84bf044","item":"In-text #e84bf044","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"896874c08e5e667a5d450ed89ed7a061488d3eba99d2777d4b1b0bbb5a5012e5","prominence":"supporting","quote":{"exact":"there is no greatest common divisor of a and b.","prefix":"o "},"quote_capped":false,"section":["In commutative rings"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"before":{"layer":"The elements 2 and 1 + − 3 {\\displaystyle 1+{\\sqrt {-3}}} are two maximal common divisors (that is, any common divisor which is a multiple of 2 is associated to 2, the same holds for 1 + − 3 {\\displaystyle 1+{\\sqrt {-3}}} , but they are not associated, so ","segments":[{"text":"The elements 2 and "},{"tex":"1+{\\sqrt {-3}}"},{"text":" are two maximal common divisors (that is, any common divisor which is a multiple of 2 is associated to 2, the same holds for "},{"tex":"1+{\\sqrt {-3}}"},{"text":" , but they are not associated, so "}]},"layer":"there is no greatest common divisor of a and b.","segments":[{"text":"there is no greatest common divisor of a and b."}]},"unresolved":null},{"absence":null,"basis":"b630316e901de097bf986ecfc7735c4b9a9d28392755dbf79996683bd887f242","coverage":null,"id":"enwiki-12354-1372179102::In-text #e6ebd1da","item":"In-text #e6ebd1da","kind":"construction","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Ideal.mem_span_pair","end_line":154,"library":"mathlib","line":153,"location_key":"b630316e901de097bf986ecfc7735c4b9a9d28392755dbf79996683bd887f242","module":"Mathlib.RingTheory.Ideal.Span","note":"Lean records the collection as membership in the span of the two-element set, with the coefficients written on the left of each factor, and states it for every semiring, which is a wider class than the passage's commutative rings.","pair_key":"ced48efbc3a678f1de479e8a7ac1ebbbcdcb7224abc7e43683e1d8ae479dc662","path":"Mathlib/RingTheory/Ideal/Span.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Ideal.mem_span_pair {α : Type u} [Semiring α] {x y z : α} : z ∈ Ideal.span {x, y} ↔ ∃ a b, a * x + b * y = z"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"7ca9e39152baf4f9d6da654798757c017ecfbb93df6cac897876093aeb7c5673","prominence":"central","quote":{"exact":"Corresponding to the Bézout property we may, in any commutative ring, consider"},"quote_capped":true,"section":["In commutative rings"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"Corresponding to the Bézout property we may, in any commutative ring, consider the collection of elements of the form pa + qb, where p and q range over the ring.","segments":[{"text":"Corresponding to the Bézout property we may, in any commutative ring, consider the collection of elements of the form pa + qb, where p and q range over the ring."}]},"unresolved":null},{"absence":null,"basis":"c67190ccc6b5e8755e985cdaca22ab6a31a9ea164c2b52713c5b4d0cdbb01664","coverage":null,"id":"enwiki-12354-1372179102::In-text #96624094","item":"In-text #96624094","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Ideal.mem_span_pair","end_line":154,"library":"mathlib","line":153,"location_key":"c67190ccc6b5e8755e985cdaca22ab6a31a9ea164c2b52713c5b4d0cdbb01664","module":"Mathlib.RingTheory.Ideal.Span","note":"Lean's name for the ideal the passage writes as (a, b) is the span of the two-element set, and the lemma pins down its elements by the combination formula; it is phrased elementwise and for arbitrary semirings.","pair_key":"cd35f28a580f6a9118c15024a140e0a60aa30801edb2bf8e869fa2e04d40ecfe","path":"Mathlib/RingTheory/Ideal/Span.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Ideal.mem_span_pair {α : Type u} [Semiring α] {x y z : α} : z ∈ Ideal.span {x, y} ↔ ∃ a b, a * x + b * y = z"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"44944c51c49083e84cc27c026d9cf8af21cbc1f2f0930e418091b07f030c0187","prominence":"central","quote":{"exact":"This is the ideal generated by a and b, and is denoted"},"quote_capped":true,"section":["In commutative rings"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"This is the ideal generated by a and b, and is denoted simply (a, b).","segments":[{"text":"This is the ideal generated by a and b, and is denoted simply (a, b)."}]},"unresolved":null},{"absence":null,"basis":null,"coverage":{"basis":true,"bundle_key":"5826ea6ee84d6332e3a9d65da11595ee4db938729222ca5a49579796046ec4a4","challenge":"survived","complete":true,"conjuncts":[{"id":"c1","part":"2dbd9af11dd954bed079f4b4c17adead403edd0d370d2259395468f373550e18","text":"in a ring whose ideals are all principal, the ideal generated by a and b consists of the multiples of some ring element d"},{"id":"c2","part":"cda011e8651e249f0161af710d302e5d1a7f1bda623cad76aa325058f0ed93ab","text":"such an element d is a greatest common divisor of a and b"}],"parts":["2dbd9af11dd954bed079f4b4c17adead403edd0d370d2259395468f373550e18","cda011e8651e249f0161af710d302e5d1a7f1bda623cad76aa325058f0ed93ab"],"relation":"broadMatch","status":"formalized"},"id":"enwiki-12354-1372179102::In-text #0fb30df0","item":"In-text #0fb30df0","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Submodule.IsPrincipal.mem_iff_generator_dvd","end_line":136,"library":"mathlib","line":135,"location_key":"2dbd9af11dd954bed079f4b4c17adead403edd0d370d2259395468f373550e18","module":"Mathlib.RingTheory.PrincipalIdealDomain","note":"The lemma is stated for an arbitrary principal ideal of a commutative semiring, so it reaches well past the pair ideal of a principal ideal domain, and Lean expresses being a multiple of d as divisibility by d.","pair_key":"b22beb0bd40f0712163950d2d3eb2f1015d6ce4e1e454d44d473d085a37af7e3","path":"Mathlib/RingTheory/PrincipalIdealDomain.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Submodule.IsPrincipal.mem_iff_generator_dvd {R : Type u} [CommSemiring R] (S : Ideal R) [Submodule.IsPrincipal S] {x : R} : x ∈ S ↔ Submodule.IsPrincipal.generator S ∣ x"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Submodule.IsPrincipal.dvd_generator_span_iff","end_line":162,"library":"mathlib","line":157,"location_key":"cda011e8651e249f0161af710d302e5d1a7f1bda623cad76aa325058f0ed93ab","module":"Mathlib.RingTheory.PrincipalIdealDomain","note":"This is the divisibility-preorder reading of being a greatest common divisor that the article itself adopts, and the lemma gives it for any generating set whose span is principal.","pair_key":"1fead9e96f19fa51217422fc59c8b54c2a2b0be73fef1caeebdedc3461a6f688","path":"Mathlib/RingTheory/PrincipalIdealDomain.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Submodule.IsPrincipal.dvd_generator_span_iff {R : Type u} [CommSemiring R] {r : R} {s : Set R} [Submodule.IsPrincipal (Ideal.span s)] : r ∣ Submodule.IsPrincipal.generator (Ideal.span s) ↔ ∀ x ∈ s, r ∣ x"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"68e441c637f89cbc71046d54da943ae6940eee85d0b4ef510627dee1893a494a","prominence":"central","quote":{"exact":"In a ring all of whose ideals are principal (a principal ideal"},"quote_capped":true,"section":["In commutative rings"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=12354&oldid=1372179102","text":{"layer":"In a ring all of whose ideals are principal (a principal ideal domain or PID), this ideal will be identical with the set of multiples of some ring element d; then this d is a greatest common divisor of a and b.","segments":[{"text":"In a ring all of whose ideals are principal (a principal ideal domain or PID), this ideal will be identical with the set of multiples of some ring element d; then this d is a greatest common divisor of a and b."}]},"unresolved":null}],"provenance":{"challenge":{"harvested":"2026-11-01T14:25:17Z","mode":"locate-challenge","model":"claude-opus-5","model_name":"Claude Opus 5","operator":"jack","reviewer_model":"claude-opus-5","reviewer_model_name":"Claude Opus 5","run_id":"chal-tierA-b1","sampling":{"absence_sample_rate":0.25,"sample_rate":0.2,"seed":0,"strong_sample_rate":0.5},"skill_commit":"d85385aa4eb2818373e9b6b8b41b765ffaf53750","started":"2026-11-01T03:19:32Z"},"inventory":{"harvested":"2026-10-30T20:00:47Z","mode":"locate-inventory","model":"claude-opus-5","model_name":"Claude Opus 5","operator":"jack","reviewer_model":"claude-opus-5","reviewer_model_name":"Claude Opus 5","run_id":"inv-tierA-b1r","skill_commit":"d85385aa4eb2818373e9b6b8b41b765ffaf53750","started":"2026-10-30T07:23:03Z"},"locate":{"harvested":"2026-11-01T03:06:57Z","mode":"locate","model":"claude-opus-5","model_name":"Claude Opus 5","operator":"jack","reviewer_model":"claude-opus-5","reviewer_model_name":"Claude Opus 5","run_id":"loc-tierA-b1b","skill_commit":"d85385aa4eb2818373e9b6b8b41b765ffaf53750","started":"2026-10-31T04:59:09Z"}},"reader":{"bytes":256842,"images":[{"author":"The original uploader was Michael Hardy at English Wikipedia. New version by ElectroKid (☮ • ✍)","file":"24x60.svg","licence":"CC0","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/deed.en","project":"commons"},{"author":"Hyacinth","file":"Greatest_common_divisor.png","licence":"Public domain","licence_url":null,"project":"commons"},{"author":"Headbomb","file":"Lock-gray-alt-2.svg","licence":"CC0","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/deed.en","project":"commons"},{"author":"User:Trappist the monk","file":"Lock-green.svg","licence":"CC0","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/deed.en","project":"commons"},{"author":"VulpesVulpes42, Headbomb","file":"Lock-red-alt-2.svg","licence":"CC0","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/deed.en","project":"commons"},{"author":"Tkgd2007","file":"Question_book-new.svg","licence":"Cc-by-sa-3.0","licence_url":"https://creativecommons.org/licenses/by-sa/3.0/","project":"en"},{"author":"philiprbrenan","file":"The_Great_Common_Divisor_of_62_and_36_is_2.ogv","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0","project":"commons"},{"author":"cmglee","file":"Visual_proof_lcm_gcd_product.svg","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0","project":"commons"}],"marks":1255,"passages":125,"sha256":"d75f3ee9066601c3928236ab45c40498b9a0b20e25f425e7d55097c330397354","unplaced":["enwiki-12354-1372179102::In-text #cb4dc3cd"]},"record_set":"23710337d053e8212378a9e580805628bcdfda61a6fc431e65f24a4a16c9e602","records_sha256":"35ccb67165d4e26a037b35ca0acdc41663eb637522e18c955df303d637f7f9fe","revision":1372179102,"schema":"wikilean.articles.article/1","seal":{"created":"2026-11-01T14:25:17Z","schema":"cf-locate-recordset/2","set_id":"tierA-b1b","skill_commit":"d85385aa4eb2818373e9b6b8b41b765ffaf53750","status_rule":3},"source":{"html_sha256":"bba43df458af2905ecbcf73ab9ca1b301cd3ce3b1ba9aba1da87ee0df7c4577d","layer_sha256":"4faea2f449d3061e2ddb75eb63b9bd006b62d4e8358655cfe8c0dda1fdd76062","renderer":"web-html/3"},"source_id":"enwiki-12354-1372179102","summary":{"by_library":{"atlas":{"complete":1,"incomplete":0,"locations":1,"passages":1,"related":0},"lean-core":{"complete":52,"incomplete":0,"locations":52,"passages":32,"related":15},"mathlib":{"complete":64,"incomplete":0,"locations":64,"passages":43,"related":12},"tauceti":{"complete":3,"incomplete":0,"locations":3,"passages":3,"related":1}},"by_prominence":{"central":{"by_status":{"formalized":28,"not_formalized":19,"partial":13,"statement_only":0,"unresolved":0},"passages":60},"subject":{"by_status":{"formalized":1,"not_formalized":0,"partial":0,"statement_only":0,"unresolved":0},"passages":1},"supporting":{"by_status":{"formalized":16,"not_formalized":45,"partial":3,"statement_only":0,"unresolved":1},"passages":65}},"by_proof_status":{"definition":26,"proved":122},"by_relation":{"broadMatch":50,"closeMatch":21,"exactMatch":6,"hasPart":19,"narrowMatch":24,"relatedMatch":28},"by_status":{"formalized":45,"not_formalized":64,"partial":16,"statement_only":0,"unresolved":1},"locations":120,"passages":126,"related":28},"supplements":{"audit_summary":{"schema":"wikilean.articles.audit-summary/1","sha256":"53b29c5773caa9a3a339ccb36db38548137820e05477c4eff49dfb63a91b74df"},"passage_text":{"schema":"wikilean.articles.passage-text/1","sha256":"c0c740562cd14bdcabe43ac1d7ba81039d8e41ef850fd199d7151de6bb774885"},"provenance":{"schema":"wikilean.articles.provenance/1","sha256":"ea245b590ba9078bc0b79003dc1e311dc1421475fe49483e3e3a905ed7c7ec4e"},"reader_html":{"schema":"wikilean.articles.reader-html/1","sha256":"738196c11695087fc8e74590f5ac362acd61af48a8950c0a049559dd3902d2df"},"signatures":{"corpus_built":"2026-10-18T06:14:30Z","corpus_sha256":"a364fd6aede529da1c9f2fa13fda6230a26381f27dafc8801c4205e2b5cf5221","schema":"wikilean.articles.signatures/1","sha256":"2ebb5eebf8b2ebd1f615518abce6169661140cc54d5fcad5f4443150cc62d874","universe":"u1"}},"title":"Greatest common divisor","universe":{"frozen":"2026-10-17","id":"u1","libraries":48,"sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"wikidata":"Q131752"}
