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

Home > Numbers
January Math Challenge in 3 Parts (Posted on 2009-01-08) Difficulty: 3 of 5
Not often does a novel contain math problems. All Souls, by Christine Schutt, does. Here's a section of the chapter called "Numbers":

Siddons

The January Math Challenge had three parts:

Part I: Express as many of the perfect squares less than 1,000 as the sums of two or more consecutive integers as possible. Example: 9 = 4 + 5

Part II: The sequence 2, 3, 5, 6, 7, 8, 10, 11 consists of all positive integers that are not perfect squares. What is the 500th term of the sequence?

Part III: Find the largest positive integer such that each pair of consecutive digits forms a perfect square. Example: The number 364 is made up of the perfect squares 36 and 64.

Saperstein and Song both said it was easy.

"Then why don't you answer it and get a bag of M&M's?" Alex asked.

"Because we helped make it up."

Assume that in Part I, "consecutive integers" means "consecutive positive integers". There should also be an ellipsis ("...") after the 11 in Part II, to indicate the series continues indefinitely.

See how well you do on the "January Math Challenge".

See The Solution Submitted by Charlie    
Rating: 3.0000 (3 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
Solution Part III (spoiler) | Comment 1 of 7
Well, all we have to work with is 16, 25, 36, 49, 64 and 81

The only qualifying positive integers that don't start with zero are:

16, 164, and 1649
25
36, 364, and 3649
49
64 and 649
81, 816, 8164, and 81649

Final answer:  81649


  Posted by Steve Herman on 2009-01-08 13:11:28
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


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

Chatterbox:
Copyright © 2002 - 2024 by Animus Pactum Consulting. All rights reserved. Privacy Information