perplexus.info :: Numbers : Powered GCD

Powered GCD (Posted on 2016-01-19)

Determine, with proof, the greatest common divisor of this sequence of positive integers :
{16^M + 10M – 1; M = 1, 2, .......}

Submitted by K Sengupta

Rating: 5.0000 (1 votes)

Solution: (Hide)

The required greatest common divisor of this sequence of positive integers is 25.
For an explanation, refer to

Analytical solution submitted by broll in this location.

Comments: ( You must be logged in to post comments.)

	Subject	Author	Date
	Solution.	broll	2016-01-19 08:39:20

Please log in:

Login:
Password:
Remember me:

Sign up! \| Forgot password

Search:

Search body:

Forums (1)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (6)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:


perplexus dot info