jump to navigation

Problem of the Day #428: The Jar of Numbers January 3, 2013

Posted by Saketh in : potd , trackback

Owl has a jar of numbers. Any two numbers in the jar have a common divisor greater than one, yet the greatest common divisor of all the numbers is one. Furthermore, there does not exist any pair of numbers in the jar such that one divides the other.

Can you establish an upper bound on the number of numbers in the jar?


no comments yet - be the first?