By expressing 9464 in its prime factorization form, find the smallest integer y such that 9464 x y is a perfect cube.
2007-02-15 00:44:22 · 4 answers · asked by monochrome 4 in Science & Mathematics ➔ Mathematics
9464/2
4732/2
2366/2
1183/7
169/13
13
(2^3)*7*(13^2)
smallest integer is 637
2007-02-15 01:12:26 · answer #1 · answered by adriantheace 4 · 0⤊ 0⤋
A divisibility test for 3 is to find the sum of the digits. If the sum is divisible by 3 so is the original number. 5 + 0 + 1 = 6, so 501 must be divisible by 3. 501 = 3 x 167.
2016-05-24 03:01:42 · answer #2 · answered by Anonymous · 0⤊ 0⤋
9464 = 2^3 * 7 * 13^2
Since the factors of a perfect cube must be raised to the power of 3,6,9 etc., we have to multiply 7 two more times and 13 one more time therefore, 7^2*13=637.
However, cubes of integers may be negative, therefore the answer is -637, as -637 is less than 637 .
Hope that helps.
2007-02-15 01:00:37 · answer #3 · answered by math freak 3 · 0⤊ 0⤋
I WISH I KNEW BUT DON'T LET IT RUIN YOUR DAY. DON'T LET IT GET YOU DOWN. IT WILL COME TO YOU WHEN YOU LEAST EXPECT.
2007-02-15 00:51:57 · answer #4 · answered by Anonymous · 0⤊ 2⤋