Related papers: On Integers Whose Sum is the Reverse of their Prod…
In this short paper, I introduce an elementary method for exactly evaluating the definite integrals $\, \int_0^{\pi}{\ln{(\sin{\theta})}\,d\theta}$, $\int_0^{\pi/2}{\ln{(\sin{\theta})}\,d\theta}$,…
Fermat's statement is equivalent to say that if $x$, $y$, $z$, $n$ are integers and $n>2$, then $z^{n}\gtrless x^{n}+y^{n}$. This is proved with the aid of numbers $\lambda $'s, of the form $\lambda =z/\rho $, with $1<\rho<z$, named…
We discuss the problem of finding distinct integer sets $\{x_1,x_2,...,x_n\}$ where each sum $x_i+x_j, i \ne j$ is a square, and $n \le 7$. We confirm minimal results of Lagrange and Nicolas for $n=5$ and for the related problem with…
It is conjectured that for any fixed relatively prime positive integers $a,b$ and $c$ all greater than 1 there is at most one solution to the equation $a^x+b^y=c^z$ in positive integers $x,y$ and $z$, except for specific cases. We develop…
For two coprime positive integers $a,b$, let $T(a,b)=\{ ax+by : x,y\in \mathbb{Z}_{\ge 0} \} $ and let $s(a,b)=ab-a-b$. It is well known that all integers which are greater than $s(a,b)$ are in $T(a,b)$. Let $\pi (a, b)$ be the number of…
Permutations can be represented as linear combinations of natural numbers with different powers. In this paper, its coefficient matrix and inverse matrix is derived, and the results show the coefficient matrix is a lower triangular matrix…
A new general and unified method of summation, which is both regular and consistent, is invented. It is based on the idea concerning a way of integers reordering. The resulting theory includes a number of explicit and closed form summation…
Besides various asymptotic results on the concept of sum-product bases in $\mathbb{N}_0$, we consider by probabilistic arguments the existence of thin sets $A,A'$ of integers such that $AA+A=\mathbb{N}_0$ and $A'A'+A'A'=\mathbb{N}_0$.
Based on the Goldbach conjecture and arithmetic fundamental theorem, the Goldbach conjecture was extended to more general situations, i.e., any positive integer can be written as summation of some specific prime numbers, which depends on…
Given a base $b$, a "digit map" is a map $f: \mathbb{Z}^{\ge 0} \to \mathbb{Z}^{\ge 0}$ of the form $f(\sum_{i=0}^n a_ib^i) = \sum_{i=0}^n f_*(a_i)$, $0 \le a_i \le b-1$ for each $i$, where $f_* : \{0,1,\dots, b-1\} \to \mathbb{Z}^{\ge 0}$…
Let $A$ be a set of positive integers. We define a positive integer $n$ as an $A$-practical number if every positive integer from the set $\left\{1,\ldots ,\sum_{d\in A, d\mid n}d\right\}$ can be written as a sum of distinct divisors of $n$…
For integer $k \geq 0$, let $S_k$ denote the sum of the $k$th powers of the first $n$ positive integers $1^k + 2^k + \cdots + n^k$. For any given $k$, the power sum $S_k$ can in principle be determined by differentiating $k$ times (with…
An identity is proved connecting two finite sums of inverse tangents. This identity is discretized version of Jacobi's imaginary transformation for the modular angle from the theory of elliptic functions. Some other related identities are…
The subject matter of this work is the set of integral points(i.e. points with both coordinates integers) on the graphs of rational functions of the form f(x)=(x^2+bx+c)/(x+a), with a,b,c,being integers.Following the introduction, we…
We investigate the distribution of the digits of quotients of randomly chosen positive integers taken from the interval $[1,T]$, improving the previously known error term for the counting function as $T\to+\infty$. We also resolve some…
A commutative semigroup of abstract factorials is defined in the context of the ring of integers. We study such factorials for their own sake, whether they are or are not connected to sets of integers. Given a subset X of the positive…
In the 3SUM-Indexing problem the goal is to preprocess two lists of elements from $U$, $A=(a_1,a_2,\ldots,a_n)$ and $B=(b_1,b_2,...,b_n)$, such that given an element $c\in U$ one can quickly determine whether there exists a pair $(a,b)\in A…
We estimate Weyl sums over the integers with sum of binary digits either fixed or restricted by some congruence condition. In our proofs we use ideas that go back to a paper by Banks, Conflitti and the first author (2002). Moreover, we…
Abstract numeration systems encode natural numbers using radix ordered words of an infinite regular language and linear recurrence sequences play a key role in their valuation. Sequence automata, which are deterministic finite automata with…
We evaluate in closed form series of the type $\sum u(n) R(n)$, where $(u(n))_n$ is a strongly $B$-multiplicative sequence and $R(n)$ a (well-chosen) rational function. A typical example is: $$ \sum_{n \geq 1} (-1)^{s_2(n)}…