I always want to remind any poster here that if they ever felt in despair you can always reach out to me privately..

Nits74

Well-known member
Oct 19, 2021
1,087
1,741
113
send me an email address or contact and I will reach out directly.

I do this because I never want anyone to feel that the weight of the world is on their shoulders, I'll share the "burden" with you. You are loved.

Shalom
Let's hope you don't get bombarded with calls tomorrow night. Seriously though, very nice gesture. I remember when you made this offer previously. You're a good man, Mr. Potter.
 

PSUAXE70

Active member
Oct 12, 2021
149
363
63
Sweet gesture, perfectly in character.

If anyone needs help with a math problem, I’m your man.
My grandfather used to live on a street with houses on one side only and numbered consecutively. He said the sum of the house numbers of the houses on one side of his house equaled the sum of the house numbers on the other side. I guessed his house number was 6 out of 8 houses because 1 through 5 adds to 15 and 7 +8 add to 15. He said nice try but there were between 100 and 500 houses on his street. He never told me the exact number of houses on the street. What was his street number?
 

Got GSPs

Well-known member
Oct 7, 2021
7,579
9,462
113
My grandfather used to live on a street with houses on one side only and numbered consecutively. He said the sum of the house numbers of the houses on one side of his house equaled the sum of the house numbers on the other side. I guessed his house number was 6 out of 8 houses because 1 through 5 adds to 15 and 7 +8 add to 15. He said nice try but there were between 100 and 500 houses on his street. He never told me the exact number of houses on the street. What was his street number?
I was told there would be no maths…
 
  • Like
Reactions: PSU73 and Fac

Got GSPs

Well-known member
Oct 7, 2021
7,579
9,462
113
What is "excess bacon"?
I don’t know personally. I hear tell that some people don’t eat bacon, so maybe there are people who only eat some bacon and not all bacon. It’s a longshot, but this really is my niche. I could excel in an environment where people with unlimited capacity for bacon eating was valued. I’m envisioning something like Newman from Seinfeld with the muffin bottoms.
 

LionJim

Well-known member
Oct 12, 2021
10,621
14,673
113
My grandfather used to live on a street with houses on one side only and numbered consecutively. He said the sum of the house numbers of the houses on one side of his house equaled the sum of the house numbers on the other side. I guessed his house number was 6 out of 8 houses because 1 through 5 adds to 15 and 7 +8 add to 15. He said nice try but there were between 100 and 500 houses on his street. He never told me the exact number of houses on the street. What was his street number?
There were 288 houses on his street and he lived at 204.

Here's how it works. The sum of the first n consecutive positive integers is n(n+1)/2. Suppose that you were able to split the house numbers in such a way that the first (k-1) numbers and the last (n-k) numbers add up to the same sum. This implies that twice the sum of the first (k-1) numbers plus k is equal to the sum of the first n numbers, that is,

k(k-1)+k = n(n+1)/2. But the left hand side is equal to k squared. So for this to work, n(n+1)/2 has to be a perfect square, which will happen when both n/2 and n+1 are perfect squares. (Caveat: number theory is not my forte, and I haven't yet verified that this is the only way it can work. What you see here is not an acceptable mathematical proof.) In your example, you had n=8; both n/2 = 4 and n+1 = 9 are perfect squares. The next largest n where this works is n=288: n/2=144=12^2 and n+1=289=17^2. And 288*289/2=41616=204^2. Of course, 204=12*17.
 
Last edited:

PSUAXE70

Active member
Oct 12, 2021
149
363
63
There were 288 houses on his street and he lived at 204.

Here's how it works. The sum of the first n consecutive positive integers is n(n+1)/2. Suppose that you were able to split the house numbers in such a way that the first (k-1) numbers and the last (n-k) numbers add up to the same sum. This implies that twice the sum of the first (k-1) numbers plus k is equal to the sum of the first n numbers, that is,

k(k-1)+k = n(n+1)/2. But the left hand side is equal to k squared. So for this to work, n(n+1)/2 has to be a perfect square, which will happen when both n/2 and n+1 are perfect squares. (Caveat: number theory is not my forte, and I haven't yet verified that this is the only way it can work. What you see here is not an acceptable mathematical proof.) In your example, you had n=8; both n/2 = 4 and n+1 = 9 are perfect squares. The next largest n where this works is n=288: n/2=144=12^2 and n+1=289=17^2. And 288*289/2=41616=204^2. Of course, 204=12*17.
Thank you. Very nicely done and well explained. I had read the answers before in a book about Ramanujan but had no idea how to start.
 
  • Like
Reactions: PSJimbo and LionJim

LionJim

Well-known member
Oct 12, 2021
10,621
14,673
113
There were 288 houses on his street and he lived at 204.

Here's how it works. The sum of the first n consecutive positive integers is n(n+1)/2. Suppose that you were able to split the house numbers in such a way that the first (k-1) numbers and the last (n-k) numbers add up to the same sum. This implies that twice the sum of the first (k-1) numbers plus k is equal to the sum of the first n numbers, that is,

k(k-1)+k = n(n+1)/2. But the left hand side is equal to k squared. So for this to work, n(n+1)/2 has to be a perfect square, which will happen when both n/2 and n+1 are perfect squares. (Caveat: number theory is not my forte, and I haven't yet verified that this is the only way it can work. What you see here is not an acceptable mathematical proof.) In your example, you had n=8; both n/2 = 4 and n+1 = 9 are perfect squares. The next largest n where this works is n=288: n/2=144=12^2 and n+1=289=17^2. And 288*289/2=41616=204^2. Of course, 204=12*17.
I was able to remove the caveat. Since n/2 and n+1 are relatively prime (because -2(n/2)+(n+1)=1), if
(n/2)(n+1) is a perfect square, then so must both n/2 and n+1 be perfect squares. Also, you could assume that n was odd, not even , but then for this to work you’d have to have n to be larger than 500, which is larger than the given upper bound for the problem.

I really don’t have much of a mathematical imagination, never did, but my proofs were always watertight.
 

Connorpozlee

Well-known member
Oct 29, 2021
2,265
4,295
113
There were 288 houses on his street and he lived at 204.

Here's how it works. The sum of the first n consecutive positive integers is n(n+1)/2. Suppose that you were able to split the house numbers in such a way that the first (k-1) numbers and the last (n-k) numbers add up to the same sum. This implies that twice the sum of the first (k-1) numbers plus k is equal to the sum of the first n numbers, that is,

k(k-1)+k = n(n+1)/2. But the left hand side is equal to k squared. So for this to work, n(n+1)/2 has to be a perfect square, which will happen when both n/2 and n+1 are perfect squares. (Caveat: number theory is not my forte, and I haven't yet verified that this is the only way it can work. What you see here is not an acceptable mathematical proof.) In your example, you had n=8; both n/2 = 4 and n+1 = 9 are perfect squares. The next largest n where this works is n=288: n/2=144=12^2 and n+1=289=17^2. And 288*289/2=41616=204^2. Of course, 204=12*17.
Holy ****! I got to “here’s how it works” and advanced directly to this response. I’m going to go out on a limb and say well done!
 

Midnighter

Well-known member
Oct 7, 2021
9,627
15,375
113
There were 288 houses on his street and he lived at 204.

Here's how it works. The sum of the first n consecutive positive integers is n(n+1)/2. Suppose that you were able to split the house numbers in such a way that the first (k-1) numbers and the last (n-k) numbers add up to the same sum. This implies that twice the sum of the first (k-1) numbers plus k is equal to the sum of the first n numbers, that is,

k(k-1)+k = n(n+1)/2. But the left hand side is equal to k squared. So for this to work, n(n+1)/2 has to be a perfect square, which will happen when both n/2 and n+1 are perfect squares. (Caveat: number theory is not my forte, and I haven't yet verified that this is the only way it can work. What you see here is not an acceptable mathematical proof.) In your example, you had n=8; both n/2 = 4 and n+1 = 9 are perfect squares. The next largest n where this works is n=288: n/2=144=12^2 and n+1=289=17^2. And 288*289/2=41616=204^2. Of course, 204=12*17.

 

PSU87

Well-known member
Oct 12, 2021
1,662
3,380
113
There were 288 houses on his street and he lived at 204.

Here's how it works. The sum of the first n consecutive positive integers is n(n+1)/2. Suppose that you were able to split the house numbers in such a way that the first (k-1) numbers and the last (n-k) numbers add up to the same sum. This implies that twice the sum of the first (k-1) numbers plus k is equal to the sum of the first n numbers, that is,

k(k-1)+k = n(n+1)/2. But the left hand side is equal to k squared. So for this to work, n(n+1)/2 has to be a perfect square, which will happen when both n/2 and n+1 are perfect squares. (Caveat: number theory is not my forte, and I haven't yet verified that this is the only way it can work. What you see here is not an acceptable mathematical proof.) In your example, you had n=8; both n/2 = 4 and n+1 = 9 are perfect squares. The next largest n where this works is n=288: n/2=144=12^2 and n+1=289=17^2. And 288*289/2=41616=204^2. Of course, 204=12*17.
Blah blah blah...

That's cute and all, but how 'bout some winning Powerball numbers for Friday?
 

LionJim

Well-known member
Oct 12, 2021
10,621
14,673
113
There were 288 houses on his street and he lived at 204.

Here's how it works. The sum of the first n consecutive positive integers is n(n+1)/2. Suppose that you were able to split the house numbers in such a way that the first (k-1) numbers and the last (n-k) numbers add up to the same sum. This implies that twice the sum of the first (k-1) numbers plus k is equal to the sum of the first n numbers, that is,

k(k-1)+k = n(n+1)/2. But the left hand side is equal to k squared. So for this to work, n(n+1)/2 has to be a perfect square, which will happen when both n/2 and n+1 are perfect squares. (Caveat: number theory is not my forte, and I haven't yet verified that this is the only way it can work. What you see here is not an acceptable mathematical proof.) In your example, you had n=8; both n/2 = 4 and n+1 = 9 are perfect squares. The next largest n where this works is n=288: n/2=144=12^2 and n+1=289=17^2. And 288*289/2=41616=204^2. Of course, 204=12*17.
I hate to leave any loose threads, so here’s why the sum of the first n positive integers is equal to n(n+1)/2.

Set this sum equal to x:

x = 1 + 2 + 3 + … +n;
now do it backwards:
x = n + (n-1) + (n-2) + … + 2 + 1;
add these two column by column, and you get

2x = (n+1) + (n+1) + (n+1) + … + (n+1), n terms of (n+1), so you get

2x = n(n+1), dividing through by 2 gives

x = n(n+1)/2.
 

ODShowtime

Well-known member
Nov 1, 2021
2,620
5,364
113
I hate to leave any loose threads, so here’s why the sum of the first n positive integers is equal to n(n+1)/2.

Set this sum equal to x:

x = 1 + 2 + 3 + … +n;
now do it backwards:
x = n + (n-1) + (n-2) + … + 2 + 1;
add these two column by column, and you get

2x = (n+1) + (n+1) + (n+1) + … + (n+1), n terms of (n+1), so you get

2x = n(n+1), dividing through by 2 gives

x = n(n+1)/2.

Big deal, I know how to make my calculator say "hell".
 

NittanyLionFan

New member
Oct 6, 2021
5
15
3
I hate to leave any loose threads, so here’s why the sum of the first n positive integers is equal to n(n+1)/2.

Set this sum equal to x:

x = 1 + 2 + 3 + … +n;
now do it backwards:
x = n + (n-1) + (n-2) + … + 2 + 1;
add these two column by column, and you get

2x = (n+1) + (n+1) + (n+1) + … + (n+1), n terms of (n+1), so you get

2x = n(n+1), dividing through by 2 gives

x = n(n+1)/2.
I'm still lost with gazinta math ....
 
  • Like
Reactions: LionJim

PSU Mike

Well-known member
Oct 6, 2021
2,316
3,811
113
Or drop it into Excel and do it brute force in a few minutes.
 

Fac

Well-known member
Oct 12, 2021
676
924
93
There were 288 houses on his street and he lived at 204.

Here's how it works. The sum of the first n consecutive positive integers is n(n+1)/2. Suppose that you were able to split the house numbers in such a way that the first (k-1) numbers and the last (n-k) numbers add up to the same sum. This implies that twice the sum of the first (k-1) numbers plus k is equal to the sum of the first n numbers, that is,

k(k-1)+k = n(n+1)/2. But the left hand side is equal to k squared. So for this to work, n(n+1)/2 has to be a perfect square, which will happen when both n/2 and n+1 are perfect squares. (Caveat: number theory is not my forte, and I haven't yet verified that this is the only way it can work. What you see here is not an acceptable mathematical proof.) In your example, you had n=8; both n/2 = 4 and n+1 = 9 are perfect squares. The next largest n where this works is n=288: n/2=144=12^2 and n+1=289=17^2. And 288*289/2=41616=204^2. Of course, 204=12*17.
You lost me at "Here's how it works".
 
  • Like
Reactions: Mr. Potter

Fac

Well-known member
Oct 12, 2021
676
924
93
Mr Potter. Every night for the past 2 weeks I have been dreaming about wigwams and teepee's.

Can you explain why to me? I need to get better rested.

TIA
 
  • Like
Reactions: 91Joe95

SurgeOne

Well-known member
Oct 30, 2021
524
813
93
send me an email address or contact and I will reach out directly.

I do this because I never want anyone to feel that the weight of the world is on their shoulders, I'll share the "burden" with you. You are loved.

Shalom
I might after tonight’s game
 
  • Like
Reactions: Mr. Potter
Get unlimited access today.

Pick the right plan for you.

Already a member? Login