Replicate each element of a row vector (with NaN) a constant number of times.
n=2, A=[1 2 3] -> [1 1 2 2 3 3]
n=0, A=[2 1] -> 
Project Euler: Problem 5, Smallest multiple
Permute diagonal and antidiagonal
Create a vector whose elements depend on the previous element
Two functions (to be sure)
Return a list sorted by number of consecutive occurrences
Sum of big primes without primes
Pandigital number n°2 (Inspired by Project Euler 32)
Magic is simple (for beginners)
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