LoMaPuz
-
233
MVVM# - See how I did MVVM my way ___________________________________________ Man, you're a god. - walterhevedeich 26/05/2011 .\\axxx (That's an 'M')
Nope. Somebody is going to get the answer by chance at this rate. :rolleyes:
-
It's neither 378 nor 379.
-
Nope. Somebody is going to get the answer by chance at this rate. :rolleyes:
But I can justify my answer Your numbers 1,1,3,8,55,... Fibonacci - with yours marked by X
0,
1, X First pair of numbers
1, X <-- next number
2, < Gap of one number
3, X Second pair of numbers
5,
8, X <-- next number +1
13,
21, < Gap of three numbers
34,
55, X Third pair of numbers
89,
144,
233, Z <-- next number plus 2
377,
610,
987So the sequence is pairs from the Fibonacci series, the gap between successive pairs increasing (1,3... presumably 5, 7, 9) while the gaps between each number in the pair increases by 1)
MVVM# - See how I did MVVM my way ___________________________________________ Man, you're a god. - walterhevedeich 26/05/2011 .\\axxx (That's an 'M')
-
It's neither 378 nor 379.
-
Logic / Math Puzzle... 1=1 2=1 3=3 4=8 5=55 6=? This is the first puzzle I've devised myself. I hope you don't solve it too fast. :)
Excel says the formula is
y = 1.5833x4 - 15.667x3 + 55.417x2 - 80.333x + 40so I get 221 for 6!? -
Logic / Math Puzzle... 1=1 2=1 3=3 4=8 5=55 6=? This is the first puzzle I've devised myself. I hope you don't solve it too fast. :)
-
But I can justify my answer Your numbers 1,1,3,8,55,... Fibonacci - with yours marked by X
0,
1, X First pair of numbers
1, X <-- next number
2, < Gap of one number
3, X Second pair of numbers
5,
8, X <-- next number +1
13,
21, < Gap of three numbers
34,
55, X Third pair of numbers
89,
144,
233, Z <-- next number plus 2
377,
610,
987So the sequence is pairs from the Fibonacci series, the gap between successive pairs increasing (1,3... presumably 5, 7, 9) while the gaps between each number in the pair increases by 1)
MVVM# - See how I did MVVM my way ___________________________________________ Man, you're a god. - walterhevedeich 26/05/2011 .\\axxx (That's an 'M')
You are on the right track, but still not correct. I can tell you the answer if you want the pain to end. ;P
-
Excel says the formula is
y = 1.5833x4 - 15.667x3 + 55.417x2 - 80.333x + 40so I get 221 for 6!? -
Excel says the formula is
y = 1.5833x4 - 15.667x3 + 55.417x2 - 80.333x + 40so I get 221 for 6!?Nice try, but you did not excel at getting the correct answer.
-
Logic / Math Puzzle... 1=1 2=1 3=3 4=8 5=55 6=? This is the first puzzle I've devised myself. I hope you don't solve it too fast. :)
144 Points to anybody who can describe the pattern.
-
Logic / Math Puzzle... 1=1 2=1 3=3 4=8 5=55 6=? This is the first puzzle I've devised myself. I hope you don't solve it too fast. :)
Two shots: a. 144 b. 987 If one of these is right, I'll tell you where they came from! ;P Cheers, Peter [edit] should have refreshed! Didn't see your answer just above. [/edit]
Software rusts. Simon Stephenson, ca 1994.
-
Two shots: a. 144 b. 987 If one of these is right, I'll tell you where they came from! ;P Cheers, Peter [edit] should have refreshed! Didn't see your answer just above. [/edit]
Software rusts. Simon Stephenson, ca 1994.
Both of those are correct. I think you have the solution. What is it?
-
Both of those are correct. I think you have the solution. What is it?
a. Prime-indexed terms of the standard Fibonacci sequence b. Knuth's Fibonacci (or circle) product or, (where they came from) sequences A121567 and A101361 from the Online Encyclopedia of Integer Sequences[^] Just type "1,1,3,8,55" into the search box. That URL is a wonderful timewaster (and might even impress those who peek over your shoulder! :-D ) Cheers, Peter
Software rusts. Simon Stephenson, ca 1994.
-
a. Prime-indexed terms of the standard Fibonacci sequence b. Knuth's Fibonacci (or circle) product or, (where they came from) sequences A121567 and A101361 from the Online Encyclopedia of Integer Sequences[^] Just type "1,1,3,8,55" into the search box. That URL is a wonderful timewaster (and might even impress those who peek over your shoulder! :-D ) Cheers, Peter
Software rusts. Simon Stephenson, ca 1994.
You have just been awarded more points than I have ever awarded anybody! Sure, they're virtual points, but still. That's crazy that there's a website that actually lists that sequence. You are correct. This is how I would represent the sequence: f(n) = NthFibonacci(NthPrime(n)) Assuming the 1st Fibonacci number is 0 and the first prime is 2.
-
Both of those are correct. I think you have the solution. What is it?
AspDotNetDev wrote:
Both of those are correct.
That's BS!
-
AspDotNetDev wrote:
Both of those are correct.
That's BS!
They are the 6th and 7th elements of the sequence. Upset you didn't figure it out? ;P
-
They are the 6th and 7th elements of the sequence. Upset you didn't figure it out? ;P
AspDotNetDev wrote:
Upset you didn't figure it out?
No, upset at you for being ambiguous! ;p Thought it was both correct for 6 :(
-
42
The difficult we do right away... ...the impossible takes slightly longer.
-
Logic / Math Puzzle... 1=1 2=1 3=3 4=8 5=55 6=? This is the first puzzle I've devised myself. I hope you don't solve it too fast. :)
How about the 'Eban' numbers? 2, 4, 6, 30, 32, 34, 36, 40, 42, 44, 46, ... [EDIT] Or the 'emirps'? 13, 17, 31, 37, 71, 73, 79, 97, 107, 113, ... Get it? Or not?
Public Sub GetOffTheComputer() Throw New NotImplementedException() End Sub
-
a. Prime-indexed terms of the standard Fibonacci sequence b. Knuth's Fibonacci (or circle) product or, (where they came from) sequences A121567 and A101361 from the Online Encyclopedia of Integer Sequences[^] Just type "1,1,3,8,55" into the search box. That URL is a wonderful timewaster (and might even impress those who peek over your shoulder! :-D ) Cheers, Peter
Software rusts. Simon Stephenson, ca 1994.
Peter_in_2780 wrote:
That URL is a wonderful timewaster
I am now officially addicted to that site. It is a browser narcotic for nerds (sorry if I offended anyone!) -Z a.k.a. 'The Nerdinator' (don't ask...)
Public Sub GetOffTheComputer() Throw New NotImplementedException() End Sub
