Problem

Source: VII Caucasus Mathematical Olympiad

Tags: combinatorics



Let $S$ be the set of all $5^6$ positive integers, whose decimal representation consists of exactly 6 odd digits. Find the number of solutions $(x,y,z)$ of the equation $x+y=10z$, where $x\in S$, $y\in S$, $z\in S$.