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+1))
why this is not working even though it meets all the requirements in the assert?
I have the same question. Would anyone kindly help us? Thank you.
I am also wondering why linspace(-L,L,N+1) is not working. It passes the last test suite, but fails the first two.
y = linspace(-L,L,N)
It strangely does not work
linspace doesn't work as it gives a std(diff(y)) of the order of 1e-15 and not 0.
Use colon operators.
Return the 3n+1 sequence for n
Implement a ROT13 cipher
Check to see if a Sudoku Puzzle is Solved
04 - Scalar Equations 1
Project Euler: Problem 16, Sums of Digits of Powers of Two
Square Digits Number Chain Terminal Value (Inspired by Project Euler Problem 92)
Cache me Outside
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