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

Home > Games
Successive Stones Settlement (Posted on 2010-05-03) Difficulty: 3 of 5
A       B
|        |
|        |
D       C

Precisely one stone is situated initially at each of the four vertices of the square ABCD. It is permissible to change the number of stones according to the following rule:

Any move consists of taking n stones away from any vertex and adding 2n stones to either adjacent vertex.

Prove that it is not possible to get 1989, 1988, 1990 and 1989 stones respectively at the vertices A, B, C and D after a finite number of moves.

No Solution Yet Submitted by K Sengupta    
No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
Some Thoughts A bunch of random thoughts. | Comment 1 of 2
Some things to note about allowable moves:

Only one vertex can change parity on a given turn.
The total number of stones can only increase.
The total number of stones is 7956 = 4*1989.
The total number of stones must be increased by 7956-4 = 7952.
To increase the number of stones by a total of 7952, a total of 3976 must be removed.
Removing n stones is equivalent to removing 1 stone n times.
The number of one stone moves must be exactly 3976.
A one stone move changes the difference between two adjacent verticies by 3 (or -3) and the other differences change by 1 and -2 (or -1 and 2)
The total change of differences after a one stone move is either
-3+1-2 = -4
-3-1+2 = -2
3+1-2 = 2
3-1+2 = 4
The starting differences are 0,0,0,0 which sums to 0
The goal has differences of 1,2,1,0 which sums to 4.

I keep thinking I'm close but I haven't gotten there yet.

  Posted by Jer on 2010-05-05 16:20:55
Please log in:
Remember me:
Sign up! | Forgot password

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

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