![]() |
find the missing number
Hi MersenneForum,
I was doodling with a spreadsheet program. Can anyone find the missing number in this sequence? 1,4,32,224,1600,?,81152,578048, ... Also, what is the general form that will produce more numbers in the sequence? Best of luck. Regards, Matt [SPOILER]There are two arbitrary initial values[/SPOILER] |
[QUOTE=MattcAnderson;459035]Hi MersenneForum,
I was doodling with a spreadsheet program. Can anyone find the missing number in this sequence? 1,4,32,224,1600,?,81152,578048, ... Also, what is the general form that will produce more numbers in the sequence? Best of luck. Regards, Matt [SPOILER]There are two arbitrary initial values[/SPOILER][/QUOTE] all I've got is all the numbers other than one shown are multiples of 4 ( in fact all the one shown greater than 4 are also multiples of 32), the sequence of differences repeatedly applied gives that if they are expressible as a polynomial it's first term must be of degree 4 or greater ( likely greater) I haven't tried CRG's fitExp and other codes on them. in theory other than they are said to follow a pattern it could be any number. |
The missing number is [SPOILER]11392[/SPOILER] and the formula is [SPOILER]a(n) = 6a(n-1) + 8a(n-2)[/SPOILER]. That also explains why [SPOILER]the number of factors of 2 tends to increase[/SPOILER].
|
2 Attachment(s)
Hi MersenneForum,
Thanks to all the readers and participants. Also, thanks to the Maple command 'rsolve' the expression [SPOILER]F(r)=2*F(r-1)+4*F(r-2)[/SPOILER] can be expressed as shown in the second attachment. Let me know if a .png file is no good for you. Regards, Matt |
1 Attachment(s)
Hi Mersenneforum,
Some of you may be familiar with the radical expression that goes with the Fibonacci sequence. [URL="https://en.wikipedia.org/wiki/Fibonacci_number#Relation_to_the_golden_ratio"]https://en.wikipedia.org/wiki/Fibonacci_number#Relation_to_the_golden_ratio[/URL] This should be similar. Regards, Matt |
Yes. The bases of the exponential expression are the roots of the characteristic equation of the recurrence, x^2 - 6x - 8.
|
[url]https://en.wikipedia.org/wiki/Lucas_sequence[/url]
|
What Number Should Replace the Question Mark?
1 Attachment(s)
Option :-
A) 9 B) 8 C) 6 D) 0 :question::question::question: Tell Me |
Hi Mersenneforum,
Many thanks to the responses so far. As a learning exercise it would be nice to know the steps between a 'recurrence relation of the first kind' and its 'characteristic equation'. From the Wikipedia article on Lucas Sequence, we see this - Explicit expressions, The characteristic equation of the recurrence relation for Lucas sequences x^2 - Px + Q = 0 Must go. Matt |
The characteristic equation of a recurrence of the form
a(n) = A*a(n-1) + B*a(n-1) + C*a(n-2) + D*a(n-3) is x^4 - Ax^3 - Bx^2 - Cx - D and you extend this to lower or higher degree in the obvious way. |
[QUOTE=CRGreathouse;459427]The characteristic equation of a recurrence of the form
a(n) = A*a(n-1) + B*a(n-1) + C*a(n-2) + D*a(n-3) is x^4 - Ax^3 - Bx^2 - Cx - D and you extend this to lower or higher degree in the obvious way.[/QUOTE] I am just nit-picking: "x^4 - Ax^3 - Bx^2 - Cx - D" is not an equation. I think you meant "x^4 - Ax^3 - Bx^2 - Cx - D = 0" :smile: |
| All times are UTC. The time now is 03:56. |
Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.