No prose has been written for this declaration yet. The Lean source and graph data below render
without it.
generate prose now
formal statement (Lean)
398theorem primeCounting_hundred : primeCounting 100 = 25 := by
proof body
Term-mode proof.
399 native_decide
400
401/-- π is monotone: m ≤ n → π(m) ≤ π(n). -/
depends on (5)
Lean names referenced from this declaration's body.
-
is
in IndisputableMonolith.Foundation.OptionAEmpiricalProgram
decl_use
-
is
in IndisputableMonolith.Foundation.SimplicialLedger.EdgeLengthFromPsi
decl_use
-
is
in IndisputableMonolith.GameTheory.MechanismDesignFromSigma
decl_use
-
is
in IndisputableMonolith.Mathematics.RamanujanBridge.MockThetaPhantom
decl_use
-
primeCounting
in IndisputableMonolith.NumberTheory.Primes.ArithmeticFunctions
decl_use