A generalization of the Syracuse algorithm in \({\mathbb{F}}_ q[x]\)

DOI10.1016/0022-314X(87)90032-1zbMath0616.10010OpenAlexW2083700790MaRDI QIDQ1821137

Yanyan Li

Publication date: 1987

Published in: Journal of Number Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-314x(87)90032-1

zbMATH Keywords

finite fieldsdivergent trajectoriesring of polynomialsSyracuse algorithmSyracuse-Kakutani-Collatz problem

Mathematics Subject Classification ID

Recurrences (11B37) Polynomials over finite fields (11T06) Radix representation; digital problems (11A63) Arithmetic theory of polynomial rings over finite fields (11T55) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Related Items (3)

On the nonexistence of nontrivial small cycles of the \(\mu\) function in \(3x+1\) conjecture ⋮ The Collatz problem in \(\mathbb{F}_p [x\) and \(\mathbb{F}_p x\)] ⋮ Analogues of the 3x+ 1 Problem in Polynomial Rings of Characteristic 2

Cites Work

• A generalization of Hasse's generalization of the Syracuse algorithm

This page was built for publication: A generalization of the Syracuse algorithm in \({\mathbb{F}}_ q[x]\)