0
#include
#include
void main()
{
int n,i;
clrscr();
printf("Enter a Number:");
scanf("%d",&n);
printf("\n\nPrime Factors of %d is: ",n);
for(i=2;i<=n;i++)
{
if(n%i==0)
{
printf("%d,",i);
n=n/i;
i--;
if(n==1)
break;
}
}
getche();
}
this program will find the prime factors of a given number
any assistance
mail at :- devilllcreature@Yahoo.com
thank you
Add your answer:
Earn +20 pts
Can you use a number twice when working out HCF using prime factors?
Yes.
What is the prime factorization of 11 using factor trees?
11 is a prime number therefore the only number that factors 11 is 1 and itself
What are the prime factors of 18 number using exponents?
2 x 32 = 18
What are the prime factors of the number 441 using powers?
32 x 72 = 441
What is the prime factorization of 97 using exponents?
the only prime factors or 97 is 1 and 97... therefore 97 is a prime number... using exponents --> 11 * 971 = 97
What the prime factorization of 37 using exponents?
37 is a prime number because it has only two factors which are itself and one
Is 3601 a prime number?
If you are using Linux/Unix, type 'factor 3601' in a terminal. The factors of 3601 are 13 and 277; therefore, it is not a prime number.
What are the prime factors of 26 using exponents?
The prime factors of 26 are 2 and 13.
What is prime factors of 142 by using division method?
prime factors
What is arithmetic tree?
an arithmetic tree an is formula using prime and composite number to express its factors.
What are the prime factors of 725 using exponents?
the prime factors of 725 using exponents are 5^2 x 29
Find the prime factors of 87 using prime factorization?
The prime factors of 87 are 3 x 29
