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.

See The Solution Submitted by K Sengupta    
Rating: 5.0000 (1 votes)

Comments: ( You must be logged in to post comments.)
  Subject Author Date
SolutionSolution (Spoiler)Harry2010-05-07 22:24:49
Some ThoughtsA bunch of random thoughts.Jer2010-05-05 16:20:55
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (0)
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