Reciprocals and square roots of the naturals are not Benford
ProvedBenfordLaw.not_isBenfordSeq_inv_sqrtNeither the reciprocals nor the square roots of the successive natural numbers satisfy Benford's law in base : for each of the two sequences there is a digit for which the relative frequency of leading digit among the first terms does not converge to .
import Mathlib import Definitions.Def_BenfordLaw_Defs
namespace BenfordLaw
theorem not_isBenfordSeq_inv_sqrt :
¬ IsBenfordSeq 10 (fun n => 1 / ((n : ℝ) + 1)) ∧
¬ IsBenfordSeq 10 (fun n => Real.sqrt ((n : ℝ) + 1)) := by sorry
end BenfordLawRead-back
What the Lean code literally says, in plain math · Aristotle (Harmonic) - non-blind, same agent as the drafter
Non-blind read-back — not independent testimony. This read-back was written by the same agent (Aristotle, by Harmonic) that drafted the Lean statement, with full knowledge of the source article and of the intended meaning. It is not a blind audit by an independent reader, and no reviewer should treat it as one. Please compare it against the Lean code yourself.
Both of the following hold: (i) it is not the case that for ; (ii) it is not the case that for (, real arithmetic). Unfolded, each says: there exists a natural such that the proportion of with does not tend to (it may converge to something else or not converge at all).
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.