Related papers: Integer Powers Expressed as Nested Sums of Lower P…
We prove some polynomial identities from which we deduce congruences modulo $p^2$ for the Fermat quotient $\frac{2^p-2}{p}$ for any odd prime $p$ (Proposition 1 and Theorem 1). These congruences are simpler than the one obtained by…
Utilizing spectral residues of parameterized, recursively defined sequences, we develop a general method for generating identities of composition sums. Specific results are obtained by focusing on coefficient sequences of solutions of first…
One is expressed as the sum of the reciprocals of a certain set of integers. We give an elegant proof to the fact applying the polynomial theorem and basic calculus.
Let $p$ be a prime and $n\geq 2$ be a positive integer. We establish new formulae for the decompositions of the first $p-1$ symmetric powers of the Specht module $S^{(n-1,1)}$ and the irreducible module $D^{(n-1,1)}$ in characteristic $p$…
We prove some cases of a conjecture by Farhi on the representation of every positive integer as the sum of three terms of the sequence $ \left\lfloor\frac{n^2}{a}\right\rfloor$. This is done by generalizing a method used by Farhi in his…
This paper gives new explicit formulas for sums of powers of integers and their reciprocals.
The problem of finding formulas for sums of powers of natural numbers has been of interest to mathematicians for many centuries. Among these is Faulhaber's well-known formula expressing the power sums as polynomials whose coefficients…
We consider representing of natural numbers by expressions using 1's, addition, multiplication and parentheses. $\left\| n \right\|$ denotes the minimum number of 1's in the expressions representing $n$. The logarithmic complexity $\left\|…
Let $k$ be a natural number and let $c=2.134693\ldots$ be the unique real solution of the equation $2c=2+\log (5c-1)$ in $[1,\infty)$. Then, when $s\ge ck+4$, we establish an asymptotic lower bound of the expected order of magnitude for the…
We identify a partition-theoretic generalization of Riemann zeta function and the equally positive integer-indexed harmonic sums at infinity, to obtain the generating function and the integral representations of the latter. The special…
Let $a > 1$. Then $a^n < n!$ for some positive integer $n$. There are several numerical sequences associated with the study of the smallest such integer which are studied in \cite{RadFact} and \cite{RadGamma}. Here we continue the…
We use recurrence equations (alias difference equations) to enumerate the number of formula-representations of positive integers using only addition and multiplication, and using addition, multiplication, and exponentiation, where all the…
In this paper we derive new identities satisfied by Chebyshev polynomials of the first kind and big q-Jacobi polynomials. An immediate benefit of the derived identities is the achievement of closed-form expressions for the Laurent…
Aggregated second-order features extracted from deep convolutional networks have been shown to be effective for texture generation, fine-grained recognition, material classification, and scene understanding. In this paper, we study a class…
We survey the potential for progress in additive number theory arising from recent advances concerning major arc bounds associated with mean value estimates for smooth Weyl sums. We focus attention on the problem of representing large…
We prove that every positive integer $n$ which is not equal to $1$, $2$, $3$, $6$, $11$, $30$, $155$, or $247$ can be represented as a sum of a squarefree number and a prime not exceeding $\sqrt{n}$.
It is well known that every positive integer N can be written as the sum of non-consecutive powers of the golden ratio. We prove that the non-positive powers, together with the parity of the first positive power, can determine the positive…
The main result of this paper is to show that all binomial identities are orderable. This is a natural statement in the combinatorial theory of finite sets, which can also be applied in distributed computing to derive new strong bounds on…
We propose to store several integers modulo a small prime into a single machine word. Modular addition is performed by addition and possibly subtraction of a word containing several times the modulo. Modular Multiplication is not directly…
A double-base representation of an integer n is an expression n = n_1 + ... + n_r, where the n_i are (positive or negative) integers that are divisible by no primes other than 2 or 3; the length of the representation is the number r of…