English
Related papers

Related papers: Beyond odious and evil

200 papers

Motivated by the convolutive behavior of the counting function for partitions with designated summands in which all parts are odd, we consider coefficient sequences $(a_n)_{n\ge 0}$ of primitive eta-products that satisfy the generic…

Combinatorics · Mathematics 2025-12-05 Shane Chern , Dennis Eichhorn , Shishuo Fu , James A. Sellers

We examine the convergence properties of sequences of nonnegative real numbers that satisfy a particular class of recursive inequalities, from the perspective of proof theory and computability theory. We first establish a number of results…

Logic · Mathematics 2023-05-02 Morenikeji Neri , Thomas Powell

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…

Number Theory · Mathematics 2012-04-10 Victor J. W. Guo , Jiang Zeng

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…

History and Overview · Mathematics 2007-05-23 Wai Yan Pong

By means of $q$-series, we prove that any natural number is a sum of an even square and two triangular numbers, and that each positive integer is a sum of a triangular number plus $x^2+y^2$ for some integers $x$ and $y$ with $x\not\equiv y…

Number Theory · Mathematics 2007-05-23 Zhi-Wei Sun

The paper considers estimates for some sums and products of functions of prime numbers. Several assertions on this topic have been proven. We also study extremal estimates for strongly additive and strongly multiplicative arithmetic…

General Mathematics · Mathematics 2023-01-19 Victor Volfson

The divisor function $\sigma(n)$ sums the divisors of $n$. We call $n$ abundant when $\sigma(n) - n > n$ and perfect when $\sigma(n) - n = n$. I recently introduced the recursive divisor function $a(n)$, the recursive analog of the divisor…

Number Theory · Mathematics 2020-08-25 Thomas Fink

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…

Number Theory · Mathematics 2016-03-17 Yan Kun , Li Hou Biao

We review some probabilistic properties of the sum-of-digits function of random integers. New asymptotic approximations to the total variation distance and its refinements are also derived. Four different approaches are used: a classical…

Probability · Mathematics 2014-10-14 Louis H. Y. Chen , Hsien-Kuei Hwang , Vytas Zacharovas

We evaluate some new three parameter families of finite reciprocal sums involving Horadam numbers. We will also be able to state the results for the infinite sums. Some Fibonacci and Lucas sums will be presented as examples.

Combinatorics · Mathematics 2021-06-29 Kunle Adegoke , Robert Frontczak , Taras Goy

We prove a refined version of Markov's theorem in Diophantine approximation. More precisely, we characterize completely the set of irrationals $x$ such that $\left|x-\frac{p}{q}\right|<\frac{1}{3q^2}$ has only finitely many rational…

Number Theory · Mathematics 2026-02-11 Zhe Cao , Harold Erazo , Carlos Gustavo Moreira

In this work we use the number classification in families of the form 6n+1, and 6n+5 with n integer (Such families contain all odd prime numbers greater than 3 and other compound numbers related with primes). We will use this kind of…

General Mathematics · Mathematics 2007-09-04 G. Funes , D. Gulich , L. Garvaglia , M. Garvaglia

We derive weighted summation identities involving the second order recurrence sequence $\{w_n\} =\{ w_n(a,b; p, q)\}$ defined by $w_0 = a,\,w_1 = b;\,w_n = pw_{n - 1} - qw_{n - 2}\, (n \ge 2)$, where $a$, $b$, $p$ and $q$ are arbitrary…

Number Theory · Mathematics 2018-04-13 Kunle Adegoke

Abramov's algorithm enables us to decide whether a univariate rational function can be written as a difference of another rational function, which has been a fundamental algorithm for rational summation. In 2014, Chen and Singer generalized…

Symbolic Computation · Computer Science 2017-06-29 Shaoshi Chen

Consider the representation of a rational number as a continued fraction, associated with "odd" Euclidean algorithm. In this paper we prove certain properties for the limit distribution function for sequences of rationals with bounded sum…

Number Theory · Mathematics 2011-10-25 Elena Zhabitskaya

We describe an inequality of finite or infinite sequences of real numbers and their quotients. More precisely, we compare the quotient of H\"older functionals of two sequences of numbers with the sum of their quotients. In the last section…

Classical Analysis and ODEs · Mathematics 2012-09-04 Volker W. Thürey

The number of tuples with positive integers pairwise relatively prime to each other with product at most $n$ is considered. A generalization of $\mu^{2}$ where $\mu$ is the M\"{o}bius function is used to formulate this divisor sum and…

General Mathematics · Mathematics 2021-08-24 Masum Billal

By means of the derivative operator and Chu-Vandermonde convolution, four families of summation formulas involving harmonic numbers with even or odd indexes are established.

Combinatorics · Mathematics 2018-06-27 Chuanan Wei , Dianxuan Gong , Lily Li Liu

The ternary Goldbach conjecture (or three-prime conjecture) states that every odd number greater than 5 can be written as the sum of three primes. The purpose of this book is to give the first proof of the conjecture, in full.

Number Theory · Mathematics 2015-01-29 Harald Andres Helfgott

Moments of secular and inverse secular coefficients, averaged over random matrices from classical groups, are related to the enumeration of non-negative matrices with prescribed row and column sums. Similar random matrix averages are…

Combinatorics · Mathematics 2007-05-23 Peter J. Forrester , Alex Gamburd