Factorization using recursion

  • 14
  • Locked
Separate the whole number n, where n > 1, into its prime factors. Display all of its factors in ascending order, separated by spaces. Write a recursive method to calculate the prime factors. Don't create additional fields in the Solution class.
You can't complete this task, because you're not signed in.
  • Popular
  • New
  • Old
You must be signed in to leave a comment
This page doesn't have any comments yet