相关论文: On Integers Whose Sum is the Reverse of their Prod…

Recently, Ko\c{c} proposed a neat and efficient algorithm for computing \[ x = a^{-1} \pmod {p^k} \] for a prime $p$ based on the exact solution of linear equations using $p$-adic expansions. The algorithm requires only addition and right…

We show that for any set $D$ of at least two digits in a given base $b$, there exists a $\delta(D,b)>0$ such that within the set $\mathcal{A}$ of numbers whose digits base $b$ are exclusively from $D$, the number of even integers in…

Revisiting a $50$-year-old estimate of Choi, Erd\H{o}s and Szemer\'edi, we show that if $A \subseteq \{1, 2, \ldots, 2n\}$ satisfies $|A| \ge n + 1.2 \cdot 10^8$, then there exist five distinct integers whose pairwise sums are all contained…

We study divisibility properties of certain sums and alternating sums involving binomial coefficients and powers of integers. For example, we prove that for all positive integers $n_1,..., n_m$, $n_{m+1}=n_1$, and any nonnegative integer…

If \(A \) is a set of natural numbers containing \(0 \), then there is a unique nonempty "reciprocal" set \(B \) of natural numbers (containing \(0 \)) such that every positive integer can be written in the form \(a + b \), where \(a \in A…

A decomposition of a natural number n is a sequence of consecutive natural numbers that sums to n. We construct a one-to-one correspondence between the odd factors of a natural number and its decompositions. We study the decompositions by…

Deterministic one-way time-bounded multi-counter automata are studied with respect to their ability to perform reversible computations, which means that the automata are also backward deterministic and, thus, are able to uniquely step the…

Let b $\ge$ 2 be an integer and let s b (n) denote the sum of the digits of the representation of an integer n in base b. For sufficiently large N , one has Card{n $\le$ N : |s 3 (n) -- s 2 (n)| $\le$ 0.1457205 log n} \textgreater{} N…

Let $d_1 = 1 < d_2 < d_3 < \cdots < d_{\tau(n)} = n$ denote the increasing sequence of the divisors of a positive integer $n$. In this paper, for real or complex values of $\alpha$, we define and study some properties of two new divisor…

Algorithmic methods for the explicit inversion of the indefinite double covering maps are proposed. These are based on either the Givens decomposition or the polar decomposition of the given matrix in the proper, indefinite orthogonal group…

We show that if $A$ and $B$ are finite sets of real numbers, then the number of triples $(a,b,c)\in A\times B\times (A\cup B)$ with $a+b=2c$ is at most $(0.15+o(1))(|A|+|B|)^2$ as $|A|+|B|\to\infty$. As a corollary, if $A$ is antisymmetric…

In the context of the Frobenius coin problem, given two relatively prime positive integers $a$ and $b$, the set of nonrepresentable numbers consists of positive integers that cannot be expressed as nonnegative integer combination of $a$ and…

Let $\mathcal{R}$ denote the set of integers $n$ that can be represented as the sum $n = x^2 + y^2$ with $(x,y) = 1$. Let $a$ and $b$ be integers with $a>0$, $a \nmid b$. We show that for sufficiently large positive integer $N$ there are…

We present and analyze an algorithm to enumerate all integers $n\le x$ that can be written as the sum of consecutive $k$th powers of primes, for $k>1$. We show that the number of such integers $n$ is asymptotically bounded by a constant…

We show how the generalized Lambert series sum(n>=1, x*q^n/(1-x*q^n)) can be computed with Theta convergence. This allows the computation of the sum of the inverse Fibonacci numbers without splitting the sum into even and odd part. The…

We prove that the ratio of the Newman sum over numbers multiple of a fixed integer which is not multiple of 3 and the Newman sum over numbers multiple of a fixed integer divisible by 3 is o(1) when the upper limit of summing tends to…

We sometimes need to compute the most significant digits of the product of small integers with a multiplier requiring much storage: e.g., a large integer (e.g., $5^{100}$) or an irrational number ($\pi$). We only need to access the most…

A route to evaluate exact sums represented by Dirichlet eta and beta functions, both of which are alternating and divergent at negative integer arguments, is advocated. It rests on precise polynomial extrapolations and stands as a…

A tableau inversion is a pair of entries from the same column of a row-standard tableau that lack the relative ordering necessary to make the tableau column-standard. An $i$-inverted Young tableau is a row-standard tableau with precisely…

We study the Reverse algorithm, a multidimensional continued fraction algorithm, which is not unimodular. We show that the Reverse algorithm is ergodic and, by proving that its second Lyapunov exponent is negative, that it is a.e.…