Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/rudxain/collatz_finder
Tries to find a counter-example to the Collatz Conjecture, in Rust
https://github.com/rudxain/collatz_finder
3nplus1 collatz collatz-conjecture collatz-problem computer-science conjecture math search
Last synced: about 5 hours ago
JSON representation
Tries to find a counter-example to the Collatz Conjecture, in Rust
- Host: GitHub
- URL: https://github.com/rudxain/collatz_finder
- Owner: Rudxain
- Created: 2022-07-20T03:04:49.000Z (over 2 years ago)
- Default Branch: main
- Last Pushed: 2024-05-06T17:27:45.000Z (7 months ago)
- Last Synced: 2024-05-06T18:45:01.110Z (7 months ago)
- Topics: 3nplus1, collatz, collatz-conjecture, collatz-problem, computer-science, conjecture, math, search
- Language: Rust
- Homepage:
- Size: 62.5 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 8
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# `colfind`
## Archive
[Reason](https://youtube.com/watch?v=jlh21U2texo&lc=UgzLFcfKTav59WvOB0Z4AaABAg)
> [!note]
> This repo is in maintenance hiatus/stasis.
## Intro
This allows any human to aid in the search for a counter-example that disproves the Collatz Conjecture.
However, currently, this repo is just for learning purposes.
## Usage
> [!important]
> Expect **breaking API changes at literally any time**.
>
> I won't provide support for anything, but you can ask questions if you're curious about stuff.
>
> This isn't meant for production environments, **at all**.
>
> I won't publish it to any package repository.
Install:
```sh
cargo install --git https://github.com/Rudxain/collatz_finder.git
```
ℹinfo:
```sh
colfind help
```
## FAQ
> "What to do if I find a counter-example?"
This is not a stupid question! I would also not know what to do in one of the most epic moments in the history of math and CS!
I suggest you to post your results everywhere! [except Wikipedia](https://en.wikipedia.org/wiki/Wikipedia:No_original_research). To make people take you seriously, you must post the numeral that disproves CC. It'll be **H U G E** , so I recommend posting a [gist](https://gist.github.com) containing the full numeral, and then share links to that gist.
Tip for smaller size: hexadecimal is more compact than dec, raw-binary is more compact than hex. If you use hex or raw, disambiguate endianness.
Another tip, **ensure nobody else takes credit for it.** I know that sounds egotistical, but nobody wants to give countless hours of computing power for free, am I right?
## Features
> [!note]
> The program assumes that numbers don't diverge to +♾️, it only searches cycles. So it could enter an infinite loop that allocates increasingly more memory, until an [OOM](https://en.wikipedia.org/wiki/Out_of_memory) panic happens.
It supports negatives. ~It also supports multiple bases/radices~ (not anymore, sorry 🙁, I might fix it later).
The rationale behind radix support, is that CC is more interesting and helpful to explore/experiment in **bases 2 & 3** and any other base whose factors are 2 and/or 3, and bases whose factors are +-1 offset from 2 and/or 3, so I had to add all bases from 1 to 10 (and hexdec, because it's binary in disguise)
## See also
[My blog](https://rudxain.github.io/blog/post/Collatz)