olymmath

AMC 10 2021-fall-b Problem 22

  • Paper

For each integer n≥2n\geq 2, let SnS_n be the sum of all products jkjk, where jj and kk are integers and 1≤j<k≤n1\leq j<k\leq n. What is the sum of the 10 least values of nn such that SnS_n is divisible by 33? (A) 196(B) 197(C) 198(D) 199(E) 200\textbf{(A)}\ 196 \textbf{(B)}\ 197 \textbf{(C)}\ 198 \textbf{(D)}\ 199 \textbf{(E)}\ 200

Dataset text NuminaMath-1.5. Quoted with source.

Show the answer

197

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 amc10/2021-fall-b/p22 · Tag WVNRMAHZHH · Edit this page on GitHub · Keys: j next, k previous