Find the number of sets of $(a,b,c)$ for $\frac{1}{a}+\frac{1}{b}+\frac{1}{c}=\frac{29}{72}$ 
If $\dfrac{1}{a}+\dfrac{1}{b}+\dfrac{1}{c}=\dfrac{29}{72},\ \ c<b<a<60,\ \ \{a,b,c\}\in\mathbb{N} $.
How many sets of $(a,b,c)$ exists ?

Options
$a.)\ 3 \quad \quad \quad \quad \quad b.)\ 4 \\
c.)\ 5 \quad \quad \quad \quad \quad \color{green}{d.)\ 6} \\ $ 
by trial and error i found 
$$\begin{array}{c|c} 
2 & 72 \\ \hline
2 &36  \\ \hline
2 &18 \\ \hline
3 &9 \\ \hline
3 &3 \\ \hline
 &1\\
 \end{array}$$
$\\~\\~\\$
$$\dfrac{29}{72}=\dfrac{18}{72}+\dfrac{9}{72}+\dfrac{2}{72}= \dfrac{1}{c}+\dfrac{1}{b}+\dfrac{1}{a}\\~\\
\implies (a,b,c)=(36,8,4)$$
This question is from chapter quadratic equations.
I look for a short and simple way.
I have studied maths up to $12$th grade.

This cannot be done without a somewhat clumsy search. The aim then is to keep the number of cases to check as small as possible.
We are looking for integer solutions of
$${1\over a}+{1\over b}+{1\over c}={29\over72}$$
with $1\leq c<b<a$. 
The conditions
$${1\over c}<{29\over 72},\qquad{1\over c}+{1\over c+1}+{1\over c+2}\geq{29\over 72}$$
imply $3\leq c\leq 6$.
Given $c$ in this range, put $$q:={29\over 72}-{1\over c}\ .$$ We then have to solve
$${1\over a}+{1\over b}=q\ .$$
The conditions for $b$ are
$$b>c,\qquad {1\over b}<q, \qquad {1\over b}>{q\over2}\ ,$$
the third of these in order to guarantee $a>b$. This enforces
$$\max\left\{{1\over q},c\right\}<b<{2\over q}\ .$$
Given $b$ in this range we have to check whether the resulting
$$ a={b\over bq-1}$$
is integer. If yes, we accept the triple $(a,b,c)$. Mathematica found $7$ such triples, three of which violated the extra condition $a<60$. Here is the output:

