leiko
Posts:
77
Registered:
8/7/09
|
|
seq question -again
Posted:
Oct 4, 2009 11:00 PM
|
|
hello everyone, I posted this a while ago, but no one responded, so i thought I should give it another try because probably not everyone has seen the earlier post.
If we have a recursion x_1=2, x_n=2^(x_n-1), how does one show that the sequence x_n(mod m) stabilizes in Z/mZ for any m ?
Thanks
|
|