choyiny / factorizing-semiprimes Goto Github PK

https://google.github.io/styleguide/javaguide.html

Would like for the Java code to be compliant with Google style guide.

(Claimed: @andreybleme)

Just for fun!

Create a GUI with Java to allow user to input numbers themselves. (@richa-coder)

Right now the IDE project files still exist in the repo. The goal of this issue is to remove the excess files from the repo.

Would like someone to create a CONTRIBUTION.MD for this project. A few points worthy to mention:

• follow google's java code style
• documentation of code
• when submitting PR make sure it is well outlined/explained
• other points you feel is necessary.

@Wferr claimed

In number theory, the general number field sieve (GNFS) is the most efficient classical algorithm known for factoring integers larger than 10^100.

Your task is to implement the GNFS algorithm in Main.java. Please do not copy code off the internet. Your code must be documented with extensive comments proving it is your own work.

Create a new function to implement Fermat's Factorisation Method, Brute Force Method or Pho's Rollard method with BigIntegers.

See Main.java for current implementation without BigIntegers.

• Brute Force #10
• Fermat's Factorization Method
• Pho's Rollard Method #18
• Some other factorization method? #15

Unticked ones are not claimed.

Beginner issue for Hacktoberfest! Please let some new contributors have a go at this.

Relevant documentation:
https://git-scm.com/docs/gitignore