Since Cody, I dislike for-loops, but your solution is way simpler than my own algorithm. Mission accomplished...
Nevertheless, I would hope for a non-looped piece of code. Let's see in phase 3.
give nth decimal place of pi
Right and wrong
sum of non-primes
Order of things - 1
Insert structure in a parameter-cell array.
Make a KITT-scanner on the command line
Remove element(s) from cell array
Create a random logical vector of N elements of which M are true.
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