This program finds prime numbers manually

version (1.25 KB) by nathanial hapeman
matlab already has a function to do this but i wanted to see if i could code it manually


Updated 2 Sep 2011

View License

this program works by first asking for a positive integer say 16. then it creates an array ranging from 2 to 16. next all the numbers are divided by 2 and all that return back a integer are deleted from the array except for 2. example 4/2 =2, 4 will be deleted. after this, this same pattern continues with 3 and so on until the array is dived by ceil(sqrt(n)) so for the case of n=16, 2 and 3 can root out all of the non primes

Cite As

nathanial hapeman (2022). This program finds prime numbers manually (, MATLAB Central File Exchange. Retrieved .

MATLAB Release Compatibility
Created with R2010a
Compatible with any release
Platform Compatibility
Windows macOS Linux

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!