Related papers: Some Collatz quadratic prime sequences
In this paper, we discuss the well known 3x+1 conjecture in form of the accelerated Collatz function T defined on the positive odd integers. We present a sequence of quotient spaces and an invertible map that are intrinsically related to…
We give a generalization of Collatz conjecture or 3n+1 problem on 2-adic completion of Q. A isometric of $Q_2$ provides information on the average behavior of the firsts terms of the sequence according to the class of $u_0$ modulo $2^m$. A…
In this paper, we will first summarize known results concerning continued fractions. Then we will limit our consideration to continued fractions of quadratic numbers. The second author described periods and sometimes precise form of…
A structured approach for the Collatz conjecture is presented using just the odd integers that are, in turn, divided into categories based on the roles they play such as Starter, Intermediary and Terminal. The expression 4x+1 is used as a…
This paper presents the log-concavity of the $m$-gonal figurate number sequences. The author gives and proves the recurrence formula for $m$-gonal figurate number sequences and its corresponding quotient sequences which are found to be…
We define a so-called square $k$-zig-zag shape as a part of the regular square grid. Considering the shape as a $k$-zig-zag digraph, we give values of its vertices according to the number of the shortest paths from a base vertex. It…
The purpose of this study is to show how to get a necessary criterion for prime numbers with the help of special matrices. My special interest lies in the empirical research of these matrices and their patterns, structures and symmetries.…
In 1986, some examples of algebraic, and nonquadratic, power series over a finite prime field, having a continued fraction expansion with partial quotients all of degree one, were discovered by W. Mills and D. Robbins. In this note we show…
In this paper, we will introduce an extension to the Collatz's conjecture. This conjecture may be seen as a general conjecture that unifies the Collatz one together with many other similar conjectures. For instance, we propose our new…
We show an iterated function of which iterates oscillate wildly and grow at a dizzying pace. We conjecture that the orbit of arbitrary positive integer always returns to 1, as in the case of Collatz function. The conjecture is supported by…
The paper investigates the properties of a nonlinear recursive sequence which includes several ones studied formerly in the literature.
For any positive integer $q$, the sequence of the Euler up/down numbers reduced modulo $q$ was proved to be ultimately periodic by Knuth and Buckholtz. Based on computer simulations, we state for each value of $q$ precise conjectures for…
In 1937, Lothar Collatz conjectured that the sequence generated by the rule $f(n)=3n+1$ for $n\in\mathbb{N}$ odd, $f(n)=n/2$ for $n\in\mathbb{N}$ even, starting in any positive integer $n$ produces $1$. This is equivalent to (1) there are…
A recursive random number generator using prime reciprocals is described.
I show here that there are three different kinds of iterations for the reduced Collatz algorithm; depending on whether the root of the number is odd or even. There is only one kind of iteration if the root is odd and two kinds if the root…
We classify all linear division sequences in the integers, a problem going back to at least the 1930s. As a corollary we also classify those linear recurrence sequences in the integers for which $(x_m,x_n)=\pm x_{(m,n)}$. We also show that…
Carlitz has introduced q-analogues of the Bernoulli numbers around 1950. We obtain a representation of these q-Bernoulli numbers (and some shifted version) as moments of some orthogonal polynomials. This also gives factorisations of Hankel…
We use a generalized Lambert series identity due to the first author to present q-series proofs of recent results of Imamoglu, Raum and Richter concerning recursive formulas for the coefficients of two 3rd order mock theta functions.…
Modifying an idea of E. Brietzke we give simple proofs for the recurrence relations of some sequences of binomial sums which have previously been obtained by other more complicated methods.
The Collatz conjecture is explored using polynomials based on a binary numeral system. It is shown that the degree of the polynomials, on average, decreases after a finite number of steps of the Collatz operation, which provides a weak…