Recursive style

Let A n A_n be a recursive formula that satisfies

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

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

Bonus: prove your answer! : ) :)


This problem is not original.

Never Only when A 1 A_1 is a multiple of 4 4 Only when A 1 A_1 is prime Yes A 1 \forall A_1

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

0 solutions

No explanations have been posted yet. Check back later!

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...