Create a square matrix, M, which should be populated as follows:
M = [ n^2 n * (n-1) n * (n-2) ... n * 2 n * 1;
(n-1)*n (n-1)*(n-1) (n-1)*(n-2) ... (n-1)*2 (n-1)*1;
(n-2)*n (n-2)*(n-1) (n-2)*(n-2) ... (n-2)*2 (n-2)*1;
. . . . . . ;
. . . . . . ;
. . . . . . ;
2 * n 2 * (n-1) 2 * (n-2) ... 2 * 2 2 * 1;
1 * n 1 * (n-1) 1 * (n-2) ... 1 * 2 1 * 1]
Solution Stats
Problem Comments
2 Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers140
Suggested Problems
-
Find the longest sequence of 1's in a binary sequence.
6799 Solvers
-
Sum of diagonal of a square matrix
1640 Solvers
-
492 Solvers
-
504 Solvers
-
Return fibonacci sequence do not use loop and condition
868 Solvers
More from this Author37
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
6775745764
The problem description and test suite have been improved.