theorem
proved
primeCounting_three
show as:
view math explainer →
open explainer
Generate a durable explainer page for this declaration.
open lean source
IndisputableMonolith.NumberTheory.Primes.ArithmeticFunctions on GitHub at line 366.
browse module
All declarations in this module, on Recognition.
explainer page
depends on
formal source
363 native_decide
364
365/-- π(3) = 2. -/
366theorem primeCounting_three : primeCounting 3 = 2 := by
367 native_decide
368
369/-- π(5) = 3. -/
370theorem primeCounting_five : primeCounting 5 = 3 := by
371 native_decide
372
373/-- π(10) = 4. -/
374theorem primeCounting_ten : primeCounting 10 = 4 := by
375 native_decide
376
377/-- π(7) = 4. -/
378theorem primeCounting_seven : primeCounting 7 = 4 := by
379 native_decide
380
381/-- π(11) = 5. -/
382theorem primeCounting_eleven : primeCounting 11 = 5 := by
383 native_decide
384
385/-- π(13) = 6. -/
386theorem primeCounting_thirteen : primeCounting 13 = 6 := by
387 native_decide
388
389/-- π(17) = 7. -/
390theorem primeCounting_seventeen : primeCounting 17 = 7 := by
391 native_decide
392
393/-- π(20) = 8. -/
394theorem primeCounting_twenty : primeCounting 20 = 8 := by
395 native_decide
396