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

Home > Numbers
Triangular Coordinates (Posted on 2004-10-26) Difficulty: 3 of 5
Prove that there are an infinite number of distinct ordered pairs (m, n) of integers such that, for every positive integer t, the number mt + n is a triangular number if and only if t is a triangular number as well

No Solution Yet Submitted by Victor Zapana    
Rating: 2.6667 (3 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
Solution Solution | Comment 4 of 11 |
First, we'll prove that m=9, n=1 satisfy the given conditions.

If t is triangular, t=n(n+1)/2, and mt+n=9n(n+1)/2+1 = (3n+1)(3n+2)/2, which is triangular. Vice versa, if 9t+1 is triangular, then 9t+1=n(n+1)/2, so n=3k+1 [n=3k or n=3k-1 don't produce a 9t+1 result] and we have 9t+1=9k(k+1)/2+1, so t is triangular.

Second, if m=p and n=q are a solution, so are m=pē and n=(p+1)q, so we get an infinite number of such pairs.
Edited on October 26, 2004, 6:25 pm
  Posted by Old Original Oskar! on 2004-10-26 18:24:04

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

Chatterbox:
Copyright © 2002 - 2017 by Animus Pactum Consulting. All rights reserved. Privacy Information