Question Detail

What is the smallest number by which 3600 be divided to make it a perfect cube.

Answer: Option A

Explanation:

\begin{aligned}
3600 = 2^3 \times 5^2 \times 3^2 \times 2
\end{aligned}
To make it a perfect cube it must be divided by
\begin{aligned}
5^2 \times 3^2 \times 2 = 450
\end{aligned}

1. Find the value of X
\begin{aligned} \sqrt{81} + \sqrt{0.81} = 10.09 - X \end{aligned}

0.019
0.19
0.9
0.109

Answer: Option B

Explanation:

\begin{aligned}
=> \sqrt{81} + \sqrt{0.81} = 10.09 - X
\end{aligned}

\begin{aligned}
=> 9 + 0.9 = 10.09 - X
\end{aligned}

\begin{aligned}
=> X = 10.09 - 9.9 = 0.19
\end{aligned}

2. \begin{aligned} \sqrt{\frac{32.4}{x}} = 2 \end{aligned}

Answer: Option B

3. Students of a class collected as many paise from each student of class as is the number of students in that class. If total collection is Rs. 59.29, then find the total number of students in the class.

Answer: Option C

Explanation:

So from the question it is clear that total sum collected was 59.29 rupees.
So total paise are 5929.
\begin{aligned}
\text{Total Members = } \sqrt{5929} \\
= 77
\end{aligned}

4. Evaluate
\begin{aligned}
\sqrt{6084}
\end{aligned}

Answer: Option C

5. The least perfect square, which is divisible by each of 21, 36 and 66 is

213414
213424
213434
213444

Answer: Option D

Explanation:

L.C.M. of 21, 36, 66 = 2772

Now, 2772 = 2 x 2 x 3 x 3 x 7 x 11

To make it a perfect square, it must be multiplied by 7 x 11.

So, required number = 2 x 2 x 3 x 3 x 7 x 7 x 11 x 11 = 213444

Anyela 11 years ago

Sure. If someone has the time to aswenr the questions, then it certainly is possible.When one reaches the higher levels in Yahoo! Answers, they are not restricted to the number of questions they can aswenr, and they can ask any number of questions they like they get stars, they get points. You get points for thumbs up to your aswenrs, and you get points for voting for questions in voting for a best aswenr .Yes it is possible. Just not for those of us that have to work and care for children. . .