Finding Shortcuts to Solve Big Math Problems

  • Context: High School 
  • Thread starter Thread starter slug
  • Start date Start date
Click For Summary

Discussion Overview

The discussion revolves around finding efficient methods to solve large mathematical problems, specifically focusing on summing a series of integers and calculating factorials. Participants explore various formulas and approaches to simplify these calculations.

Discussion Character

  • Exploratory
  • Mathematical reasoning
  • Debate/contested

Main Points Raised

  • One participant inquires about a formula to sum a series of integers from 18 to 10748, suggesting there might be a more efficient method than direct addition.
  • Another participant presents the formula for the sum of the first n integers, \(\sum_{i=1}^{n}i=\frac{n(n+1)}{2}\), as a solution to the summation problem.
  • A different participant elaborates on the summation process, demonstrating the calculation step-by-step and arriving at a specific numerical result.
  • Some participants propose an alternative formula for summing integers from a to n, \(\sum_{i=a}^{n}i=\frac{(n-a+1)(n+a)}{2}\), noting its equivalence to the previously mentioned formula.
  • One participant shares a method inspired by Gauss for pairing numbers to simplify the summation, detailing their thought process and calculations.
  • Another participant questions the possibility of simplifying factorial calculations, expressing frustration at ending up with long polynomials instead.
  • There is a correction regarding a transposed digit in a previous post, indicating attention to detail in the calculations presented.

Areas of Agreement / Disagreement

Participants present multiple approaches and formulas for summing integers, with some expressing confidence in their methods while others question the clarity or correctness of the calculations. The discussion remains unresolved regarding the best approach to factorial simplification.

Contextual Notes

Some participants express uncertainty about the application of certain formulas and the potential for simplification, indicating that assumptions about the methods may vary. There are also references to the use of LaTeX for mathematical expressions, which some participants find challenging.

slug
Messages
6
Reaction score
0
is there a formula to solve a long series of addition of say 18 through 10748
instead of doing the tedious summing of 18+19+20+...+10748
there probably is but i found a formula yesterday and I want see if it is the same

how about multiplication - is there an easy way of computing 97! (factorial)
instead of using a computer or multiplying 1*2*3*4...*97
 
Physics news on Phys.org
There's the old standby [itex]\sum_{i=1}^{n}i=\frac{n(n+1)}{2}[/itex] that will handle your sum problem with little difficulty.

You could use Stirling's series to approximate a factorial.
 
shmoe said:
There's the old standby [itex]\sum_{i=1}^{n}i=\frac{n(n+1)}{2}[/itex] that will handle your sum problem with little difficulty.

So that, of course, 18+19+20+...+10748= (1+ 2+ ...+ 10748)- (1+ 2+ ...+ 17)= (10749)(10748)/2- (18)(17)/2= (10749)(5374)- (9)17= 57764973.
 
[tex]\sum_{i=a}^{n}i=\frac{(n-a+1)(n+a)}{2}[/tex]

will also do
 
AntonVrba said:
[tex]\sum_{i=a}^{n}i=\frac{(n-a+1)(n+a)}{2}[/tex]

will also do

Thats the same thing, only slightly simplified.
 
HallsofIvy said:
So that, of course, 18+19+20+...+10748= (1+ 2+ ...+ 10748)- (1+ 2+ ...+ 17)= (10749)(10748)/2- (18)(17)/2= (10749)(5374)- (9)17= 57764973.

I prefer to think of it in this way:

Please follow my thinking, it is the same as that of Gauss with his SUM(1:100) problem. To solve it you pair off each number, starting with the largest (LA) and smallest (s) andsathen take (L-1) and (S+1) sand so on. With an even number as the largest number, there is always one number that cannot be paired up, once this is found, one subtracts the smallest number from it, to give the number of complete pairs, and multiplies by the sum of L and S. Tsa give the final answer, one then adds the number that cannot be paired.

Take the largest numebr in numberoup (10748) and the smallest (18).

Add them together (10766) , and divide by two (5383). This gives the number that does not have a pair.

Now, subtract 18 from this number (5365). Multiply 5365 by 10766 to give 57759590. Now add on to this 5383, and one gets 57764973

AlgebraiclAlgebraicallyr no miktex but i have never known how to use it in forums).

( { ( (L+S) / 2 ) - S } {L+S}) + { ( L + S ) / 2 } = answer

If one take L+s = T

Then it is much easier to say,
T{(T^2)/2) - ST} + {T/2}

I hope somebody could put that mess into MiXTeX or LaTeX - but i hope my logic comes through.

Regards,

Ben
 
Last edited by a moderator:
Halls answer is correct. Do you not believe the formula in my post?

"Take the largest numebr in numberoup (10478) and the smallest (18)."

You've transposed the digits 4 and 7, the sum he calculated was from 18 to 10748.
 
Post corrected

Ben
 
its not possible simplify factorials is it? it tried but i just end up with long polynomials :confused:
 

Similar threads

  • · Replies 7 ·
Replies
7
Views
5K
  • · Replies 4 ·
Replies
4
Views
2K
Replies
4
Views
2K
  • · Replies 18 ·
Replies
18
Views
8K
  • · Replies 28 ·
Replies
28
Views
10K
  • · Replies 10 ·
Replies
10
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 16 ·
Replies
16
Views
3K
  • · Replies 28 ·
Replies
28
Views
6K
Replies
7
Views
2K