Description: Write a C++ program that uses an array of n elements (where n is a user input) to determine
and display the prime numbers between 2 and n, including n using the method described
below. Ignore array elements 0 and 1.
A prime number is any integer greater than one that is divisible only by itself and 1. A list of
prime numbers can be found by the following method.
To Search:
File list (Check if you may need any files):
FindPrimeNumbers\Debug
................\.....\FindPrimeNumbers.exe
................\.....\FindPrimeNumbers.ilk
................\.....\FindPrimeNumbers.pdb
................\FindPrimeNumbers.sdf
................\FindPrimeNumbers.sln
................\FindPrimeNumbers.v12.suo
................\FindPrimeNumbers
................\................\Debug
................\................\.....\FindPrimeNumbers.log
................\................\.....\FindPrimeNumbers.obj
................\................\.....\FindPrimeNumbers.tlog
................\................\.....\.....................\CL.read.1.tlog
................\................\.....\.....................\CL.write.1.tlog
................\................\.....\.....................\FindPrimeNumbers.lastbuildstate
................\................\.....\.....................\link.read.1.tlog
................\................\.....\.....................\link.write.1.tlog
................\................\.....\vc120.idb
................\................\.....\vc120.pdb
................\................\FindMax.cpp
................\................\FindPrimeNumbers.vcxproj
................\................\FindPrimeNumbers.vcxproj.filters
................\................\L01_54019380_FindMax.cpp
................\................\L01_54019380_FindPrimeNumbers.cpp
Download