how to print all prime numbers between 2 numbers

[saraA]

Can anyone help me with this question please

Write a program that prompts the user to enter two positive integers m and n where m < n then output all prime numbers in the range m and n, inclusive. You must write a function that would test a number whether it is prime.

thanks in advance

[Catfish666]

Duplicate thread here:
http://www.cplusplus.com/forum/beginner/118301/

[eyenrique]

Hi @saraA,

first off you
have to study the
algorithm to find
prime numbers i
saw your last code
and after all you
are not lost at all.

-This is not the best way but
works-

Enter two numbers to
find primes
First: 41
Second: 20
Enter first number again: 20
Second: 41

Prime numbers in the range 20 41
23 29 31 37 41

//prime.cpp
//##

#include <iostream>
using std::cout;
using std::cin;
using std::endl;


bool isPrime(int number); //function prototype

int main(){
int m;
int n;

	cout<<"Enter 2 numbers to\nfind primes\nFirst: ";
	cin>>m;
	cout<<"Second: ";
	cin>>n;
	while(!(m<n)){//while m is not less than n 
		cout<<"Enter first number again: ";
		cin>>m;
        cout<<"Second: ";
        cin>>n;
	}//end while

	for(int number=m;number<=n;number++){
		if(isPrime(number))
			cout<<number<<' ';
	}//end for
	cout<<endl;


return 0; //inidcates success
}//end main

bool isPrime(int number){
	int divisible_numbers=0;

		for(int i=1;i<=number;i++){
			if(number%i==0)
				++divisible_numbers;
		}//end for
		if(divisible_numbers==2)
			return true;


return false;
}//end function isPrime