Problem #PRU-73741

Problems Number Theory Numeral systems Decimal number system Methods Pigeonhole principle Pigeonhole principle (other)

Problem

An infinite sequence of digits is given. Prove that for any natural number \(n\) that is relatively prime with a number 10, you can choose a group of consecutive digits, which when written as a sequence of digits, gives a resulting number written by these digits which is divisible by \(n\).