Create n x 2n "mirror" matrix of this type:
For n = 2
m = [ 1 2 2 1
1 2 2 1 ]
For n = 3
m = [ 1 2 3 3 2 1
1 2 3 3 2 1
1 2 3 3 2 1 ]
This problem was fun. I was able to find a better way to solve beat my own solution. Not the best way though. But lot better.
What is the next step in Conway's Life?
It dseon't mettar waht oedrr the lrettes in a wrod are.
Given a window, how many subsets of a vector sum positive
07 - Common functions and indexing 5
Add a row of zeros on top of a matrix
Sum of series V
Sum of series IV
Sum of series I
Sum of series VI
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Contact your local office