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

Home > Numbers
Powered GCD (Posted on 2016-01-19) Difficulty: 3 of 5
Determine, with proof, the greatest common divisor of this sequence of positive integers :
{16M + 10M – 1; M = 1, 2, .......}

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.broll2016-01-19 08:39:20
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 (18)
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