The prime factorization of a number is the unique list of prime numbers that, when multiplied, gives the number. For example, the prime factorization of 60 is 2 ∗ 2 ∗ 3 ∗ 5. In this problem you must write code to recursively find and return the prime factorization of the given number. You must print these in ascending sorted order with spaces in between. For example, if your input is: 120 then you should print the following output: 2 2 2 3 5

Question

23-10-2019
Computers and Technology

contestada

The prime factorization of a number is the unique list of prime numbers that, when multiplied, gives the number. For example, the prime factorization of 60 is 2 ∗ 2 ∗ 3 ∗ 5. In this problem you must write code to recursively find and return the prime factorization of the given number. You must print these in ascending sorted order with spaces in between. For example, if your input is: 120 then you should print the following output: 2 2 2 3 5

Respuesta :

Otras preguntas

HELP ASAP! Explain what happens to energy that is not used A) lost energy is transferred as heat energy B) lost energy disappears C)unused energy is destroyed

help please please please i need answer

Which expression is represented by the model? A. X-3 B. X+3 C. -X-3 D.-X+3

Match each quadratic equation with its solution set. 2x2 − 32 = 0 4x2 − 100 = 0 x2 − 55 = 9 x2 − 140 = -19 2x2 − 18 = 0 {-8, 8} arrowRight {-4, 4} arrowRight {-

Simplify 8^3 using scientific calculator

Determine the enthalpy change of the following reaction: CO + H2O -> H2 + CO2 Given enthalpies: CO: -110.525 kJ/mol H2: 0 kJ/mol H2O: -285.8 kJ/mol CO2: -

NEED HELP ASAP ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

the center of the earth. Order the layers as you would encounter them, from the outside in.

Could someone please help me with this ASAP thank you!

Why is the weather so hard to predict?

CPED CPED · Answer 1 · 2019-10-29T18:12:32+01:00

Answer:

Class is created with name PrimeFactorisation.
isPrime(int num) is a method-> it will check whether the number given as a parameter is prime or not in time equal to O(sqrt(num)).
printPrimeFactors(int num) -> a recursive method for printing the prime factors.

Main method will be written to take a integer as input from user a.

We know that if a no x if divisible by y. than (y) and (x/y) are its factors and if they are prime numbers also , then they will be the prime factors.

Using this concept you can make recursive calls printPrimeFactors(y), printPrimeFactors(x/y).

Explanation:

The code in java is explained below in image using comments before each statement.

The output image is also attached.