mersenneforum.org  

Go Back   mersenneforum.org > Extra Stuff > Miscellaneous Math

Reply
 
Thread Tools
Old 2017-07-01, 14:45   #1
MattcAnderson
 
MattcAnderson's Avatar
 
"Matthew Anderson"
Dec 2010
Oregon, USA

22×3×53 Posts
Default another defined sequence

HI Mersenne forum,

I want to shine a light on the hailstone problem.
Can somebody do a google search for me?
According to Numberphile on YouTube, there is a text book on this subject.
The Wikipedia article is my next step.

Regards,
Matt
Attached Files
File Type: pdf fibonacci sequence with coefficient.pdf (70.3 KB, 53 views)
MattcAnderson is offline   Reply With Quote
Old 2017-07-01, 15:46   #2
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

925910 Posts
Default

You are describing the generalized Lucas sequences.
http://primes.utm.edu/top20/page.php?id=23 (and see other places)

They share many properties with Fib and Lucas (they are partial cases). Wagstaff numbers are a partial case, too!
Batalov is offline   Reply With Quote
Old 2017-07-02, 16:33   #3
Dr Sardonicus
 
Dr Sardonicus's Avatar
 
Feb 2017
Nowhere

23×181 Posts
Default

Quote:
Originally Posted by MattcAnderson View Post
HI Mersenne forum,

I want to shine a light on the hailstone problem.
Can somebody do a google search for me?
According to Numberphile on YouTube, there is a text book on this subject.
The Wikipedia article is my next step.

Regards,
Matt
(referring to OP's attached file)

For a monic quadratic x^2 - a*x - b, the Lucas- and Fibonacci-like sequences are

L0 = 2, L1 = a, Lk+2 = Lk+1 + b*Lk

F0 = 0, F1 = 1, Fk+2 = Fk+1 + b*Fk

These sequences have divisibility properties similar to those of the original Lucas and Fibonacci numbers.

Any sequence of rational numbers with the same recursion is a Q-linear combination of Ln and Fn.

With a = 1 and b = 10, we have

L0 = 2, L1 = 1, L2 = 21, L3 = 31, L4 = 251...

F0 = 0, F1 = 1, F2 = 1, F3 = 11, F4 = 21, ...

With a = 1, b = 10, the example sequence may be written ld(n) = (31*Fn - Ln)/5; ld(1) = 6, ld(2) = 2, ld(3) = 62, etc

The coefficients may be found easily by "reverse-engineering" the value ld(0) = -2/5, then noting that

F0 = 0 and L0 = 2, making the coefficient of Ln -1/5.

The coefficient of Ln is then easily seen to be 31/5.

I don't know offhand of any particularly "nice" divisibility properties for ld(n).

I also don't know any particular connection with the "hailstone problem," AKA the Collatz conjecture.
Dr Sardonicus is offline   Reply With Quote
Old 2017-07-03, 21:04   #4
MattcAnderson
 
MattcAnderson's Avatar
 
"Matthew Anderson"
Dec 2010
Oregon, USA

22×3×53 Posts
Default

Hi Mersenne forum,

Thank you for the good and constructive replies so far.

See attachment.

Regards,
Matt
Attached Files
File Type: txt temp.txt (33 Bytes, 53 views)
MattcAnderson is offline   Reply With Quote
Old 2017-07-05, 08:05   #5
carpetpool
 
carpetpool's Avatar
 
"Sam"
Nov 2016

2×163 Posts
Post

I don't know weather you are describing these sequences:

for an integer a,

Fibonacci Like sequences:

F(1) = 1
F(2) = a
F(n) = F(n-1)*a + F(n-2)

and

Lucas Like sequences:

L(1) = 1
L(2) = a^2+2
L(3) = a^2+3

L(n) = L(n-1) + L(n-2) if n is odd.

L(n) = (a^2+1)*L(n-1) - L(n-3) if n is even.
carpetpool is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Reserved for MF - Sequence 276 kar_bon Aliquot Sequences 127 2020-12-17 10:05
How is GIMPS' sustained throughput defined? NBtarheel_33 PrimeNet 86 2018-02-28 08:24
Primes in n-fibonacci sequence and n-step fibonacci sequence sweety439 And now for something completely different 17 2017-06-13 03:49
SZPTR - whare is it defined tichy Software 4 2010-12-22 09:02
Sequence Citrix Puzzles 5 2005-09-14 23:33

All times are UTC. The time now is 09:57.

Tue Jan 19 09:57:07 UTC 2021 up 47 days, 6:08, 0 users, load averages: 1.19, 1.61, 1.84

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.