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
What else can I help you with?
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
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 the prime factorization of 37 using exponents?
37 is a prime number because it has only two factors which are itself and one
What is arithmetic tree?
an arithmetic tree an is formula using prime and composite number to express its factors.
What are the factors and prime factors of 103?
103 is a prime number. The only two factors of a prime number are 1 and itself. The only factor pair of 103 is 1 x 103. There is only one factor pair of a prime number. The proper factors of 103 are only 1 or, if the definition you are using excludes 1, there are none. The only prime factor of 103 is 103. There is only one prime factor of a prime number - itself. The distinct prime factor (listing each prime factor only once) of 103 is also 103.
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 the prime numbers for 374?
To find the prime factors of any number then divide the number by prime numbers of increasing value. When a prime number wholly divides the original number repeat the process with the same prime number but each time with the new quotient until complete division does not occur. Repeat with a prime number of higher value until the final quotient is 1. Using this process gives the prime factors of 374 as 2, 11 and 17.
What are the prime factors of 725 using exponents?
the prime factors of 725 using exponents are 5^2 x 29
