Pages that link to "Item:Q1186306"

The following pages link to The \(3x +1\) problem: Two stochastic models (Q1186306):

Displaying 14 items.

• A randomized version of the Collatz \(3x + 1\) problem (Q899629) (← links)
• A generalization of the Collatz problem. Building cycles and a stochastic approach (Q1609207) (← links)
• The \(3x+1\) problem: a lower bound hypothesis (Q1746201) (← links)
• Statistical properties of an iterated arithmetic mapping (Q1906368) (← links)
• Multiplication algorithm based on Collatz function (Q2032292) (← links)
• The Collatz conjecture and the quantum mechanical harmonic oscillator (Q2072220) (← links)
• A probabilistic model for the 5\(x\)+1 problem and related maps (Q2490050) (← links)
• Maximum excursion and stopping time record-holders for the problem: Computational results (Q4221986) (← links)
• Embedding the 3x + 1 Conjecture in a 3x + d Context (Q4228030) (← links)
• Greedy Search on the Binary Tree with Random Edge-Weights (Q4291188) (← links)
• Lower bounds for the total stopping time of 3𝑥+1 iterates (Q4794658) (← links)
• The Distribution of 3x+1 Trees (Q4891843) (← links)
• Investment models for the \(3N+1\) conjecture (Q5399323) (← links)
• Almost all orbits of the Collatz map attain almost bounded values (Q5863760) (← links)