Number TheoryHardDivisibility
Divisibility · Hard problem
Since and , a number leaves the same remainder mod as the alternating sum of its three-digit blocks taken from the right. Use this to find the remainder when is divided by .
Since and , a number leaves the same remainder mod as the alternating sum of its three-digit blocks taken from the right. Use this to find the remainder when is divided by .