An incredibly inefficient attempt to factor a number that is too large to have any hope of success
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 
Pete Rijks a2b7ddc0d3 Skip checking multiples of 5 10 months ago
.gitignore Initial Commit 11 months ago
LICENSE Initial commit 11 months ago
Makefile Initial Commit 11 months ago
README.md Update README.md 11 months ago
factorpn.c Skip checking multiples of 5 10 months ago
knownfactors.c Initial Commit 11 months ago
knownfactors.h Initial Commit 11 months ago
knownfactors.txt Initial Commit 11 months ago
pn.c Initial Commit 11 months ago
pn.h Initial Commit 11 months ago

README.md

InefficientFutileSearch

An incredibly inefficient attempt to factor a number that is too large to have any hope of success

Many years ago, I defined Pete's Number, a 75087-digit number.

In 2021 I decided to see how far I could get factoring it. So far there are four known factors:

  • 19
  • 53
  • 25715687
  • 190528216559

I have very low hopes of finding all factors, but for some reason I've embraced the futility and am trying to at least find a fifth factor.

Learn more here

Even with an efficient algorithm, this would probably be an exercise in futility. And the efficient algorithms tend to have high storage requirements. I want something with low storage requirements and that is easy to pause/resume. I also didn't want to put a lot of time into coding this. So this is an incredibly hacky, ugly, inefficient piece of code. You should probably just turn around now.