Related papers: An iteration based on prime and composite factors
Combinatorial properties of maximal repetitions (runs) in formal words are studied. We classify all maximal repetitions in a word as primary and secondary where the set of all primary repetitions determines all the other repetitons in the…
Some class of sums which naturally include the sums of powers of integers is considered. A number of conjectures concerning a representation of these sums is made.
In the paper we present a description of complex systems in terms of self-organization processes of prime integer relations. A prime integer relation is an indivisible element made up of integers as the basic constituents following a single…
To factor an integer N, given that it is equal to the product of two primes, it suffices to find an integer d satisfying a certain simple numerical test. In this approach, the factorization problem equates to the problem of designing an…
In this paper, we consider a discrete version of iterated integrals by the naive (equally divided) Riemann sum. In particular, basic three formulas for usual iterated integrals are discritized. Moreover, we proved cyclic sum formulas for…
We identify pairs of positive integers $(t, d)$ with the property that the integer sequence with general term $\lfloor{n^t/d\rfloor}$ contains at most finitely many primes.
We describe birational representations of discrete groups generated by involutions, having their origin in the theory of exactly solvable vertex-models in lattice statistical mechanics. These involutions correspond respectively to two kinds…
We study sums of arithmetic functions, defined on Gaussian integers and taken over those pairs of integers whose coordinates give rise to a singular system.
Determining whether a given integer is prime or composite is a basic task in number theory. We present a primality test based on quantum order finding and the converse of Fermat's theorem. For an integer $N$, the test tries to find an…
We study the undirected divisibility graph in which the vertex set is a finite subset of consecutive natural numbers up to N.We derive analytical expressions for measures of the graph like degree, clustering, geodesic distance and…
An infinite family of Boolean polynomials which correspond to the discrete average maps, defined in [2], is constructed and their algebraic and combinatorial properties are investigated. They turn out to be balanced, and some recurrence…
A computable ring is a ring equipped with mechanical procedure to add and multiply elements. In most natural computable integral domains, there is a computational procedure to determine if a given element is prime/irreducible. However,…
The problem of iterated partial summations is solved for some discrete distributions defined on discrete supports. The power method, usually used as a computational approach to finding matrix eigenvalues and eigenvectors, is in some cases…
We consider primitive divisors of terms of integer sequences defined by quadratic polynomials. Apart from some small counterexamples, when a term has a primitive divisor, that primitive divisor is unique. It seems likely that the number of…
This paper investigates prime and co-prime integer matrices and their properties. It characterizes all pairwise co-prime integer matrices that are also prime integer matrices. This provides a simple way to construct families of pairwise…
Machines whose main purpose is to permute and sort data are studied. The sets of permutations that can arise are analysed by means of finite automata and avoided pattern techniques. Conditions are given for these sets being enumerated by…
We address the general mathematical problem of computing the inverse $p$-th root of a given matrix in an efficient way. A new method to construct iteration functions that allow calculating arbitrary $p$-th roots and their inverses of…
Iterated loop algebras are by definition obtained by repeatedly applying the loop construction, familiar from the theory of affine Kac-Moody Lie algebras, to a given base algebra. Our interest in this iterated construction is motivated by…
We study random independent and identically distributed iterations of functions from an iterated function system of homeomorphisms on the circle which is minimal. We show how such systems can be analyzed in terms of iterated function…
We define recurrence matrices and study a few properties (links with automatic sequences, branch groups etc.) of them.