Home > Numbers
Powered GCD (Posted on 2016-01-19) |
|
Determine, with proof, the greatest common divisor of this sequence of positive integers :
{16M + 10M – 1; M = 1, 2, .......}
Comments: (
You must be logged in to post comments.)
|
Subject |
Author |
Date |
| Solution. | broll | 2016-01-19 08:39:20 |
|
|
Please log in:
Forums (0)
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:
|