olymmath

PAMO 2015 Problem 3

  • Day 1

Let a1,a2,...,a11a_1,a_2,...,a_{11} be integers. Prove that there are numbers b1,b2,...,b11b_1,b_2,...,b_{11} , each bib_i equal −1,0-1,0 or 11 , but not all being 00 , such that the number N=a1b1+a2b2+...+a11b11N=a_1b_1+a_2b_2+...+a_{11}b_{11} is divisible by 20152015 .

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 pamo/2015/p3 · Tag SR8KEXV7W2 · Edit this page on GitHub · Keys: j next, k previous