perplexus.info :: Just Math : Triangular Triangulation

Triangular Triangulation (Posted on 2014-08-30)

Define T(N) as the Nth triangular number.

Each of X and Y is a positive integer such that:
Each of T(X)+T(Y) and X+Y is a triangular number.

Does there exist an infinite number of pairs (X,Y) that satisfy the given conditions? Give reasons for your answer.

Submitted by K Sengupta

Rating: 5.0000 (1 votes)

Solution: (Hide)

There exist an infinite number of pairs (X,Y) that satisfy the given conditions.
For an explanation, refer to the solution submitted by broll here and here.

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

Subject	Author	Date
re(2): As many as you want.	broll	2014-09-02 01:49:43
re: As many as you want.	Harry	2014-09-01 22:14:14
As many as you want.	broll	2014-08-31 06:02:40
They do seem to keep on coming -- no proof either way	Charlie	2014-08-30 14:46:28

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 (5)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:


perplexus dot info