Recursive style

Number Theory Level pending

Let \(A_n\) be a recursive formula that satisfies

\(A_1=k, \;\; A_2 \neq 2, \;\; A_n=D(A_{n-1}) \;\;\) where \(k\) is a positive integer and \(D(t)\) is the number of divisors of \(t\).

Does \(\{A\}\) contain a perfect square?

Bonus: prove your answer! \( :) \)


This problem is not original.

×

Problem Loading...

Note Loading...

Set Loading...