Topic: Factoring a positive integer into prime factors. For example, if you enter 90, you will print

#include

#include

int main()

int i=2,n;

printf("Please enter the positive integer that needs to be exploded:");

scanf("%d",&n);

printf("The result of factoring the prime factor is: %d=",n);

while(n>=2)

if(n%i==0)

else i++;

printf("\b \b");

system("pause");

return 0;

Questions are written in C.

Answer: For a number, its prime factors must be distributed on both sides of the square root of the number, and there is at most only one prime factor greater than the square root, and it must be the quotient remaining after the decomposition to the end. So, we just need to construct a loop that starts at 2 and ends with sqrt(n). Determine whether the number is divisible by positive integers, and break down the number into factors

How do you write the degree of questioning?

If this prime number is exactly equal to n, it means that the process of decomposing the prime factor has ended, and it can be printed.

If n!=k, but n is divisible by k, then you should print out the value of k, divide n by the quotient of k, as a new positive integer you n, repeat the first step.

If n is not divisible by k, use k+1 as the value of k and repeat the first step.

Question: Can you write a program?

Enter an integer, factorize it 12 to print out 12 = 2 2 * 3 Enter an integer, factor it to 12 print out 12 = 2 2 * 3 pro! Hello, happy to answer your <>

Input an integer and decompose it by factoring 12 to print out 12 = 2 2 * 3 The method is as follows: According to "the maximum factor and the smallest multiple of a number are its own", the number is 12, and then 12 is written in the form of multiplying several prime numbers Answer Solution: The maximum factor and the smallest multiple of a number are both itself", and the number is 12, 12 = 2 2 3 So the answer is: 12, 12 = 2 2 3 Comments This question mainly examines the meaning of Lao Zheng numbers and multiples and the method of decomposing prime factors, I hope mine can help you <>

Do you have any other questions?

Factorize a positive integer into a prime cause bai

Number. For example, enter du60; Print out the 2*3*5*2 algorithm to implement the idea:

1. Use scanner to implement input one.

DAO positive integer n

2. Use a for loop to iterate over a number that starts from k=2 to k<=n 3. If n%k==0, output the value of k.

4. Then recursion the value of n, i.e. n=n k

5. At this time, the for loop should be re-executed, that is, k=2 should be redefined below the implementation **:

Here's the result.

The above is the idea and implementation of the later collation, as soon as I got this topic, I immediately did it, but I immediately fell into all kinds of pits, I think that in the future, I will think about the idea of doing the problem first, from part to whole, otherwise a simple algorithm problem will consume a lot of time.

Decompose 90 into a prime factor of 90 = 2 5 3 3 So the answer is:

Factoring 90 into a prime factor of 90 = 2 5 3 3

So the answer is:

The decomposed prime factor called this composite number is 9 = 3 3

Decompose prime factors: Each composite number can be written in the form of multiplying several prime numbers. Each of these prime numbers is a factor of this composite number.

Decomposing prime factors is only for composite numbers.