Problem #PRU-100613

Problemas Teoría de Números Divisibilidad El máximo común divisor (MCD) y el mínimo común múltiplo (MCM). Números mutuamente primos

Problem

I have written \(5\) composite (not prime and not \(1\)) numbers on a piece of paper and hidden it in a safe locker. Every pair of these numbers is relatively prime. Show that at least one of these numbers has to be larger than \(100\).