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

 The Matchstick Man Strikes Back (Posted on 2012-03-07)

Take the same basic idea as in Matchstick Frenzy II - A heap of a positive integer number of matches (that is, no broken matches) is divided into n groups.

This time, we take from the first group the square of the number of matches in the second group and add to the second, then take from the second group the square of the number of matches in the third group and add to the third, and so on up to the nth group.

Finally we take from the nth group the square of the number of matches left in the first group and add them to the first group to make the number of matches in each group the same positive integer.

Now for the question: how many matches were there in the first group to start with?

 See The Solution Submitted by broll No Rating

Comments: ( You must be logged in to post comments.)
 Subject Author Date re(3): a solution for n=3 broll 2012-03-11 05:39:24 re(2): a solution for n=3 Dej Mar 2012-03-11 03:58:45 re: a solution for n=3 broll 2012-03-10 15:26:23 a solution for n=3 Dej Mar 2012-03-10 14:58:20 Solution Larry 2012-03-09 20:29:57

 Search: Search body:
Forums (2)