Prime Numbers using functions

[sakonpure6]

Hi I have this homework question that asks the user to make a program where the computer outputs the prime numbers from 1 to 1000. Can you please take a look at my attempt and tell me where I can improve?

#include <iostream>
using namespace std;

void prime_number ();

int main () 
{

prime_number();

return 0;
}


void prime_number ()
{
 int prime=1;
 
 for(int number=1;number<=1000;number++)
 {
 int x=1;

 for(int x=1;x<=number;x++)
{
 if(number%1==0 && number%x==0)
 {
 prime=number;
 cout<<prime<<endl;
 
 }

 }
 
 }
 
}

[sakonpure6]

bump- please help.

[ne555]

Make your program correct, first.

[sakonpure6]

I know the function is wrong hence why I'm posting for help.

[rcast]

Hint* These are fun to do, You left out only the boolean variable that sets a flag if the number can be evenly divided. If the outcome of dividing the outer loop by the inner loop leaves a remainder, set the flag the true, otherwise set it to false and break out of that loop immediatly. Then outside the inner loop test if the flag is true, print the number of the outer loop counter, or 'number' in your case.

[vintho]

I did small changes in your code from above mentioned hint.

void prime_number ()
{
 int prime=0;
 for(int number=1;number<=1000;number++)
 { 
	prime=0;
 	for(int x=2;x<=number/2;x++)
	 {
            if(number%x==0)
  		{
   		         prime=1;
  		         break;
 		}
 	 }

  if(prime!=1)
 	cout<<"Prime number is "<<number<<"\n" ;

 }
 
}