Edge Rewrite
// HTMLRewriter · presentation

This page was redesigned at the edge.

Cloudflare fetched the original article and streamed it through HTMLRewriter to apply an entirely new visual system without rebuilding the source page.

// request.cf · coarse context

A page that knows where it met you.

Only coarse request metadata is shown. This demo does not display or persist visitor IP addresses.

Country
US
Cloudflare location
CMH
Connection
HTTP/2
Language
Not provided

Ray ID: a249f3bc9c5b90c0

Jump to content

Talk:Collatz conjecture

Page contents not supported in other languages.
Add topic
From Wikipedia, the free encyclopedia
Latest comment: 19 days ago by Hlopov Eremei in topic Collatz graph redirects to Clollatz conjecture.

Another fractal

[edit]

https://yozh.org/2012/01/12/the_collatz_fractal/ Rudxain (talk) 02:20, 11 October 2025 (UTC)Reply

Function for sequence length

[edit]

Apologies if this has been covered earlier.

Is there a function that will convert an input integer into a Collatz sequence length? For example, F(12) = 10, F(19) = 21, F(27) = 111, etc.

I suspect the answer is no, because if such a function did exist, it would be a simple step to then prove or disprove the conjecture. but I'd like an explanation if possible. Thanks. -- Jack of Oz [pleasantries] 18:40, 3 November 2025 (UTC)Reply

The answer is yes, if and only if the Collatz conjecture is true. If the conjecture is false, and some diverges, then does not exist. But if the conjecture is true, then the function exists and is computable: just run the Collatz iteration starting from , count how many steps it takes, and return that number. Whether it is a primitive recursive function or has a closed-form expression are different questions. The same non-rigorous probabilistic reasoning that suggests the conjecture to be true also suggests that the number of steps is typically only logarithmic in but that is not even close to being proven. —David Eppstein (talk) 19:01, 25 November 2025 (UTC)Reply
I do nor know of a function, but I do know a method that makes it easier to determine the number of steps. It is best used when the number of steps will be large, since it would be quicker to just do the iteration if the number is small. Method: You create a spreadsheet with combinations of 3^n/2^m (2^m is always larger than 3^n). The size of the spreadsheet depends on the size of the selected number for which the number of steps is to be calculated. Then multiple the selected number by the various fractions in the spreadsheet. Then look for values between 0.95 and 0.80. There may be a few within this range. The number of steps will be the sum of the exponent of 3 with the exponent of 2. For example 19 has 20 steps (3^6/2^14) x 19 [0.845398] and 27 has 111 steps (3^41/2^70) x 27 [0.834133]. There probably will be several fractions that will give a result in the range, so you have to manually check each one to make sure you get the correct fraction. It is a lot of work at the beginning, setting up the spreadsheet and learning how to check the various fractions, but it gets easier after a few times. I am not allowed to give the citation of the paper, since this is consider PROMOTING. Just search for a paper publish last year around late summer / early fall. ~2025-36800-42 (talk) 06:58, 28 November 2025 (UTC)Reply

Some of the math text isn't properly formatted :(

[edit]

It looks like under the "Statement of the Problem" section that there is unformatted text. I don't know how to fix it, but does anyone here know how? ✧𝒎𝒂𝒕𝒄𝒉𝒂✧💬17:07, 25 November 2025 (UTC)Reply

It looks fine to me. Can you be more specific, or upload a picture of what the problem is? --JBL (talk) 18:45, 25 November 2025 (UTC)Reply
might be an issue on my end, it says this: $ {\displaystyle f(n)={\begin{cases}n/2&{\text{if }}n\equiv 0{\pmod {2}},\\3n+1&{\text{if }}n\equiv 1{\pmod {2}}.\end{cases}}} $ ✧𝒎𝒂𝒕𝒄𝒉𝒂✧💬19:30, 25 November 2025 (UTC)Reply
Check your preferences, under appearance, at the bottom: do you have math rendering set to "LaTeX source (for text browsers)"? Use one of the other three choices. —David Eppstein (talk) 19:37, 25 November 2025 (UTC)Reply
okay! i'll try that! thank you :D ✧𝒎𝒂𝒕𝒄𝒉𝒂✧💬20:40, 25 November 2025 (UTC)Reply

There is an error in {File:All Collatz sequences of a length inferior to 20.svg}. On the right, there is a circle painted black, but it should be a purple circle with number 1048576.  Preceding unsigned comment added by ~2026-31609-26 (talk) 11:17, 27 May 2026 (UTC)Reply

Adding a visualization for the mapping (rather than convergence)

[edit]

https://kentslaney.github.io/ideal-bassoon/

I'm interested in adding a visualization from the above URL to the article (probably the base 3 version), but I'm new to contributing here and wanted to double-check the original research requirements and whatnot before writing the JavaScript to export it properly to GIF. Is there anything I should know before posting? What would be an appropriate sequence length? Here's a watermarked screen recording for 27. Kslaney (talk) 18:54, 1 December 2025 (UTC)Reply

Git provided repo wiki for extended presentation, visualization is specific method, and what uses yours Finite-state machine? Processing, which peculiarity or property related conjection did it highlight? MashiraV (talk) 19:38, 12 July 2026 (UTC)Reply

\triangleq meets \particleq

[edit]

Is being used in this article to mean "is defined as"? If so, this goes against MOS:MATH, which advises the use of a plain . Stepwise Continuous Dysfunction (talk) 08:53, 18 March 2026 (UTC)Reply

Collatz graph redirects to Clollatz conjecture.

[edit]

It definitely needs it's own article, and it's certainly doable. Hlopov Eremei (talk) 05:41, 30 June 2026 (UTC)Reply

Which algebra? I'm not directly interested in the material; specialists tend to try to use induction on numbers. Arithmetic pseudorandom number generators are a closely related field to statistics, so my expectations are different. The collaborative task is the development of distributed computing and numerical processors, but with targeted personal attention, the expected group is small, and intellectual development in this area is quite limited.
In the related field of diaphantic equations, I prefer to study them using cybernetics and ergodicity methods; any rational manifestation signals an expansion of the information pool. MashiraV (talk) 23:18, 12 July 2026 (UTC)Reply
@MashiraV uuuuuuh Hlopov Eremei (talk) 04:31, 13 July 2026 (UTC)Reply