olymmath

CGMO 2020 Problem 6

    Let p,qp, q be integers and p,q>1p, q > 1 , gcd(p,6q)=1gcd(p, 6q)=1 . Prove that: ∑k=1q−1⌊pkq⌋2≡2p∑k=1q−1k⌊pkq⌋(modq−1)\sum_{k=1}^{q-1}\left \lfloor \frac{pk}{q}\right\rfloor^2 \equiv 2p \sum_{k=1}^{q-1}k\left\lfloor \frac{pk}{q} \right\rfloor (mod q-1)

    Dataset text AI-MO AoPS. Quoted with source.

    Solutions

    No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

    Add a solution

    Similar problems

    These problems have the most words in common with this statement.

    Locator cn-gmo/2020/p6 · Tag 3NE0N6W1JS · Edit this page on GitHub · Keys: j next, k previous