Add rigorous partial solution for the Erdos-Moser equation

[charlesen]

This PR implements a detailed and rigorous mathematical proof strategy (Zero Ellipse compliance) to study the Erdős-Moser equation $1^k + 2^k + \dots + (m-1)^k = m^k$.

Details:

• Adds a new dynamic LaTeX generation script in inprogress/124-Erdos-Moser/generate_tex.py.
• Generates detailed, step-by-step rigorous English and French PDFs targeting analytical bounds (Euler-Maclaurin expansions) and $p$-adic prime divisor derivations.
• Formats outputs with a valid Lean 4 structure using standard theorem/lemma blocks ready for auto-formalization.
• Fixes verbatim tokenization issues and removes temporary scratchpad testing files from the git tree.
• Uses strict axiomatic definitions without AI meta-commentary, signed properly in the LaTeX footer.

---

PR created automatically by Jules for task 16643314734387234217 started by @charlesen

[google-labs-jules]

👋 Jules, reporting for duty! I'm here to lend a hand with this pull request.

When you start a review, I'll add a 👀 emoji to each comment to let you know I've read it. I'll focus on feedback directed at me and will do my best to stay out of conversations between you and other bots or reviewers to keep the noise down.

I'll push a commit with your requested changes shortly after. Please note there might be a delay between these steps, but rest assured I'm on the job!

For more direct control, you can switch me to Reactive Mode. When this mode is on, I will only act on comments where you specifically mention me with @jules. You can find this option in the Pull Request section of your global Jules UI settings. You can always switch back!

New to Jules? Learn more at jules.google/docs.

---

For security, I will only act on instructions from the user who triggered this task.

[chatgpt-codex-connector]

You have reached your Codex usage limits for code reviews. You can see your limits in the Codex usage dashboard.