Related papers: On the relationship between the Collatz conjecture…
We show that certain integral positive definite symmetric tridiagonal matrices of determinant $n$ are in one to one correspondence with elements of $(\mathbb Z/n\mathbb Z)^*$. We study some properties of this correspondence. In a somewhat…
This paper is a numerical evaluation of some trajectories of the Collatz function. Specifically, I assess the coalescence points of each integer $n\equiv 0 (\bmod{2})$ and $n\equiv 2(\bmod{3})$ through a sophisticated algorithm that has…
Scientific paper is devoted to establish connection of T-matrix - matrix of composite numbers 6h+1 v 6h-1 in special view - with Legendre's conjecture.
This paper introduces prime holdout problems, a problem class related to the Collatz conjecture. After applying a linear function, instead of removing a finite set of prime factors, a holdout problem specifies a set of primes to be…
In this paper, we convert Collatz map into a simple conjugate iterative maps defined in [0,1]. Such maps are more familiar to us and easier to deal with. Some new features of this map are observed by this method. An interesting heuristic…
The Collatz map (or the $3n{+}1$-map) $f$ is defined on positive integers by setting $f(n)$ equal to $3n+1$ when $n$ is odd and $n/2$ when $n$ is even. The Collatz conjecture states that starting from any positive integer $n$, some iterate…
In the paper, some special linear combinations of the terms of rational cycles of generalized Collatz sequences are studied. It is proved that if the coefficients of the linear combinations satisfy some conditions then these linear…
We estimate the frequency of singular matrices and of matrices of a given rank whose entries are parametrised by arbitrary polynomials over the integers and modulo a prime $p$. In particular, in the integer case, we improve a recent bound…
Very recently, Qi and Cui extended the Perron-Frobenius theory to dual number matrices with primitive and irreducible nonnegative standard parts and proved that they have Perron eigenpair and Perron-Frobenius eigenpair. The Collatz method…
In this article, we introduce and study a new integer sequence referred to as the higher order Mersenne sequence. The proposed sequence is analogous to the higher order Fibonacci numbers and closely associated with the Mersenne numbers.…
Matrices over the dual numbers are considered. We propose an approach to classify these matrices up to similarity. Some preliminary results on the realization of this approach are obtained. In particular, we produce explicitly canonical…
Classifications of twin primes are established and then applied to triplets that generalize to all higher multiplets. Mersenne and Fermat twins and triplets are treated in this framework. Regular prime number multiplets are related to…
The Collatz Conjecture can be stated as: using the reduced Collatz function $C(n) = (3n+1)/2^x$ where $2^x$ is the largest power of 2 that divides $3n+1$, any odd integer $n$ will eventually reach 1 in $j$ iterations such that $C^j(n) = 1$.…
Pausinger recently investigated a special determinant involving prime numbers. In this short note we point out that this type of determinants was already known in linear algebra and its computation is unrelated to prime numbers.
The Collatz conjecture (also known as the $3x+1$ problem) concerns the behavior of the discrete dynamical system on the positive integers defined by iteration of the so-called $3x + 1$ function. We investigate analogous dynamical systems in…
Estimating the condition numbers of random structured matrices is a well known challenge, linked to the design of efficient randomized matrix algorithms. We deduce such estimates for Gaussian random Toeplitz and circulant matrices. The…
We announce a number of conjectures associated with and arising from a study of primes and irrationals in $\mathbb{R}$. All are supported by numerical verification to the extent possible.
The Collatz conjecture can be stated in terms of the reduced Collatz function R(x) = (3x+1)/2^m (where 2^m is the larger power of 2 that divides 3x+1). The conjecture is: Starting from any odd positive integer and repeating R(x) we…
We speculate on the distribution of primes in exponentially growing, linear recurrence sequences $(u_n)_{n\geq 0}$ in the integers. By tweaking a heuristic which is successfully used to predict the number of prime values of polynomials, we…
In this paper, two approximation algorithms are given. Let N be an odd composite number. The algorithms give new directions regarding primality test of given N. The first algorithm is given using a new method called digital coding method.…