A prime number is a number which is divisible only by itself
and 1. Examples of the first few primes are 2, 3, 5, 7, 11.
Consider writing a program which can generate prime numbers
for you. Your program should read in and set a maximum prime
to generate and a minimum number to start with when looking
for primes.
This program should be able to perform the following tasks:
1. Read the maximum number from user (keyboard input) to
look for primes. The program should not return any primes
greater than this number.
2. Read the minimum number from user (keyboard input) to
look for primes. The program should not return any primes
less than this number.
3. Generate and print out every prime number between the
maximum prime and minimum number specified by the user.
- 0 Answers
- 1744 Views
- I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
What is the use of vtable?
What is scope operator in c++?
What is Name Decoration?
What are the basics of local (auto) objects?
Is there any difference between dlearations int* x and int *x? If so tell me the difference?
How does java differ from c and c++?
Explain the difference between c++ and java.
Is c or c++ more useful?
Write down the equivalent pointer expression for referring the same element a[i][j][k][l]?
What is the equivalent of Pascal's Real a) unsigned int b) float c) char
Can we inherit constructor in c++?
What is the difference between "calloc" and "malloc"?
STL 
