lean_workbook_plus_65865
ProvedThe answer is the number of positive integers in not divisible by 2 or 3, which is .
Preamble
import Mathlib.Analysis.Complex.Basic
Formal statement
theorem lean_workbook_plus_65865 : Finset.card (Finset.filter (λ x => ¬ 2∣x ∧ ¬ 3∣x) (Finset.Icc 2 999)) = 332 := by sorry
Source