MathDB
Divisibility on 2 numbers with same amount of digits.

Source: Olimpiada Rioplatense 2013 Level 3, Problem 5.

August 7, 2014
number theorygreatest common divisormodular arithmeticalgorithmnumber theory proposed

Problem Statement

Find all positive integers nn for which there exist two distinct numbers of nn digits, a1a2an\overline{a_1a_2\ldots a_n} and b1b2bn\overline{b_1b_2\ldots b_n}, such that the number of 2n2n digits a1a2anb1b2bn\overline{a_1a_2\ldots a_nb_1b_2\ldots b_n} is divisible by b1b2bna1a2an\overline{b_1b_2\ldots b_na_1a_2\ldots a_n}.