Detail of message

Online Judge

Problem Set

Authors

Online Contests

User

Web Board
Home Page
F.A.Qs
Statistical Charts

Current Contest
Past Contests
Scheduled Contests
Award Contest

the proof is trivial...

Posted by frkstyc at 2006-01-24 17:50:12 on Problem 2748
In Reply To:Re:75000 is enough... simple maths, just program to calculate the minimum n that a[n]=a[n+1]=1(mod 10^5) Posted by:fjnu_jxd_010 at 2006-01-24 17:45:13

> but can you proof it by math?

first evaluate function to the 750001st term. now you see that f(0)=f
(750000) and f(1)=f(750001). since the recurrence is of the second order, 
750000 is now proven to be a period.

Followed by:

因为循环是二阶的？ (195) Gamme 2006-01-24 19:53:43
- 二阶的递推 (0) frkstyc 2006-01-24 20:13:51

Post your reply here:

Home Page Go Back To top