lean_workbook_plus_42799
ProvedVieta's gives that . We now have . Taking it we get . Taking it we get . Thus,
Preamble
import Mathlib.Analysis.Complex.Basic
Formal statement
theorem lean_workbook_plus_42799 (f g : ℕ) (h₀ : 0 < f ∧ 0 < g) (h₁ : 6 * f + 9 * g = 36) : (f, g) = (3, 2) ∨ (f, g) = (6, 0) ∨ (f, g) = (0, 4) := by sorry
Source