Home > Numbers
| The replacement game (Posted on 2021-03-09) |
 |
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.
Comments: (
You must be logged in to post comments.)
|
|
Please log in:
Forums (0)
Newest Problems
Random Problem
FAQ |
About This Site
Site Statistics
New Comments (2)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On
Chatterbox:
|
