All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Numbers > Sequences
Flawless Series? (Posted on 2003-11-29) Difficulty: 3 of 5
What are the next three numbers in this sequence? 6, 28, 496, 8128, ... ? Please explain how you determined these three numbers.

See The Solution Submitted by SilverKnight    
Rating: 2.8889 (9 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
Penny's thoughts... not worth her name... | Comment 9 of 67 |
(In reply to SK and Gamer, a Penny for your thoughts... by Penny)

SK: "...provide an answer to the problem (and demonstrate the reasoning behind such interesting facts as the association between perfect numbers and Mersenne primes). All that said, I doubt it will be Penny."

Penny: "Any number of the form... blah blah blah... plug in some numbers... blah blah blah... Therefore the next three numbers in your puzzle are..."

Hmmm... interesting that Penny who ACTUALLY INTRODUCED into this thread the notion that Mersene primes are the manner to demonstrated what the next few numbers would be... doesn't seem to be able to do any more than CUT AND PASTE an answer... or plug some numbers into a formula.

Penny... put up or shut up...
Either (1) do what you claim to be able to do... or (2) stop your ranting about what you think you can do, but aren't able to.

I suggest that you either demonstrate WHY that formula might work, or better yet, show the answer (and how you got it) without relying on Mersene primes. But, *sigh*, again, I doubt Penny will be up to the task.

As for answering your new problem(s), you'll just have to submit them, and wait your turn. ;-)
  Posted by SilverKnight on 2003-11-29 20:28:57

Please log in:
Remember me:
Sign up! | Forgot password

Search body:
Forums (1)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (7)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Copyright © 2002 - 2019 by Animus Pactum Consulting. All rights reserved. Privacy Information