Back to Problems

agoh_giuga.variants.isStrongGiuga_growth

Specification

Let `G(X)` denote the number of exceptions `n ≤ X` to Giuga’s conjecture. Then for `X` larger than an absolute constant which can be made explicit, `G(X) ≪ X^{1/2} log X`. Ref: Vicentiu Tipu, _A Note on Giuga’s Conjecture_

Actions

Submit a Proof

Have a proof attempt? Submit it for zero-trust verification.

Submit Proof
Lean 4 Statement
theorem agoh_giuga.variants.isStrongGiuga_growth
    (G : ℕ → ℕ) (hG : G = fun x => Finset.Icc 1 x |>.filter IsStrongGiuga |>.card) :
    ∃ N O, ∀ n ≥ N, G n ≤ O * (n : ℝ).sqrt * (n : ℝ).log
ID: Wikipedia__AgohGiuga__agoh_giuga.variants.isStrongGiuga_growth
Browse 300 unsolved math conjectures formalized in Lean 4
Browse

All Problems

Explore all 300 unsolved conjectures.

View problems →
ASI Prize documentation for formal verification pipeline
Docs

Verification Pipeline

How zero-trust verification works.

Read docs →
Evaluation Results

Recent Submissions

No submissions yet. Be the first to attempt this problem.