Related papers: On the Factorization of Two Adjacent Numbers in Mu…
Let $S$ be the numerical semigroup generated by three consecutive numbers $a,a+1,a+2$, where $a\in\mathbb{N}$, $a\geq 3$. We describe the elements of $S$ whose factorizations have all the same length, as well as the set of factorizations of…
In 1974, M. B. Nathanson proved that every irrational number $\alpha$ represented by a simple continued fraction with infinitely many elements greater than or equal to $k$ is approximable by an infinite number of rational numbers $p/q$…
Although in general there is no meaningful concept of factorization in fields, that in free associative algebras (over a commutative field) can be extended to their respective free field (universal field of fractions) on the level of…
For any prime number p and any positive real number {\alpha}, we construct a finitely generated group {\Gamma} with p-gradient equal to {\alpha}. This construction is used to show that there exist uncountably many pairwise non-commensurable…
New and old results on closed polynomials, i.e., such polynomials f in K[x_1,...,x_n] that the subalgebra K[f] is integrally closed in K[x_1,...,x_n], are collected. Using some properties of closed polynomials we prove the following…
Let $[\, \cdot\,]$ be the floor function and $\|x\|$ denote the distance from $x$ to the nearest integer. In this paper we show that whenever $\alpha$ is irrational and $\beta$ is real then for any fixed $\frac{13}{14}<\gamma<1$, there…
Two factorizations of a permutation into products of cycles are equivalent if one can be obtained from the other by repeatedly interchanging adjacent disjoint factors. This paper studies the enumeration of equivalence classes under this…
We introduce and consider a certain probability question involving elementary number theory and the likelihood that a fixed prime will appear in a certain recursively defined factorization of an integer. We derive several convergent…
We introduce the notion of quantum duplicates of an (associative, unital) algebra, motivated by the problem of constructing toy-models for quantizations of certain configuration spaces in quantum mechanics. The proposed (algebraic) model…
We show that for any irrational $\alpha$ and any $\tau<8/23$ there are infinitely many $n$ which are the product of two primes for which $$\|n\alpha\|\leq n^{-\tau}.$$ We also show that for all sufficiently large $b$ there exist 3-digit…
The goal of this note is to provide an alternative proof of Theorem 1.1 (i) in [4], that is, if $n\geq 2$ and $M^{\alpha}$ is bounded on $L^{p}(\mathbb{R}^{n})$ for some $\alpha\in \mathbb{C}$ and $p\geq 2$, then we have \begin{align*}…
We apply the Inclusion-Exclusion Principle to a unique pair of prime number subsequences to determine whether these subsequences form a small set or a large set and thus whether the infinite sum of the inverse of their terms converges or…
Let $\alpha=0.a_1a_2a_3\ldots$ be an irrational number in base $b>1$, where $0\leq a_i<b$. The number $\alpha \in (0,1)$ is a \textit{normal number} if every block $(a_{n+1}a_{n+2}\ldots a_{n+k})$ of $k$ digits occurs with probability…
For a two parameter family of Bernoulli numbers $B_{n, p}$ the exponential generating function is derived by elementary methods.
Factorization of numbers with the help of Gauss sums relies on an intimate relationship between the maxima of these functions and the factors. Indeed, when we restrict ourselves to integer arguments of the Gauss sum we profit from a…
We generalize Dirichlet's diophantine approximation theorem to approximating any real number $\alpha$ by a sum of two rational numbers $\frac{a_1}{q_1} + \frac{a_2}{q_2}$ with denominators $1 \leq q_1, q_2 \leq N$. This turns out to be…
We give partial results on the factorization conjecture on codes proposed by Schutzenberger. We consider finite maximal codes C over the alphabet A = {a, b} with C \cap a^* = a^p, for a prime number p. Let P, S in Z <A>, with S = S_0 + S_1,…
A group $G$ is said to be $k$-generated if it has a generating set with $k$ elements. A positive integer $n$ is called a \emph{2-generated number} if every group of order $n$ is 2-generated. In this article, we establish an arithmetic…
A graph $G$ is defined encapsulating the number theoretic notion of the Fundamental Theorem of Arithmetic. We then provide a graph theoretic approach to the fundamental results on the coprimality of two natural numbers, through the use of…
We give an elementary geometric proof using Ford circles that the convergents of the continued fraction expansion of a real number $\alpha$ coincide with the rationals that are best approximations of the second kind of $\alpha$.