English
Related papers

Related papers: Divisor Functions and the Number of Sum Systems

200 papers

In this paper, we prove several new infinite families of Ramanujan--like congruences satisfied by the coefficients of the generating function $U_t(a,q)$ which is an extension of MacMahon's generalized sum-of-divisors function. As a…

Number Theory · Mathematics 2025-04-03 James A. Sellers , Roberto Tauraso

In this paper we study the factors of some alternating sums of products of binomial and q-binomial coefficients. We prove that for all positive integers n_1,...,n_m, n_{m+1}=n_1, and 0\leq j\leq m-1, {n_1+n_{m}\brack…

Number Theory · Mathematics 2015-06-26 Victor J. W. Guo , Frederic Jouhet , Jiang Zeng

Let $\{u_{n}\}_{n \geq 0}$ be a non-degenerate binary recurrence sequence with positive discriminant. In this paper, we consider the Diophantine equation $u_m + u_n = a_1 n_1! + \cdots + a_k n_k!$ and prove that there are only finitely many…

Number Theory · Mathematics 2017-07-04 Sudhansu Sekhar Rout

We study the shifted convolution sum of the divisor function and some other arithmetic functions.

Number Theory · Mathematics 2015-02-24 Farzad Aryan

A method of estimating sums of multiplicative functions braided with Dirichlet characters is demonstrated, leading to a taxonomy of the characters for which such sums are large.

Number Theory · Mathematics 2012-08-02 P. D. T. A. Elliott , Jonathan Kish

Digital System Research has pioneered the mathematics and design for a new class of computing machine using residue numbers. Unlike prior art, the new breakthrough provides methods and apparatus for general purpose computation using several…

Other Computer Science · Computer Science 2015-12-04 Eric B. Olsen

This paper presents the concept of digit polynomials, which leads to a deterministic and unconditional integer factorization algorithm with the runtime complexity $\mathcal{O}(N^{1/4+\epsilon})$. Strassen's well known factoring approach is…

Number Theory · Mathematics 2015-12-22 Markus Hittmeir

This work introduces the notion of unoperation $\mathfrak{Un}(\hat{O})$ of some operation $\hat{O}$. Given a valid output of $\hat{O}$, the corresponding unoperation produces a set of all valid inputs to $\hat{O}$ that produce the given…

Quantum Physics · Physics 2025-10-10 Paul Kohl

For a positive integer $n$, if $\sigma(n)$ denotes the sum of the positive divisors of $n$, then $n$ is called a deficient perfect number if $\sigma(n)=2n-d$ for some positive divisor $d$ of $n$. In this paper, we prove some results about…

Number Theory · Mathematics 2019-06-25 Parama Dutta , Manjil P. Saikia

The double sum sum_(j=0)^m sum_(i=0)^j (-1)^(j-i) C(m,j) C(j,i) C(j+k+qi,j+k) with free nonnegative integer parameters k and q is rewritten as hypergeometric series. Efficient formulas to generate the C-finite ordinary generating functions…

General Mathematics · Mathematics 2023-06-16 Richard J. Mathar

A general solution is found for a large class of time continuous autonomous nonlinear dynamical systems, the so-called quasi-polynomial systems. This solution is expressed in terms of a new type of special functions defined via their Taylor…

Classical Analysis and ODEs · Mathematics 2009-10-15 Leon Brenig

Let $s_2$ be the sum-of-digits function in base $2$, which returns the number of non-zero binary digits of a nonnegative integer $n$. We study $s_2$ alon g arithmetic subsequences and show that --- up to a shift --- the set of $m$-tuples of…

Number Theory · Mathematics 2020-02-26 Lukas Spiegelhofer , Thomas Stoll

Let $s(n)$ denote the number of ones in the binary expansion of the nonnegative integer $n$. How does $s$ behave under addition of a constant $t$? In order to study the differences \[s(n+t)-s(n),\] for all $n\ge0$, we consider the…

Number Theory · Mathematics 2025-05-06 Bartosz Sobolewski , Lukas Spiegelhofer

It is known that, for given integers s \geq 0 and j > 0, the nested recursion R(n) = R(n - s - R(n - j)) + R(n - 2j - s - R(n - 3j)) has a closed form solution for which a combinatorial interpretation exists in terms of an infinite, labeled…

Combinatorics · Mathematics 2011-07-21 Rafal Drabek , Abraham Isgur , Vitaly Kuznetsov , Stephen Tanny

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…

Number Theory · Mathematics 2014-09-11 Joshua Cooper , Alexander Riasanovsky

Let $ x\geq 1 $ be a large number, let $ [x]=x-\{x\} $ be the largest integer function, and let $ \varphi(n)$ be the Euler totient function. The result $ \sum_{n\leq x}\varphi([x/n])=(6/\pi^2)x\log x+O\left ( x(\log x)^{2/3}(\log\log…

General Mathematics · Mathematics 2021-04-12 N. A. Carella

We study the ring of arithmetical functions with unitary convolution, giving an isomorphism to a generalized power series ring on infinitely many variables, similar to the isomorphism of Cashwell-Everett between the ring of arithmetical…

Commutative Algebra · Mathematics 2007-05-23 Jan Snellman

We consider the variance of sums of arithmetic functions over random short intervals in the function field setting. Based on the analogy between factorizations of random elements of $\mathbb{F}_q[T]$ into primes and the factorizations of…

Number Theory · Mathematics 2018-08-08 Brad Rodgers

We give a possible explanation for the mystery of a missing number in the statement of a problem that asks for the non-negative integers to be partitioned into three subsets. We interpret the missing number as one of the clues that can lead…

History and Overview · Mathematics 2017-08-04 Eunice Krinsky , Serban Raianu , Alexander Wittmond

This paper is concerned with the study of the fractional finite sums theory. We present the classes of functions for which it is possible to characterize the constant related to the derivative of fractional sums (denominated by essence of a…

Number Theory · Mathematics 2023-03-03 Leonardo F. Bielinski , Giuliano G. La Guardia , Jocemar Q. Chagas
‹ Prev 1 8 9 10 Next ›