The square matrix A of order 4 0 has its entries defined as the product of their column position and their line position, that is, a m n = m × n .
Let S be the sum of all its entries. Evaluate S .
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.
Nice LaTeX matrix :)
Log in to reply
I use CodeCogs to visualize better my answer. You should check it out too :)
square matrix means row and column number r same ,so here row=column
and order of matrix is called row column=row row=column*column ,here order=40,but root of 40 is not an integer,then how come???
Log in to reply
Hello,
Please notice we want to calculate the square root of "the sum of all its entries". It is slighty related to the order of the matrix, but not linear.
∑ order N ( all entries ) = 4 N 2 ( N + 1 ) 2
By the definition of the entries of the matrix we have for example a 1 m = 1 , 2 , 3 , 4 , … , 4 0 , so the sum of the first row with all the colums is n = 1 ∑ 4 0 n . in the second row with all the columns we have 2 n = 1 ∑ 4 0 n . And we can do this for every row k with all the columns, the sum is k n = 1 ∑ 4 0 n . hence we have that the sum of all the entries of the matrix is S = n = 1 ∑ 4 0 n + 2 n = 1 ∑ 4 0 n + ⋯ + 4 0 n = 1 ∑ 4 0 n = n = 1 ∑ 4 0 n × ( 1 + 2 + ⋯ + 4 0 ) = n = 1 ∑ 4 0 n × n = 1 ∑ 4 0 n . so S = 2 2 4 0 2 × 4 1 2 then S = 2 4 0 × 4 1 = 8 2 0
The matrix looks like this:
1 × 1 , 1 × 2 , 1 × 3 , ........, 1 × 4 0
2 × 1 , 2 × 2 , 2 × 3 , ........, 2 × 4 0
3 × 1 , 3 × 2 , 3 × 3 , ........, 3 × 4 0
.
.
.
.
4 0 × 1 , 4 0 × 2 , 4 0 × 3 , ........, 4 0 × 4 0
So, their addition
S = ( 1 × 1 ) + ( 1 × 2 ) + ( 1 × 3 ) + . . . . . + ( 1 × 4 0 ) + ( 2 × 1 ) + ( 2 × 2 ) + ( 2 × 3 ) + . . . . . + ( 2 × 4 0 ) + ( 3 × 1 ) + ( 3 × 2 ) + ( 3 × 3 ) + . . . . . + ( 3 × 4 0 ) + . . . . . + ( 4 0 × 1 ) + ( 4 0 × 2 ) + ( 4 0 × 3 ) + . . . . . + ( 4 0 × 4 0 )
S = 1 × ( 1 + 2 + 3 + . . . . . + 4 0 ) + 2 × ( 1 + 2 + 3 + . . . . . + 4 0 ) + 3 × ( 1 + 2 + 3 + . . . . . + 4 0 ) + . . . . . + 4 0 × ( 1 + 2 + 3 + . . . . . + 4 0 )
S = ( 1 + 2 + 3 + . . . . . + 4 0 ) × ( 1 + 2 + 3 + . . . . . + 4 0 )
S = ( 1 + 2 + 3 + . . . . . + 4 0 )
= 2 4 0 × 4 1
= 8 2 0
That's the answer!
Use CodeCogs to build a matrix. It will look very good :)
Let's count the sum of every line
Line 1
→
L
1
=
1
×
1
+
1
×
2
+
1
×
3
+
⋯
+
1
×
4
0
L
1
=
1
(
1
+
2
+
3
+
⋯
+
4
0
)
Line 2
→
L
2
=
2
×
1
+
2
×
2
+
2
×
3
+
⋯
+
2
×
4
0
L
2
=
2
(
1
+
2
+
3
+
⋯
+
4
0
)
Line 3
→
L
3
=
3
×
1
+
3
×
2
+
3
×
3
+
⋯
+
3
×
4
0
L
3
=
3
(
1
+
2
+
3
+
⋯
+
4
0
)
⋮
→
⋮
Line 40
→
L
4
0
=
4
0
×
1
+
4
0
×
2
+
4
0
×
3
+
⋯
+
4
0
×
4
0
L
4
0
=
4
0
(
1
+
2
+
3
+
⋯
+
4
0
)
Assuming that
a
=
1
+
2
+
3
+
⋯
+
4
0
L
1
=
1
a
L
2
=
2
a
L
3
=
3
a
⋮
L
4
0
=
4
0
a
To get the sum of all its entries
(
S
)
we need to sum up
L
1
until
L
4
0
S
=
L
1
+
L
2
+
L
3
+
⋯
+
L
4
0
S
=
1
a
+
2
a
+
3
a
+
⋯
+
4
0
a
S
=
(
1
+
2
+
3
+
⋯
+
4
0
)
a
S
=
(
a
)
a
S
=
a
2
S
=
a
S
=
1
+
2
+
3
+
⋯
+
4
0
Note :
1
+
2
+
3
+
⋯
+
n
=
2
n
(
n
+
1
)
S
=
2
4
0
(
4
1
)
S
=
8
2
1
Sorry for the mistyped answer. The true answer is 820 :)
We note that in order to have every combination of m × n , we must only write S = ( m 1 + m 2 + . . . + m m ) ( n 1 + n 2 + . . . + n n ) . This then simplifies to ( 1 + 2 + . . . + 4 0 ) 2 . By the formula for an arithmetic series, we know that the sum in the parentheses is S = ( 1 + 4 0 ) ∗ 2 4 0 = 4 1 × 2 0 = 8 2 0 .
Firstly, we have to notice that we have to find the square-root of sum of each entry in the square matrix of order 40 , which can't be found in a quick manner by normal formulae.
Of course, one could painstakingly write down all the entries, sum them and then take the square-root. But let me shorten the process by a day.
Notice :
First Row = 1 × ( 1 + 2 + 3 + 4 + . . . 4 0 )
Second Row = 2 × ( 1 + 2 + 3 + 4 + . . . 4 0 )
.
.
.
.
Fortieth Row = 4 0 × ( 1 + 2 + 3 + 4 + . . . 4 0 )
Adding all the rows yields :
S = 1 × ( 1 + 2 + 3 + 4 + . . . 4 0 ) + 2 × ( 1 + 2 + 3 + 4 + . . . 4 0 ) . . . . + 4 0 × ( 1 + 2 + 3 + 4 + . . . 4 0 )
Factoring out the (1+2+3+4+...40) from each term yields :
S = ( 1 + 2 + 3 + 4 + . . . 4 0 ) × ( 1 + 2 + 3 + 4 + . . . 4 0 ) = ( 1 + 2 + 3 + 4 + . . . . 4 0 ) 2
Hence * S * = (1+2+3+4+....40)
Using the formula for sum of N natural numbers we get :
* S * = * ( 2 ) ( 4 0 ) ( 4 1 ) * = * 8 2 0 *
Since a m n = m × n , the first row shall consists of elements 1 , 2 , 3 . . . . 4 0 . Similarly the second row shall consists of elements of the form 2 × 1 , 2 × 2 , . . . . 2 × 4 0 . Thus the n t h row shall contain elements of the form n × 1 , n × 2 , . . . . n × 4 0 . Hence S = ( 1 + 2 + 3 + . . . . + 4 0 ) + 2 × ( 1 + 2 + 3 + . . . . . + 4 0 ) + . . . . + n ( 1 + 2 + 3 + . . . . + 4 0 ) + . . . . + 4 0 ( 1 + 2 + 3 + . . . . . + 4 0 ) S = ( 1 + 2 + 3 + . . . . + 4 0 ) ( 1 + 2 + 3 + . . . . . + 4 0 ) = 2 0 2 × 4 1 2 ∴ S = 4 1 × 2 0 = 8 2 0 .
The solution is as follows first of all consider an entire row .Since the entire row has it's row number i.e, the number being multiplied in common. we just take it out sum up the remaining numbers which is obviously the sum of first 40 natural numbers as provided SUM OF THAT ROW BEING CONSIDERED=rn*(40x41)/2 (rn represents that row number) repeat same procedure for all rows you then sum up all the rn's you get square of 40x41/2=S^2 which implies S=40x41/2=820
use LaTex please.
Am,n=m n...i.e..,A1,1=1 1=1,A1,2=1 2......A1,40=1 40=40 for 1st row sum=1+2+...+40=820 similarly for A2,1=2 1=2,A2,2=2 2...A2,40=2 40....sum=2(1+2+..+40)=2(820) soon for A40,1=40 1.....A40,40=40 40......sum=40(1+2+...+40)=40(820) there fore,total sum, s=1(820)+2(820)+...+40(820) s=820(1+2+...+40) s=820 820 s^1/2=820
s={n(n+1)/2}*{n(n+1)/2} where n=40 since it is a square matrix the rows wil be like 1.1,1.2........1.40 same wit columns
How exactly did you find out Σ = 4 n 2 ( n + 1 ) 2 ? Can you explain why this is true for all natural values of N ≥ 1 ?
⎣ ⎢ ⎢ ⎢ ⎡ 1 2 ⋮ 4 0 2 4 8 0 3 6 1 2 0 4 8 ⋱ 1 6 0 ⋯ ⋯ ⋯ 4 0 8 0 ⋮ 1 6 0 0 ⎦ ⎥ ⎥ ⎥ ⎤ R 1 R 2 = 2 R 1 ⋮ R 4 0 = 4 0 R 1 For finding the sum of all the entries in R1 we can define little s as the sum of the simple arithmetic sequence s = 1 + 2 + 3 + . . . . 4 0 = n = 1 ∑ 4 0 n n = 1 ∑ 4 0 n = 2 4 0 ( 1 + 4 0 ) = 8 2 0 You also know that R 2 = 2 R 1 therefor the sum of Row 2 is just 2s, the sum of Row 3 is 3s, etc. Using the formula for the sum of an arithmetic sequence again, you find that the sum of all rows, S, is S = s + 2 s + 3 s + . . . . 4 0 s = s ( 1 + 2 + 3 + . . . . + 4 0 ) = s n = 1 ∑ 4 0 n S = s 2 4 0 ( 1 + 4 0 ) = s ( 8 2 0 ) = 8 2 0 2 Then S = 8 2 0 2 = 8 2 0
Problem Loading...
Note Loading...
Set Loading...
Let the sum of all entries of a likely matrix of order k be S ( k ) .
The matrix will look like this:
⎝ ⎜ ⎜ ⎜ ⎛ 1 2 ⋮ k 2 4 ⋮ 2 k ⋯ ⋯ ⋱ ⋯ k 2 k ⋮ k 2 ⎠ ⎟ ⎟ ⎟ ⎞
Notice the first column has sum = ( 1 + 2 + ⋯ + k ) . The second one has sum = 2 × ( 1 + 2 + ⋯ + k ) , the third one has sum = 3 × ( 1 + 2 + ⋯ + k ) , and the k -th column has sum = k × ( 1 + 2 + ⋯ + k ) .
Adding all up, we get ( 1 + 2 + ⋯ + k ) ( 1 + 2 + ⋯ + k ) ⇒ ( 1 + 2 + ⋯ + k ) 2 . Note this is the square of the sum of the first k integers, whose closed formula is 2 k ( k + 1 ) . Jumping some steps, we see the problem asks us not S ( 4 0 ) , but its square root. That means the answer to this problem is 2 4 0 ⋅ 4 1 ⇒ = 8 2 0 . .