Please help: :confused:

Find all composite integersMsuch that the product 2005 *Mhas exactly eight divisors.

Printable View

- April 29th 2005, 02:26 PMmathsmadPlease help
Please help: :confused:

Find all composite integers*M*such that the product 2005 **M*has exactly eight divisors. - April 29th 2005, 07:54 PMhpeQuote:

Originally Posted by**mathsmad**

If M is allowed to be prime, any prime number not equal to 5 or 401 will do.

If M is composite and has a prime factor other than 5 or 401, there will be too many factors. Similar if M is divisible by 5*5*401 or 5*401*401.

So only powers of 5 or 401 remain. Counting divisors for the cases M = 5^k, k > 2 and M = 401^k, k > 2 shows that these have too many divisors. This implies that the cases given above are the solution set. - May 14th 2005, 08:48 PMmathsmadThanks for the help
Thanks for the help