Step 1: Represent the total number of jewels. Let the total number of jewels be N. According to the problem:
Jewels in the first box = $\frac{1}{3}$N, Jewels in the second box = $\frac{k}{5}$N, Jewels in the third box = 66.
The total number of jewels is:
N = $\frac{1}{3}$N + $\frac{k}{5}$N + 66.
Step 2: Simplify the equation. Rearrange terms:
N − $\frac{1}{3}$N − $\frac{k}{5}$N = 66.
Combine terms:
$\left( 1 - \frac{1}{3} - \frac{k}{5} \right)$N = 66.
Simplify the coefficients:
$\left( \frac{3}{3} - \frac{1}{3} - \frac{k}{5} \right)$N = 66 = =\(>\) $\left( \frac{2}{3} - \frac{k}{5} \right)$N = 66.
Step 3: Solve for k. Since k is a positive integer, test values such that $\frac{2}{3} - \frac{k}{5} \(>\) 0$. Let k = 2:
$\frac{2}{3} - \frac{2}{5} = \frac{10}{15} - \frac{6}{15} = \frac{4}{15}$
Substitute into the equation:
$\frac{4}{15}$N = 66 = =\(>\) N = $\frac{66 \times 15}{4}$ = 990 jewels.
Answer: 990
Directions: In Question Numbers 19 and 20, a statement of Assertion (A) is followed by a statement of Reason (R).
Choose the correct option from the following:
(A) Both Assertion (A) and Reason (R) are true and Reason (R) is the correct explanation of Assertion (A).
(B) Both Assertion (A) and Reason (R) are true, but Reason (R) is not the correct explanation of Assertion (A).
(C) Assertion (A) is true, but Reason (R) is false.
(D) Assertion (A) is false, but Reason (R) is true.
Assertion (A): For any two prime numbers $p$ and $q$, their HCF is 1 and LCM is $p + q$.
Reason (R): For any two natural numbers, HCF × LCM = product of numbers.
A | B | C | D | Average |
---|---|---|---|---|
3 | 4 | 4 | ? | 4 |
3 | ? | 5 | ? | 4 |
? | 3 | 3 | ? | 4 |
? | ? | ? | ? | 4.25 |
4 | 4 | 4 | 4.25 |