Root Problem

• Apr 21st 2010, 05:38 PM
MATNTRNG
Root Problem
Find the smallest integer greater than 1 that has a square root, a cube root, a fourth root, a fifth root, a sixth root, a seventh root, an eighth root, a ninth root, and a tenth root, all perfect.
• Apr 21st 2010, 07:10 PM
undefined
Quote:

Originally Posted by MATNTRNG
Find the smallest integer greater than 1 that has a square root, a cube root, a fourth root, a fifth root, a sixth root, a seventh root, an eighth root, a ninth root, and a tenth root, all perfect.

I think it's 2^x

where x = lcm(2,3,4,...,10).

By the way, where did you get these problems?

EDIT: I might have misinterpreted this problem. Thinking of perfect powers, I interpreted that the square root through tenth root are all integer. But if we further require that they be perfect numbers then I have no idea what the solution looks like.
• Apr 22nd 2010, 06:57 AM
MATNTRNG
By the way, where did you get these problems?

hell
• Apr 24th 2010, 12:03 AM
CaptainBlack
Quote:

Originally Posted by MATNTRNG
Find the smallest integer greater than 1 that has a square root, a cube root, a fourth root, a fifth root, a sixth root, a seventh root, an eighth root, a ninth root, and a tenth root, all perfect.

Suppose $n$ is a natural number with integer $2$-dn, $3$-rd, ... $k$-th roots. Now consider the prime decomposition of $n$ :

$n=\prod_{i=1}^m p_i^{\alpha_i}$

Clearly for each $i$ we must have $\alpha_i$ is divisible by $2, 3, .., k$. Hence the smallest natural with the given property is:

$n=2^{\text{lcm}(2,3,..,k)}$

because this number has the required property and any other number with this property must be the product of powers of primes each such power also having the property etc.

CB