Can you think of an elegant proof for this one?

Number Theory Level pending

How many pairs of the positive integers \((a, b)\) satisfy the following equation \[(15a+b)\cdot (15b+a)=3^k, k \in \mathbb{Z}\]

×

Problem Loading...

Note Loading...

Set Loading...