Prime Factorization

[fave77]

Do the checklist before filing the issue:

• [x] Do you have Node.js and all the relevant dev-dependencies installed?
• [ ] Is this a bug fix?
• [x] Is this an enhancement?
• [x] Is this a feature request?

NOTE: Provide a clear and concise description of the feature that needs to be added! Or if its a bug, then provide the necessary steps to reproduce it along with screenshots.

• Give your answer below:

---

• Function: M.findPrimeFactors()
• Argument: Positive Integer
• Return-Type: Array-of-prime-numbers
• Resource: https://www.geeksforgeeks.org/print-all-prime-factors-of-a-given-number/

[NOTE: Instead of printing, you must return all the prime factors in an array]

[tipavlos]

I am new to github and i would like to work on this. This seems easy , I think you have to replace every print command with array.push

[fave77]

@tipavlos are you a gssoc19 participant?

[tipavlos]

I'm not.

[fave77]

@tipavlos I'm really sorry but this issue is labeled as gssoc19 and is only for the participants. If you want to contribute, you're more than welcome to raise a new issue and comment that you wanna work on it. I'll be happy to assign it.

Tips for raising valid issues: Go through the codebase and review closed issues for more insights as what kind of features go along with mathball.

[gourabk121]

I would like to solve this

[fave77]

@gourabk121 first confirm if you're a gssoc participant!

[sweezy793]

I would like to work on this.

[fave77]

@sweezy793 you're assigned.

[gourabk121]

yes i'm

[sweezy793]

yes i'm

I've already been assigned this issue and I will be opening a PR soon.

[fave77]

@gourabk121 confirm your slack username!