The description of the problem is slightly misleading. It says the sum "below" 10, yet the sum includes 10. It should be ammended to "Find the sum of all the non-primes below the input, and including the input, N.", or something to that effect.
I've now fixed the problem statement to be consistent.
Find the longest sequence of 1's in a binary sequence.
Factorize THIS, buddy
Getting logical indexes
Free passes for everyone!
Find the treasures in MATLAB Central and discover how the community can help you!
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