Related papers: Divisibility tests and recurring decimals in Eucli…
We consider the continued fraction digits as random variables measured with respect to Lebesgue measure. The logarithmically scaled and normalized fluctuation process of the digit sums converges strongly distributional to a random variable…
We present a new proof of the classical divergence theorem in bounded domains. Our proof is based on a nonlocal analog of the divergence theorem and a rescaling argument. Main ingredients in the proof are nonlocal versions of the divergence…
The aim of this note is to provide a Master Theorem for some discrete divide and conquer recurrences: $$X_{n}=a_n+\sum_{j=1}^m b_j X_{\lfloor{\frac{n}{m_j}}\rfloor},$$ where the $m_i$'s are integers with $m_i\ge 2$. The main novelty of this…
We study the existence of primes and of primitive divisors in classical divisibility sequences defined over function fields. Under various hypotheses, we prove that Lucas sequences and elliptic divisibility sequences over function fields…
We investigate algebraic and arithmetic properties of a class of sequences of sparse polynomials that have binomial coefficients both as exponents and as coefficients. In addition to divisibility and irreducibility results we also consider…
E394 in the Enestrom index. Translated from the Latin original, "De partitione numerorum in partes tam numero quam specie datas" (1768). Euler finds a lot of recurrence formulas for the number of partitions of $N$ into $n$ parts from some…
In this paper we study the divisibility and primality properties of the Bernoulli random walk. We improve or extend some of our divisibility results to wide classes of iid or independent non iid random walks. We also obtain new primality…
We study the relationship between the frequency of a ternary digit in a number and the asymptotic mean value of the digits. The conditions for the existence of the asymptotic mean of digits in a ternary number are established. We indicate…
We prove an asymptotic formula for the number of integer points in a family of bounded domains in the Euclidean space with smooth boundary, which remain unchanged along some linear subspace and stretch out in the directions, orthogonal to…
This paper rigorously solves the challenging problem of recognizing periodic patterns under rigid motion in Euclidean geometry. The 3-dimensional case is practically important for justifying the novelty of solid crystalline materials…
We prove maximum and comparison principles for fractional discrete derivatives in the integers. Regularity results when the space is a mesh of length $h$, and approximation theorems to the continuous fractional derivatives are shown. When…
We investigate the problem of finding integers $k$ such that appending any number of copies of the base-ten digit $d$ to $k$ yields a composite number. In particular, we prove that there exist infinitely many integers coprime to all digits…
We present a quantum algorithm to transform the cardinality of a set of charged particles flowing along a quantum wire into a binary number. The setup performing this task (for at most N particles) involves log_2 N quantum bits serving as…
We consider integer recurrences of the form a_n = f(a_{n-1}), where f is a quadratic polynomial with integer coefficients. We show, for four infinite families of f, that the set of primes dividing at least one term of such a sequence must…
We investigate the divisibility properties of \sigma(C_n), the sum-of-divisors function applied to Catalan numbers, in relation to other number-theoretic functions. We establish conditions under which C_n has prime factors of the form 6k-1,…
We develop the theory of patterns on numerical semigroups in terms of the admissibility degree. We prove that the Arf pattern induces every strongly admissible pattern, and determine all patterns equivalent to the Arf pattern. We study…
We prove recursive formulas involving sums of divisors and sums of triangular numbers and give a variety of identities relating arithmetic functions to divisor functions providing inductive identities for such arithmetic functions.
Consider an algorithm computing in a differential field with several commuting derivations such that the only operations it performs with the elements of the field are arithmetic operations, differentiation, and zero testing. We show that,…
The purpose of this article is to delve into the properties of invariants. The properties, explained in [2], reveal new ways to develop algorithms that allow us to test the primality of a number. In this article, some of these are shown,…
In this paper, we explain how some basic facts about valuation can help clarify many questions about divisibility in integral domains.