# CAT 2013: 25

0 votes
103 views

The age of a son, who is more than two years old, is equal to the units digit of the age of his father. After ten years, the age of the father will be thrice the age of the son. What is the sum of the present ages of the son and the father?

1. $30$ years
2. $36$ years
3. $40$ years
4. Cannot be determined

edited

0 votes
36
18 points 1

## Related questions

0 votes
0 answers
1
111 views
Functions $g$ and $h$ are defined on $n$ constants, $a_0,a_1,a_2,a_3,\dots a_{n−1}$, as follows: $\begin{array} g(a_p,a_q) & =a_{\mid p−q\mid}, \text{if } \mid p-q \mid \leq (n-4) \text{ and } \\ &=a_{n−\mid p−q\mid}, \text{if } \mid p-q\mid>(n-4) \end{array}$ ... $p+q$ is divided by $n$. If $n=10$, find the value of $g(g(a_2,a_8),g(a_1,a_7))$, $a_9$ $a_7$ $a_2$ $a_0$
0 votes
0 answers
2
108 views
Functions $g$ and $h$ are defined on n constants, $a_0,a_1,a_2,a_3,...a_{n−1}$, as follows: $g(a_p,a_q)=a\mid p−q\mid$ ,if $\mid p-q \mid\leq(n-4) =a_n−\mid p−q\mid$,if $\mid p-q\mid>(n-4) h (a_p,a_q)=a_k$, where $k$ is the remainder when $p+q$ is divided by $n$. If $h(a_k,a_m)=a_m$ for all $m$, where $1\leq m < n$ and $0 \leq k < n$, and $m$ is a natural number, find $k$. $0$ $1$ $n-1$ $n-2$
0 votes
0 answers
3
201 views
In a bag there are total of $150$ coins in three denominations $₹1,₹2$ and $₹5$ with at least one coin of each denomination being present in the bag. The total value of the Re.$1$ coins is at least $50\%$ of the total value of the coins in the bag. If there are $23\:₹5$ coins in ... least $3\%$ of the total value of the coins in the bag, find the number of $₹2$ coins in the bag. $2$ $3$ $4$ $1$
0 votes
0 answers
4
86 views
Let $P,Q,S,R,T,U$ and $V$ represent the seven distinct digits from $0$ to $6$, not necessarily in that order. If $PQ$ and $RS$ are both two-digit numbers adding up to the three-digit number $TUV$, find the value of $V$. $3$ $6$ $5$ $\text{Cannot be determined}$
0 votes
0 answers
5
129 views
There are five cards lying on a table in one row. Five numbers from among $1$ to $100$ have to be written on them, one number per card, such that the difference between the numbers on any two adjacent cards is not divisible by $4$ ... that order. How many sequences can be written down on the sixth card? $2^23^3$ $4(3)^4$ $4^23^3$ $4^23^4$