A Remainder Problem

Number Theory Level pending

Find the number of integers \(n\), where \(n > 2\), such that, the remainder when \(2015\) is divided by \(n\) is equal to the remainder when \(n\) is divided by \(3\).

×

Problem Loading...

Note Loading...

Set Loading...