perplexus.info :: Sequences : LCM and GCD Sequence

LCM and GCD Sequence (Posted on 2016-04-29)

Find all pairs (X,Y) of positive integers such that:
gcd(X,Y), lcm(X,Y)-1 and X^Y (in this order) are in arithmetic sequence.

Submitted by K Sengupta

Rating: 5.0000 (1 votes)

Solution: (Hide)

(x, y) =(1,2), (3,1), (3,2) corresponds to the requisite pairs that satisfy the given conditions.
For an explanation, refer to the solution submitted by Charlie in this location.

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

	Subject	Author	Date
	probable solution (spoiler)	Charlie	2016-04-29 11:30:46

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