This program finds prime numbers manually
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 (2024). This program finds prime numbers manually (https://www.mathworks.com/matlabcentral/fileexchange/32774-this-program-finds-prime-numbers-manually), MATLAB Central File Exchange. Retrieved .
MATLAB Release Compatibility
Platform Compatibility
Windows macOS LinuxCategories
Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!Discover Live Editor
Create scripts with code, output, and formatted text in a single executable document.
Version | Published | Release Notes | |
---|---|---|---|
1.0.0.0 |