Prove that one can find 100 distinct pairs of integers such that every digit of each number is no less than 6 and the product of the numbers in each pair is also a number with all its digits being no less than 6. (4 points)
Source: Spring 2006 Tournament of Towns Junior A-Level #2
Tags: counting
Prove that one can find 100 distinct pairs of integers such that every digit of each number is no less than 6 and the product of the numbers in each pair is also a number with all its digits being no less than 6. (4 points)