Question

Help! i can't get the correct output for this question:

Write a program that will read in an integer from the user and test to see whether or not it is prime. You are to determine if each integer read is prime or not, and output the result to the screen as shown below. If a number is prime, your output should read:

101 = 1 x 101
101: PRIME Number

For a number that turns out not to be prime, your output should read:

333 = 1 x 333
333 = 3 x 111
333 = 9 x 37
333: NOT A PRIME Number

After each test allow the user to exit or input the next number to be tested.

Example interaction:

PRIME NUMBER CHECKER

Enter Value: 101

101 = 1 x 101
101: PRIME Number

Would you like to enter another value? (1=Yes, 0=No)> 1

Enter Value: 333

333 = 1 x 333
333 = 3 x 111
333 = 9 x 37
333: NOT A PRIME Number

Would you like to enter another value? (1=Yes, 0=No)> 0

My code is below. It giving more output than it should. Like it's compound and printing the same over and over. Like This:

Input

1768374681

1

5001

0

Your output

1768374681 = 1 X 1768374681

1768374681 = 3 X 589458227

1768374681 = 157 X 11263533

1768374681 = 471 X 3754511

1768374681 = 3754511 X 471

1768374681 = 11263533 X 157

1768374681 = 589458227 X 3

1768374681:NOT A PRIME Number

5001 = 1 X 5001

5001 = 3 X 1667

5001 = 1667 X 3

5001:NOT A PRIME Number

Your output does not contain - Correct format!!

1768374681 = 1 x 1768374681

1768374681 = 3 x 589458227

1768374681 = 157 x 11263533

1768374681 = 471 x 3754511

1768374681: NOT A PRIME Number

#include <stdio.h>

int main()

{

int n, i,x,w;
scanf("%d",&n);

x=prime(n);

if(x==0){

for(i=1;i<n;i++){

if(n%i==0){

printf("%d = %d X %d\n",n,i,n/i);

}

}

printf("%d:NOT A PRIME Number\n",n);

}

else if(x==1){

printf("%d = %d X %d\n",n,1,n);

printf("%d: PRIME Number\n",n);

}

do{

scanf("%d",&w);

switch(w){

case 1:

scanf("%d",&n);

x=prime(n);

if(x==0){

for(i=1;i<n;i++){

if(n%i==0){

printf("%d = %d X %d\n",n,i,n/i);

}

}

printf("%d:NOT A PRIME Number\n",n);

}

else if(x==1){

printf("%d = %d X %d\n",n,1,n);

printf("%d: PRIME Number\n",n);

}

break;

}

}while(w!=0);

  

return 0;

}

int prime(int n){

int i,flag=0;

for(i=2; i<=n/2; ++i)

{

if(n%i==0)

{

flag=1;

break;

}

}

if (flag==0)

return 1;

else

return 0;

}

Thank you!!

Answer 1

Program:

#include <stdio.h>
#include <math.h>

//function prototype
int prime(int n);

//main function
int main()
{
int n, m, i, x, w;

do
{
printf("PRIME NUMBER CHECKER\n\n");

printf("Enter value: ");
scanf("%d",&n);

x=prime(n);

if(x==0){
m = sqrt(n);
for(i=1;i<=m;i++)
{
if(n%i==0){
printf("%d = %d X %d\n",n,i,n/i);
}
}
printf("%d:NOT A PRIME Number\n",n);
}
else
{
printf("%d = %d X %d\n",n,1,n);

printf("%d: PRIME Number\n",n);
}

printf("\nWould you like to enter another value? (1=Yes, 0=No): ");
scanf("%d", &w);

}while(w!=0);

return 0;

}

//function to check prime number
int prime(int n)
{

int i, m;
m = sqrt(n);

for(i=2; i<=m; ++i)
{
if(n%i==0) return 0;
}

return 1;
}

Output: