Given m, n, p, and q, create an m-by-n matrix made up of submatrices, each sized p-by-q (if possible - the last row and column of blocks may be smaller). The elements of the (j,k)th block all have the same value: (j+k-1).
For example, if m = 4, n = 7, p = 2, and q = 3, the matrix is:
You can assume m, n, p, and q are all positive integers. (They can have the value 1, however.) As in the illustration above, m may or may not be divisible by p, and n may or may not be divisible by q. It is even possible for m < p or n < q. The resulting matrix will always be m-by-n.
Solution Stats
Problem Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers100
Suggested Problems
-
Given an unsigned integer x, find the largest y by rearranging the bits in x
2056 Solvers
-
Project Euler: Problem 2, Sum of even Fibonacci
2902 Solvers
-
Project Euler: Problem 10, Sum of Primes
2126 Solvers
-
The Answer to Life, the Universe, and Everything
586 Solvers
-
Make a vector of prime numbers
970 Solvers
More from this Author35
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!