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

Home > Numbers
The replacement game (Posted on 2021-03-09) Difficulty: 3 of 5
The triplet (n-1, n, n+1) is written on a board where n is positive integer. A move consists of choosing two of the numbers a and b, replacing them with 2a-b and 2b-a thus creating a new triplet. After a succession of moves, two of the numbers are zeros. Find all possible values for n.

No Solution Yet Submitted by Danish Ahmed Khan    
No Rating

Comments: ( You must be logged in to post comments.)
  Subject Author Date
Hints/Tipsre: Observations, some valuesBrian Smith2021-03-09 11:28:51
Observations, some valuesJer2021-03-09 10:15:09
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


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

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