相关论文: Dense Egyptian Fractions

In this paper, we use the transference principle to investigate the representation of sufficiently large positive integers as the sum of prime powers and integer powers, where the primes are drawn from a positive density subset of the set…

For a set of natural numbers $A$, let $R_{A}(n)$ be the number of representations of a natural number $n$ as the sum of two terms from $A$. Many years ago, Nathanson studied the conditions for the set $A$ and $B$ of natural numbers that are…

A reasonably complete theory of the approximation of an irrational by rational fractions whose numerators and denominators lie in prescribed arithmetic progressions is developed in this paper. Results are both, on the one hand, from a…

We estimate the number of solutions of certain diagonal congruences involving factorials. We use these results to bound exponential sums with products of two factorials $n!m!$ and also derive asymptotic formulas for the number of solutions…

Let $S$ be a rational fraction and let $f$ be a polynomial over a finite field. Consider the transform $T(f)=\operatorname{numerator}(f(S))$. In certain cases, the polynomials $f$, $T(f)$, $T(T(f))\dots$ are all irreducible. For instance,…

Analytical expressions are derived for the number of fractions with equal numerators in the Farey sequence of order $n$, $F_n$, and in the truncated Farey sequence $F_n^{1/k}$ containing all Farey fractions below $1/k$, with $1\leq k \leq…

The concept of nearest integer is used to derive theorems and algorithms for the best approximations of an irrational by rational numbers, which are improved with the pigeonhole principle and used to offer an informed presentation of the…

Diophantine approximation is the problem of approximating a real number by rational numbers. We propose a version of this in which the numerators are approximately related to the denominators by a Laurent polynomial. Our definition is…

For any finite reflection group $W$ on $\mathbb{R}^{N}$ and any irreducible $W$-module $V$ there is a space of polynomials on $\mathbb{R}^{N}$ with values in $V$. There are Dunkl operators parametrized by a multiplicity function, that is,…

Let A be a set of integers and let h \geq 2. For every integer n, let r_{A, h}(n) denote the number of representations of n in the form n=a_1+...+a_h, where a_1,...,a_h belong to the set A, and a_1\leq ... \leq a_h. The function r_{A,h}…

Let $\phi$ be a positive unital normal map of a von Neumann algebra $M$ into itself, and assume there is a family of normal $\phi$-invariant states which is faithful on the von Neumann algebra generated by the image of $\phi$. It is shown…

We consider the problem of classifying all positive-definite integer-valued quadratic forms that represent all positive odd integers. Kaplansky considered this problem for ternary forms, giving a list of 23 candidates, and proving that 19…

The multiplicative theory of a set of numbers (which could be natural, integer, rational, real or complex numbers) is the first-order theory of the structure of that set with (solely) the multiplication operation (that set is taken to be…

Zaremba's conjecture (1971) states that every positive integer number $d$ can be represented as a denominator (continuant) of a finite continued fraction $\frac{b}{d}=[d_1,d_2,...,d_{k}],$ with all partial quotients $d_1,d_2,...,d_{k}$…

Let $s(m,n)$ denote the classical \DED sum, where $n$ is a positive integer and $m\in\{0,1,\ldots, n-1\}$, $(m,n)=1$. For a given positive integer $k$, we describe a set of at most $k^2$ numbers $m$ for which $s(m,n)$ may be $\ge s(k,n)$,…

The arithmetic of natural numbers has a natural and simple encoding within sets, and the simplest set whose structure is not that of any natural number extends this set-theoretic representation to positive and negative integers. The…

We study approximation in the unit interval by rational numbers whose numerators are selected randomly with certain probabilities. Previous work showed that an analogue of Khintchine's Theorem holds in a similar random model and raised the…

In this note, we prove that for every two positive integers $m \geq n \geq 9$, there exist $n$ positive rational numbers whose product is 1 and sum is $m$.

Let $n,p,k$ be three positive integers. We prove that the rational fractions of $q$: $${n \brack k}_{q} {}_3\phi_{2} [ . {matrix}q^{1-k},q^{-p},q^{p-n} q,q^{1-n} {matrix}| q;q^{k+1}]\quad\textrm{and}\quad q^{(n-p)p}\qbi{n}{k}{q} {}_3\phi_2[…

Let $m\ge 2$ be a fixed positive integer. Suppose that $m^j \leq n< m^{j+1}$ is a positive integer for some $j\ge 0$. Denote $b_{m}(n)$ the number of $m$-ary partitions of $n$, where each part of the partition is a power of $m$. In this…