https://github.com/shlomif/collatz-conjecture

Computer programs to investigate the Collatz Conjecture (3n + 1)
https://github.com/shlomif/collatz-conjecture

collatz collatz-conjecture hacktoberfest math maths

Last synced: 26 days ago
JSON representation

Computer programs to investigate the Collatz Conjecture (3n + 1)

• Host: GitHub
• URL: https://github.com/shlomif/collatz-conjecture
• Owner: shlomif
• License: mit
• Created: 2017-03-15T13:43:17.000Z (almost 8 years ago)
• Default Branch: master
• Last Pushed: 2020-08-10T20:26:59.000Z (over 4 years ago)
• Last Synced: 2024-11-06T06:47:03.255Z (3 months ago)
• Topics: collatz, collatz-conjecture, hacktoberfest, math, maths
• Language: Perl
• Homepage:
• Size: 35.2 KB
• Stars: 1
• Watchers: 3
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
Computer programs by [Shlomi Fish](http://www.shlomifish.org/) to investigate

the [Collatz Conjecture](https://en.wikipedia.org/wiki/Collatz_conjecture) .

Reading from the wikipedia page:

```

The conjecture can be summarized as follows. Take any positive integer n. If n

is even, divide it by 2 to get n / 2. If n is odd, multiply it by 3 and add 1

to obtain 3n + 1. Repeat the process (which has been called "Half Or Triple

Plus One", or HOTPO[7]) indefinitely. The conjecture is that no matter what

number you start with, you will always eventually reach 1.

```