Suppose for any positive integer \(n\), \(s(n)\) is the remainder when \(n\) is divided by \(19\). Find the number of pairs of integers \((a,b)\), such that \(1\leq a\leq b \leq 18,\) and for all \(k=1,2,...,18\)
\[k+s(ka)+s(kb)\geq 20\]

Excel in math and science

Master concepts by solving fun, challenging problems.

It's hard to learn from lectures and videos

Learn more effectively through short, interactive explorations.

Used and loved by over 6 million people

Learn from a vibrant community of students and enthusiasts,
including olympiad champions, researchers, and professionals.

Your answer seems reasonable.
Find out if you're right!