pith. machine review for the scientific record. sign in
theorem

repunit_three_composite

proved
show as:
view math explainer →
module
IndisputableMonolith.NumberTheory.Primes.ArithmeticFunctions
domain
NumberTheory
line
2368 · github
papers citing
none yet

open explainer

Generate a durable explainer page for this declaration.

open lean source

IndisputableMonolith.NumberTheory.Primes.ArithmeticFunctions on GitHub at line 2368.

browse module

All declarations in this module, on Recognition.

explainer page

Tracked in the explainer inventory; generation is lazy so crawlers do not trigger LLM jobs.

open explainer

depends on

formal source

2365theorem repunit_index_twentythree : Prime 23 := by native_decide
2366
2367/-- 111 = 3 × 37 is not prime (R_3 factors as 3 × 37, RS-relevant: 37). -/
2368theorem repunit_three_composite : ¬ Prime 111 ∧ 111 = 3 * 37 := by native_decide
2369
2370/-- 1111 = 11 × 101 is not prime (R_4 factors). -/
2371theorem repunit_four_composite : ¬ Prime 1111 ∧ 1111 = 11 * 101 := by native_decide
2372
2373/-- 11111 = 41 × 271 is not prime (R_5 factors). -/
2374theorem repunit_five_composite : ¬ Prime 11111 ∧ 11111 = 41 * 271 := by native_decide
2375
2376/-! ### Wieferich prime candidates -/
2377
2378/-- 1093 is prime (first Wieferich prime). -/
2379theorem prime_onethousandninetythree : Prime 1093 := by native_decide
2380
2381/-- 3511 is prime (second known Wieferich prime). -/
2382theorem prime_threethousandfiveeleven : Prime 3511 := by native_decide
2383
2384-- Note: primeCounting for values > 1000 requires careful verification
2385-- Leaving larger primeCounting values for future sessions
2386
2387/-! ### Primes in the 500s -/
2388
2389/-- 503 is prime. -/
2390theorem prime_fivehundredthree : Prime 503 := by native_decide
2391
2392/-- 509 is prime. -/
2393theorem prime_fivehundrednine : Prime 509 := by native_decide
2394
2395/-- 521 is prime. -/
2396theorem prime_fivehundredtwentyone : Prime 521 := by native_decide
2397
2398/-- 523 is prime. -/