A man visits four relatives on a day. He purchases some sweets and gives a part of it to the first relative. Next, he purchases the same number of sweets he is left with after he visited his first relative. He repeats this process while visiting his other relatives. Finally, he gives all the sweets to his fourth relative. It is known that he gives equal number of sweets to all the relatives and is left with no sweets after the fourth relative. Assuming that he initially purchased more than 20 sweets, the minimum number of sweets he gave to each relative is _______________. (Answer in integer)
This problem involves a sequence of actions: giving sweets, then purchasing more sweets based on the remaining amount. We need to find the minimum number of sweets given to each relative ($x$) under specific conditions.
Let $A_0$ be the initial number of sweets purchased. Let $x$ be the equal number of sweets given to each of the 4 relatives. Let $S_i$ be the number of sweets remaining *after* visiting the $i$-th relative. The process involves giving $x$ sweets and then purchasing an additional amount equal to the remaining sweets.
We work backward from the final state:
We have the relationship $A_0 = \frac{15x}{8}$. We are given two conditions:
For $A_0$ to be an integer, $x$ must be a multiple of 8. Let $x = 8k$, where $k$ is a positive integer.
Substituting $x = 8k$ into the equation for $A_0$:
$ A_0 = \frac{15(8k)}{8} = 15k $Now, apply the condition $A_0 > 20$:
$ 15k > 20 $ $ k > \frac{20}{15} $ $ k > \frac{4}{3} $ $ k > 1.333... $Since $k$ must be an integer, the smallest possible integer value for $k$ is 2.
We need the minimum number of sweets given to each relative, which is $x$. Using the minimum value of $k$:
$ x = 8k = 8 \times 2 = 16 $The minimum number of sweets given to each relative is 16. The initial purchase would be $A_0 = 15 \times 2 = 30$, which satisfies $A_0 > 20$. Let's verify:
The process is consistent.
Ankita has to climb 5 stairs starting at the ground, while respecting the following rules:
1. At any stage, Ankita can move either one or two stairs up.
2. At any stage, Ankita cannot move to a lower step.
Let $F(N)$ denote the number of possible ways in which Ankita can reach the $N^{th}$ stair. For example, $F(1) = 1$, $F(2) = 2$, $F(3) = 3$. The value of $F(5)$ is ________.
Consider a spherical globe rotating about an axis passing through its poles. There are three points P, Q, and R situated respectively on the equator, the north pole, and midway between the equator and the north pole in the northern hemisphere. Let P, Q, and R move with speeds $v_P$, $v_Q$, and $v_R$, respectively.
Which one of the following options is CORRECT?