mersenneforum.org  

Go Back   mersenneforum.org > Fun Stuff > Lounge

Reply
 
Thread Tools
Old 2006-10-15, 13:31   #12
Xyzzy
 
Xyzzy's Avatar
 
"Mike"
Aug 2002

100000001101012 Posts
Default

I apologize for derailing the OP's birthday thread!

I'll go read up some more on triangular numbers. My first impulse is to write an ugly Perl program to brute force something but instead I'll try to understand it mathematically.

I knew I shouldn't have trusted Wikipedia. (I picked up my original claim there. Every year I check my age to see what interesting things are associated with that number. I should have checked before posting!)

Xyzzy is offline   Reply With Quote
Old 2006-10-15, 13:39   #13
wblipp
 
wblipp's Avatar
 
"William"
May 2003
New Haven

2·7·132 Posts
Default

Quote:
Originally Posted by Mini-Geek View Post
Because it's his age? Unless he's over 170
I checked up to 10250, so I already knew 36 was the only reasonable age. But this wasn't stated as a puzzle, it was stated as a mathematical fact.

Quote:
Originally Posted by Mini-Geek View Post
due to numbers being infinite, I would think that there are likely many more
I have a heuristic that suggests there are no more. But I was wondering if somebody had a proof.
wblipp is offline   Reply With Quote
Old 2006-10-15, 13:56   #14
axn
 
axn's Avatar
 
Jun 2003

5,087 Posts
Default

It is fairly easy to show this:

Let n(n+1)/2 = [m(m+1)/2]^2 = m^2(m+1)^2/4

i.e., n(n+1) = m^2(m+1)^2/2

But since n and (n+1) are relatively prime, we must have either

n=m^2, n+1 = (m+1)^2/2
or
n=(m+1)^2/2, n+1 = m^2
[I'll leave it as an excercise why the /2 factor must go with (m+1)^2]

The first one leads to m=1 (solution = 1, 1), the second one leads to m=3 (solution = 6, 36)
axn is offline   Reply With Quote
Old 2006-10-15, 16:38   #15
ixfd64
Bemusing Prompter
 
ixfd64's Avatar
 
"Danny"
Dec 2002
California

25×3×52 Posts
Default

LOL, come to think of it, we're so geeky at times.
ixfd64 is offline   Reply With Quote
Old 2006-10-15, 17:24   #16
wblipp
 
wblipp's Avatar
 
"William"
May 2003
New Haven

2·7·132 Posts
Default

Quote:
Originally Posted by axn1 View Post
It is fairly easy to show this:

Let n(n+1)/2 = [m(m+1)/2]^2 = m^2(m+1)^2/4

i.e., n(n+1) = m^2(m+1)^2/2

But since n and (n+1) are relatively prime, we must have either

n=m^2, n+1 = (m+1)^2/2
or
n=(m+1)^2/2, n+1 = m^2
I don't see why you can reject the possibility that

m = pq
m+1 = st

2n = p2s2
n+1 = q2t2

OR

n = p2s2
2(n+1) = q2t2
wblipp is offline   Reply With Quote
Old 2006-10-15, 17:51   #17
axn
 
axn's Avatar
 
Jun 2003

508710 Posts
Default

Quote:
Originally Posted by wblipp View Post
I don't see why you can reject the possibility that

m = pq
m+1 = st

2n = p2s2
n+1 = q2t2

OR

n = p2s2
2(n+1) = q2t2
Hmmm... Didn't think of that. Any chance of salvaging this approach, however? Some restrictions on sizes, etc?
axn is offline   Reply With Quote
Old 2006-10-18, 19:04   #18
cheesehead
 
cheesehead's Avatar
 
"Richard B. Woods"
Aug 2002
Wisconsin USA

22×3×641 Posts
Default

Quote:
Originally Posted by Xyzzy
I knew I shouldn't have trusted Wikipedia.
Mathworld.

http://mathworld.wolfram.com/

The self-proclaimed "Web's Most Extensive Mathematical Resource".

Remember it in your time of need.

(now that Eric Weisstein and CRC Press have settled their legal dispute about CRC Press's shameful (IMO) power play on Eric's naivete a few years ago -- see http://mathworld.wolfram.com/docs/faq.html)

- - -

From http://mathworld.wolfram.com/TriangularNumber.html:

"The numbers 1, 36, 1225, 41616, 1413721, 48024900, ... (Sloane's A001110) are square triangular numbers, i.e., numbers which are simultaneously triangular and square (Pietenpol 1962). The corresponding square roots are 1, 6, 35, 204, 1189, 6930, ... (Sloane's A001109), and the indices of the corresponding triangular numbers [Tn] are [n=1], 8, 49, 288, 1681, ... (Sloane's A001108)."

So, 1 and 36 are not the only possibilities, but Xyzzy'd have to be older than Methuselah otherwise.

Last fiddled with by cheesehead on 2006-10-18 at 19:23
cheesehead is offline   Reply With Quote
Old 2006-10-18, 19:38   #19
xilman
Bamboozled!
 
xilman's Avatar
 
"π’‰Ίπ’ŒŒπ’‡·π’†·π’€­"
May 2003
Down not across

2·5,393 Posts
Default

Quote:
Originally Posted by Xyzzy View Post
How embarassing! I wonder how I should reword this? Let me go think for a while.
Ok, I've waited long enough for you to get your act together.

The smallest triangular number which is the square of a different triangular number.


Paul
xilman is offline   Reply With Quote
Old 2006-10-18, 19:40   #20
xilman
Bamboozled!
 
xilman's Avatar
 
"π’‰Ίπ’ŒŒπ’‡·π’†·π’€­"
May 2003
Down not across

2·5,393 Posts
Default

Quote:
Originally Posted by cheesehead View Post
The corresponding square roots are 1, 6, 35, 204, 1189, 6930,
....
So, 1 and 36 are not the only possibilities, but Xyzzy'd have to be older than Methuselah otherwise.
And which of those square roots are themselves triangular?



Paul
xilman is offline   Reply With Quote
Old 2006-10-18, 19:50   #21
Xyzzy
 
Xyzzy's Avatar
 
"Mike"
Aug 2002

5·17·97 Posts
Default

Quote:
Originally Posted by xilman View Post
The smallest triangular number which is the square of a different triangular number.
That'll do . That'll do.

At this point I'm just waiting for my birthday so I can put all this behind me.

Xyzzy is offline   Reply With Quote
Old 2006-10-18, 20:00   #22
wblipp
 
wblipp's Avatar
 
"William"
May 2003
New Haven

2·7·132 Posts
Default

Quote:
Originally Posted by xilman View Post
And which of those square roots are themselves triangular?
Yes, cheesehead seems to have forgotten that the square root must also be a triangular number. As I reported in post #13, I've checked that there are no other triangular square roots up to 10250 (the square root this large, so the number up to 10500). I don't have a proof there are no others, though.
wblipp is offline   Reply With Quote
Reply

Thread Tools


All times are UTC. The time now is 20:06.


Fri Aug 6 20:06:12 UTC 2021 up 14 days, 14:35, 1 user, load averages: 2.95, 3.02, 3.10

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.