mersenneforum.org > Math An interesting series
 Register FAQ Search Today's Posts Mark Forums Read

 2005-11-02, 05:33 #1 Citrix     Jun 2003 110001100012 Posts An interesting series I have been playing with this series, the numbers in the series have been very easy to factor. Here is how to generate the series. Let t(n)!= t(n)*t(n-1)*t(n-2)...t(0) Start with seed s=t(0) t(1)=smallest factor of (s^2+1) that is already not in the series t(2)=smallest factor of ((s+t(1)!)^2+1) that is already not in the series t(3)=smallest factor of ((s+t(1)!+t(2)!)^2+1) that is already not in the series and so on. Now the question is that for say seed s=1, do you ever run out of the new terms to add in the series. Can it be proven that you never run out of factors for a random s? Any solutions? A similar problem! (Series 2) Start with seed s=t(0) t(1)=smallest factor of (s^2+1) that is already not in the series t(2)=smallest factor of ((s+t(1))^2+1) that is already not in the series t(3)=smallest factor of ((s+t(1)+t(2))^2+1) that is already not in the series and so on. For what seeds will you run out of factors and for which you never run out of factors. For seed=1,2 you do. Citrix

 Similar Threads Thread Thread Starter Forum Replies Last Post siegert81 GPU Computing 47 2011-10-14 00:49 Wacky Puzzles 31 2006-09-14 16:17 jasong Puzzles 3 2006-09-09 04:34 Gary Edstrom Puzzles 7 2003-07-03 08:32 Rosenfeld Puzzles 2 2003-07-01 17:41

All times are UTC. The time now is 05:44.

Tue Dec 7 05:44:36 UTC 2021 up 137 days, 13 mins, 0 users, load averages: 1.44, 1.51, 1.56