Calculate and display the Collatz sequence (3n+1 problem) for very large integers. Sequence is handled as vector in memory.
-
Updated
Oct 5, 2023 - Rust
Calculate and display the Collatz sequence (3n+1 problem) for very large integers. Sequence is handled as vector in memory.
Iterative process of adding numbers with their palindrome in order to end up with a new palindrome, or not...
A simple command line visualizer of the Collatz Conjecture.
A constructive calculation of the stamp folding problem
A class to test and analyse particular numbers or range of numbers against Collatz conjecture.
Graphic representations of Collatz sequences
A CLI for exploring Collatz sequences written in rust.
📊 Unsolved Codeforces Problems website 📊
Minimal elements for the base b representations of the prime numbers > b for the subsequence ordering, for 2 ≤ b ≤ 36
This repository was setup to help people who believe that they solved the P vs NP problem and to help the people who review proposed solutions.
CpZen is an Online Integrated Development Environment (IDE) for competitive programmers made as the Lab project for CSE 4510: Software Development Lab.
2500 yıldır çözülemeyen soru
Daimi Asal Sayı Sorusu
Add a description, image, and links to the unsolved-problems topic page so that developers can more easily learn about it.
To associate your repository with the unsolved-problems topic, visit your repo's landing page and select "manage topics."