Problem #WSP-5317

Problems Number Theory Divisibility

Problem

Let a and b be two different 9-digit numbers. It is known that each one of them contains all of the digits 1,2,...9. Find the maximal value of gcd(a,b).