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

For a set $A$, let $P(A)$ be the set of all finite subset sums of $A$. We prove that if a sequence $B=\{11\leq b_1<b_2<\cdots\}$ satisfies $b_2=3b_1+5$, $b_3=3b_2+2$ and $b_{n+1}=3b_n+4b_{n-1}$ for all $n\geq 3$, then there is a sequence of…

A variation on the sum-product problem seeks to show that a set which is defined by additive and multiplicative operations will always be large. In this paper, we prove new results of this type. In particular, we show that for any finite…

Let $k \geq 2$ and $b \geq 3$ be integers, and suppose that $d_1, d_2 \in \{0,1,\dots, b - 1\}$ are distinct and coprime. Let $\mathcal{S}$ be the set of non-negative integers, all of whose digits in base $b$ are either $d_1$ or $d_2$. Then…

When $A$ and $B$ are subsets of the integers in $[1,X]$ and $[1,Y]$ respectively, with $|A| \geq \alpha X$ and $|B| \geq \beta X$, we show that the number of rational numbers expressible as $a/b$ with $(a,b)$ in $A \times B$ is $\gg (\alpha…

Recently, Cilleruelo, Luca, & Baxter proved, for all bases b >= 5, that every natural number is the sum of at most 3 natural numbers whose base-b representation is a palindrome. However, the cases b = 2, 3, 4 were left unresolved. We prove,…

We introduce a new arc in directed graphs of integers. Among other things, we determine the positive integers that have arcs to all except a finite number of positive integers. We also propose some possible research problems at the end of…

In this paper, we consider representations of integers as sums of generalized heptagonal numbers with a prescribed number of repeats of each heptagonal number appearing in the sum. In particular, we investigate the classification of such…

The inverse problem associated to the Erd\H{o}s-Ginzburg-Ziv constant and the $\eta$-constant is solved for finite abelian groups of the form $C_2 \oplus C_2 \oplus C_{2n}$ where $n \ge 2$ is an integer.

Following Stolarsky, we say that a natural number n is flimsy in base b if some positive multiple of n has smaller digit sum in base b than n does; otherwise it is sturdy. We develop algorithmic methods for the study of sturdy and flimsy…

The starting point of this work is an equality between two quantities $A$ and $B$ found in the literature, which involve the {\em doubling-modulo-an-odd-integer} map, i.e., $x\in {\mathbb N} \mapsto 2x \bmod{(2n+1)}$ for some positive…

There is a growing literature on sums of reciprocals of polynomial functions of recurrence relations with constant coefficients and fixed depth, such as Fibonacci and Tribonacci numbers, products of such numbers, and balancing numbers…

We consider finite iterated generalized harmonic sums weighted by the binomial $\binom{2k}{k}$ in numerators and denominators. A large class of these functions emerges in the calculation of massive Feynman diagrams with local operator…

Several widely-used textbooks lead the reader to believe that solving a linear system of equations Ax = b by multiplying the vector b by a computed inverse inv(A) is inaccurate. Virtually all other textbooks on numerical analysis and…

It is proven that the only integer solutions $(a,b)$ such that $a+b$ and $ab$ are palindromic are $(2,5\cdot 10^k-3)$, $(3,24)$ and $(9,9)$, and in a similar fashion, $b-a$ and $ab$ are only palindromic at $(a,b)=(3,147\cdot…

We give an algorithm that produces all solutions of the equation $\sum_{i=1}^n 1/x_i = 1$ in integers of the form $2^a k^b$, where $k$ is a fixed positive integer that is not a power of $2$, $a$ is an element of $\{0,1,2\}$ that can vary…

Let $n$ be a non-negative integer and put $p_{n}(x)=\prod_{i=0}^{n}(x+i)$. In the first part of the paper, for given $n$, we study the existence of integer solutions of the Diophantine equation $$ y^m=p_{n}(x)+\sum_{i=1}^{k}p_{a_{i}}(x), $$…

We study the Drazin inverses of the sum and product of two elements in a ring. For Drazin invertible elements $a$ and $b$ such that $a^2b=aba$ and $b^2a=bab$, it is shown that $ab$ is Drazin invertible and that $a+b$ is Drazin invertible if…

This article considers the numerical inversion of the power series $p(x)=1+b_{1}x+b_{2}x^{2}+\cdots$ to compute the inverse series $q(x)$ satisfying $p(x)q(x)=1$. Numerical inversion is a special case of triangular back-substitution, which…

We establish that every set of $k=10$ natural numbers determines at least $30$ distinct pairwise sums or at least $30$ distinct pairwise products, as well as the analogous result for $k=11$ and at least $34$ sums/products, with sharpness…

We evaluate the convolution sum $\displaystyle W_{a,b}(n):= \sum_{al+bm=n} \hspace{-3mm} \sigma(l) \sigma(m)$ for $(a,b)=(1,28), (4,7), (2,7)$ for all positive integers $n$. We use a modular form approach. We also re-evaluate the known sums…