maths/collatz_sequence.py · Cryien/Python

Fetch the repository succeeded.

Scan WeChat QR to Pay

Cancel

Complete

richgiteeai

Watch

Unwatch Watching Releases Only Ignoring

1 Star 0 Fork 324

Cryien/Python

forked from 编程语言算法集/Python

Code Issues 0 Pull Requests 0 Wiki Insights Pipelines

Service

Tencent Cloud Serverless

Create your Gitee Account

Explore and code with more than 14 million developers,Free private repositories !:)

Already have an account? Sign in

文件

master

Branches (94)

Manage

master

pre-commit-ci-update-config

Python-3.14

uv-again

Sphinx-runs-on-ubuntu-24.04-arm

dependabot/github_actions/astral-sh/setup-uv-5

Shebang-python-for-Windows

gh-pages

Test-on-Python-3.13-beta

cclauss-patch-2

Keep-GitHub-Actions-up-to-date-with-Dependabot

Fewer-forward-propogations-to-speed-tests

cclauss-patch-1

Add-dataclasses-to-binary_search_tree.py

Simplify-is_bst.py

test-cov-gh-action

dhruv/remove

Remove-backslashes-from-is_palindrome.py

fuzzy_operations.py-on-Python-3.12

Python-3.12-on-Debian-bookworm

Clone or Download

Clone/Download

HTTPS SSH SVN SVN+SSH Download ZIP

Prompt

To download the code, please copy the following command and execute it in the terminal

To ensure that your submitted code identity is correctly recognized by Gitee, please execute the following command.

git config --global user.name userName 
git config --global user.email userEmail

When using the SSH protocol for the first time to clone or push code, follow the prompts below to complete the SSH configuration.

1 Generate RSA keys.

2 Obtain the content of the RSA public key and configure it in SSH Public Keys

To use SVN on Gitee, please visit the usage guide

When using the HTTPS protocol, the command line will prompt for account and password verification as follows. For security reasons, Gitee recommends configure and use personal access tokens instead of login passwords for cloning, pushing, and other operations.

Username for 'https://gitee.com': userName

Password for 'https://userName@gitee.com': # Private Token

Branches 94

Tags 0

Python

maths

collatz_sequence.py

collatz_sequence.py 2.47 KB

"""
The Collatz conjecture is a famous unsolved problem in mathematics. Given a starting
positive integer, define the following sequence:
- If the current term n is even, then the next term is n/2.
- If the current term n is odd, then the next term is 3n + 1.
The conjecture claims that this sequence will always reach 1 for any starting number.

Other names for this problem include the 3n + 1 problem, the Ulam conjecture, Kakutani's
problem, the Thwaites conjecture, Hasse's algorithm, the Syracuse problem, and the
hailstone sequence.

Reference: https://en.wikipedia.org/wiki/Collatz_conjecture
"""

from __future__ import annotations

from collections.abc import Generator

def collatz_sequence(n: int) -> Generator[int]:
 """
 Generate the Collatz sequence starting at n.
 >>> tuple(collatz_sequence(2.1))
 Traceback (most recent call last):
 ...
 Exception: Sequence only defined for positive integers
 >>> tuple(collatz_sequence(0))
 Traceback (most recent call last):
 ...
 Exception: Sequence only defined for positive integers
 >>> tuple(collatz_sequence(4))
 (4, 2, 1)
 >>> tuple(collatz_sequence(11))
 (11, 34, 17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 1)
 >>> tuple(collatz_sequence(31)) # doctest: +NORMALIZE_WHITESPACE
 (31, 94, 47, 142, 71, 214, 107, 322, 161, 484, 242, 121, 364, 182, 91, 274, 137,
 412, 206, 103, 310, 155, 466, 233, 700, 350, 175, 526, 263, 790, 395, 1186, 593,
 1780, 890, 445, 1336, 668, 334, 167, 502, 251, 754, 377, 1132, 566, 283, 850, 425,
 1276, 638, 319, 958, 479, 1438, 719, 2158, 1079, 3238, 1619, 4858, 2429, 7288, 3644,
 1822, 911, 2734, 1367, 4102, 2051, 6154, 3077, 9232, 4616, 2308, 1154, 577, 1732,
 866, 433, 1300, 650, 325, 976, 488, 244, 122, 61, 184, 92, 46, 23, 70, 35, 106, 53,
 160, 80, 40, 20, 10, 5, 16, 8, 4, 2, 1)
 >>> tuple(collatz_sequence(43)) # doctest: +NORMALIZE_WHITESPACE
 (43, 130, 65, 196, 98, 49, 148, 74, 37, 112, 56, 28, 14, 7, 22, 11, 34, 17, 52, 26,
 13, 40, 20, 10, 5, 16, 8, 4, 2, 1)
 """
 if not isinstance(n, int) or n < 1:
 raise Exception("Sequence only defined for positive integers")

yield n
 while n != 1:
 if n % 2 == 0:
 n //= 2
 else:
 n = 3 * n + 1
 yield n

def main():
 n = int(input("Your number: "))
 sequence = tuple(collatz_sequence(n))
 print(sequence)
 print(f"Collatz sequence from {n} took {len(sequence)} steps.")

if __name__ == "__main__":
 main()

Copy Edit Raw Blame History

pre-commit-ci[bot] authored 2024年11月26日 04:46 +08:00 . [pre-commit.ci] pre-commit autoupdate (#12398)

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67

"""
The Collatz conjecture is a famous unsolved problem in mathematics. Given a starting
positive integer, define the following sequence:
- If the current term n is even, then the next term is n/2.
- If the current term n is odd, then the next term is 3n + 1.
The conjecture claims that this sequence will always reach 1 for any starting number.

Other names for this problem include the 3n + 1 problem, the Ulam conjecture, Kakutani's
problem, the Thwaites conjecture, Hasse's algorithm, the Syracuse problem, and the
hailstone sequence.

Reference: https://en.wikipedia.org/wiki/Collatz_conjecture
"""

from __future__ import annotations

from collections.abc import Generator


def collatz_sequence(n: int) -> Generator[int]:
 """
 Generate the Collatz sequence starting at n.
 >>> tuple(collatz_sequence(2.1))
 Traceback (most recent call last):
 ...
 Exception: Sequence only defined for positive integers
 >>> tuple(collatz_sequence(0))
 Traceback (most recent call last):
 ...
 Exception: Sequence only defined for positive integers
 >>> tuple(collatz_sequence(4))
 (4, 2, 1)
 >>> tuple(collatz_sequence(11))
 (11, 34, 17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 1)
 >>> tuple(collatz_sequence(31)) # doctest: +NORMALIZE_WHITESPACE
 (31, 94, 47, 142, 71, 214, 107, 322, 161, 484, 242, 121, 364, 182, 91, 274, 137,
 412, 206, 103, 310, 155, 466, 233, 700, 350, 175, 526, 263, 790, 395, 1186, 593,
 1780, 890, 445, 1336, 668, 334, 167, 502, 251, 754, 377, 1132, 566, 283, 850, 425,
 1276, 638, 319, 958, 479, 1438, 719, 2158, 1079, 3238, 1619, 4858, 2429, 7288, 3644,
 1822, 911, 2734, 1367, 4102, 2051, 6154, 3077, 9232, 4616, 2308, 1154, 577, 1732,
 866, 433, 1300, 650, 325, 976, 488, 244, 122, 61, 184, 92, 46, 23, 70, 35, 106, 53,
 160, 80, 40, 20, 10, 5, 16, 8, 4, 2, 1)
 >>> tuple(collatz_sequence(43)) # doctest: +NORMALIZE_WHITESPACE
 (43, 130, 65, 196, 98, 49, 148, 74, 37, 112, 56, 28, 14, 7, 22, 11, 34, 17, 52, 26,
 13, 40, 20, 10, 5, 16, 8, 4, 2, 1)
 """
 if not isinstance(n, int) or n < 1:
 raise Exception("Sequence only defined for positive integers")

 yield n
 while n != 1:
 if n % 2 == 0:
 n //= 2
 else:
 n = 3 * n + 1
 yield n


def main():
 n = int(input("Your number: "))
 sequence = tuple(collatz_sequence(n))
 print(sequence)
 print(f"Collatz sequence from {n} took {len(sequence)} steps.")


if __name__ == "__main__":
 main()