For your amusement (integer sequences)
Tuesday, December 15, 2009 14:59Posted in category Notes
No Comments
Neil Sloane, who is the father of the encyclopedia of integer sequences, has produced a paper, which highlights seven of them. There are no problems to solve there (other than some hard open ones!), but lots of interesting stuff. For example, you might like to try and prove the following result before reading it:
Consider the sequence defined as follows a(1) = 1, a(2) = 2, and for n >= 3, a(n) is the smallest positive integer not yet in the sequence such that gcd(a(n), a(n-1)) > 1. Prove that every positive integer eventually appears in the sequence.
You can follow any responses to this entry through the RSS 2.0 feed.
You can leave a response, or trackback from your own site.