n th triangular number. What is n ?
120 is the
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Actually, a negative number can be a triangular number.
I want to call it, an imaginary mathematical number.
It is not confused with an imaginary number.
0 , 1 , 3 , 6 , 1 0 , 1 5 , 2 1 , 2 8 , 3 6 , 4 5 , 5 5 , ⋯ → − ∞ , ⋯ , − 3 , − 1 , 0 , 1 , 3 , ⋯ , ∞ .
Each sides are parallel.
We need to apply the formula 2 n ( n + 1 ) to find n .
So, 2 n ( n + 1 ) = 1 2 0
n ( n + 1 ) = 1 2 0 × 2
n 2 + n = 2 4 0
n 2 + n − 2 4 0 = 0 (Solve with midde term splitting)
n 2 − 1 5 n + 1 6 n − 2 4 0 = 0
n ( n − 1 5 ) + 1 6 ( n − 1 5 ) = 0
( n − 1 5 ) ( n + 1 6 ) = 0
So, n = 1 5 , − 1 6
But we cannot take negative value of n because sum of negative numbers is not positive.
Check:
2 1 5 ( 1 5 + 1 ) = 1 2 0 , n = 1 5
2 1 5 × 1 6 = 1 2 0
2 2 4 0 = 1 2 0
1 2 0 = 1 2 0
Thus, the answer is: n = 1 5
1 2 0 = 2 n ( n + 1 )
2 4 0 = n ( n + 1 ) We know the numbers are all natural numbers, so n and n+1 both have to be divisors of 240. 2 4 0 = 2 4 ∗ 3 ∗ 5 If you look through all the possible combinations, the only ones that are one away from each other are 3 ∗ 5 = 1 5 and 2 4 = 1 6 Therefore, n = 1 5 Keep in mind this won't work for algebra solutions where we aren't just dealing with counting numbers.
I dont know what n th means, but I will try my best.
A triangular number T is equal to the sum of natural numbers, from 1 to a .
So, 1 2 0 = 1 + 2 + ⋯ .
If we subtract the same numbers from each sides, then 1 1 9 = 2 + 3 + 4 + ⋯ .
1 1 7 = 3 + 4 + 5 + 6 + ⋯ .
1 1 4 = 4 + 5 + 6 + 7 + 8 + ⋯ .
1 1 0 = 5 + 6 + 7 + 8 + 9 + ⋯ .
1 0 5 = 6 + 7 + 8 + 9 + 1 0 + ⋯ .
9 9 = 7 + 8 + 9 + 1 0 + 1 1 + ⋯ .
9 2 = 8 + 9 + 1 0 + 1 1 + 1 2 + ⋯ .
8 4 = 9 + 1 0 + 1 1 + 1 2 + ⋯ .
7 5 = 1 0 + 1 1 + 1 2 + ⋯ .
6 5 = 1 1 + 1 2 + 1 3 + 1 4 + ⋯ .
5 4 = 1 2 + 1 3 + ⋯ .
4 2 = 1 3 + 1 4 + ⋯ .
2 9 = 1 4 + 1 5 + ⋯ .
1 5 = 1 5 + ⋯ .
0 = ⋯ .
Hence, 1 2 0 = n = 1 ∑ 1 5 n .
1 2 0 = 1 + 2 + 3 + 4 + ⋯ + 1 0 + 1 1 + 1 2 + 1 3 + 1 4 + 1 5 .
So, 120 is the fifteenth triangular number.
t h e f i r s t t r i a n g u l a r n u m b e r i s : 1 t h e s e c o n d t r i a n g u l a r n u m b e r i s : 1 + 2 t h e t h i r d t r i a n g u l a r n u m b e r i s : 1 + 2 + 3 t h e n t h t r i a n g u l a r n u m b e r i s : 1 + 2 + 3 + 4 + . . . + n = 2 n ( n + 1 ) s o n s a t i s f y 2 n ( n + 1 ) = 1 2 0 n ( n + 1 ) = 2 4 0 = 1 5 × 1 6 t h e n n = 1 5
− 1 6 × − 1 5 also satisfies that equation.
So, you have to add a condition, n > 0 .
the first triangular number is : 1 the second triangular number is : 1+2 the third triangular number is : 1+2+3 the nth triangular number is : 1+2+3+4+...+n = n(n+1)/2 so n satisfy n(n+1)/2 =120 then n=15
n ( n + 1 ) / 2 = 2 4 0 n ( n + 1 ) = 2 4 0 n ( n + 1 ) = 1 5 ∗ 1 6 n = 1 5 Hence answer is 1 5 .
As we have seen that the no. of dots in nth fig is 2 n ( n + 1 )
So 2 n ( n + 1 ) = 1 2 0
or n = 1 5
I forgot the formula.
So, the thing I did is I added all the consecutive numbers till we get 1 2 0 .
1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + 1 0 + 1 1 + 1 2 + 1 3 + 1 4 + 1 5 = 1 2 0
The last number is 1 5 so the answer is 1 5 .
Here is the code in Ruby:
for i in 1..20
if (n * (n + 1)) / 2
puts n
break
end
end
Problem Loading...
Note Loading...
Set Loading...
We have that 2 n ( n + 1 ) = 1 2 0 . We can solve for n : 2 n ( n + 1 ) n ( n + 1 ) n 2 + n n 2 + n − 2 4 0 ( n − 1 5 ) ( n + 1 6 ) n = 1 2 0 = 2 4 0 = 2 4 0 = 0 = 0 = − 1 6 , 1 5
Since we cannot have a negative triangular number, we discard the extraneous solution n = − 1 6 . Thus, we are forced to conclude that n = 1 5