Given N and L, return a list of numbers (in ascending order) that divides the interval [-L L] into N equal-length segments.
For example, if L = 3 and N = 2
y = [ -3 0 3 ]
y = linspace(-L,L,N)
It strangely does not work
Count from 0 to N^M in base N.
Project Euler: Problem 5, Smallest multiple
Number of Circles in a Number
What number has this problem?
Find the nearest prime number
Read a Soroban Abacus
Return the first and last character of a string
Lychrel Number Test (Inspired by Project Euler Problem 55)
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