English
Related papers

Related papers: Generalizing the Abundancy of an Integer

200 papers

By the theory of elliptic curves, we study the integers representable as the product of the sum of four integers with the sum of their reciprocals and give a sufficient condition for the integers with a positive representation.

Number Theory · Mathematics 2016-08-12 Yong Zhang

Given a polynomial $f(x_1,x_2,\ldots, x_t)$ in $t$ variables with integer coefficients and a positive integer $n$, let $\alpha(n)$ be the number of integers $0\leq a<n$ such that the polynomial congruence $f(x_1, x_2, \ldots, x_t)\equiv a\…

Number Theory · Mathematics 2019-01-25 Fabián Arias , Jerson Borja , Luis Rubio

We establish an explicit inequality for the number of divisors of an integer $n$. It uses the size of $n$ and its number of distinct prime divisors.

Number Theory · Mathematics 2020-11-24 Patrick Letendre

The set of indices that correspond to the positive entries of a sequence of numbers is called its positivity set. In this paper, we study the density of the positivity set of a given linear recurrence sequence, that is the question of how…

Number Theory · Mathematics 2024-04-17 Edon Kelmendi

By polynomial (or extended binomial) coefficients, we mean the coefficients in the expansion of integral powers, positive and negative, of the polynomial $1+t +\cdots +t^{m}$; $m\geq 1$ being a fixed integer. We will establish several…

Number Theory · Mathematics 2016-07-26 Nour-Eddine Fahssi

A positive integer $n$ is said to be a Zumkeller number or an integer-perfect number if the set of its positive divisors can be partitioned into two subsets of equal sums. In this paper, we prove several results regarding Zumkeller numbers.…

Number Theory · Mathematics 2023-11-28 Sai Teja Somu , Andrzej Kukla , Duc Van Khanh Tran

We derive simple linear, inhomogeneous recurrences for the variance of the index by utilising the fact that the generating function for the distribution of the number of positive eigenvalues of a Gaussian unitary ensemble is a…

Classical Analysis and ODEs · Mathematics 2011-10-06 N. S. Witte , P. J. Forrester

It is known that for an arbitrary positive integer \(n\) the sequence \(S(x^n)=(1^n, 2^n, \ldots)\) is complete, meaning that every sufficiently large integer is a sum of distinct \(n\)th powers of positive integers. We prove that every…

Number Theory · Mathematics 2017-07-11 Doyon Kim

Starting from a small number of well-motivated axioms, we derive a unique definition of sums with a noninteger number of addends. These "fractional sums" have properties that generalize well-known classical sum identities in a natural way.…

Classical Analysis and ODEs · Mathematics 2011-03-03 Markus Mueller , Dierk Schleicher

A goodness-of-fit index measures the consistency of consumption data with a given model of utility-maximization. We show that for the class of well-behaved (i.e., continuous and increasing) utility functions there is no goodness-of-fit…

Theoretical Economics · Economics 2026-02-13 Yujian Chen , Joshua Lanier , John K. -H. Quah

For a cubic algebraic extension $K$ of $\mathbb{Q}$, the behavior of the ideal counting function is considered in this paper. Let $a_{K}(n)$ be the number of integral ideals of the field $K$ with norm $n$. An asymptotic formula is given for…

Number Theory · Mathematics 2015-03-05 Zhishan Yang

Using an extension of the abundancy index to imaginary quadratic rings that are unique factorization domains, we investigate what we call $n$-powerfully $t$-perfect numbers in these rings. This definition serves to extend the concept of…

Number Theory · Mathematics 2015-06-18 Colin Defant

Using sequences of finite length with positive integer elements and the inversion statistic on such sequences, a collection of binomial and multinomial identities are extended to their $q$-analog form via combinatorial proofs. Using the…

Combinatorics · Mathematics 2020-05-18 Adrian Avalos , Mark Bly

We consider a bivariate polynomial that generalizes both the length and reflection length generating functions in a finite Coxeter group. In seeking a combinatorial description of the coefficients, we are led to the study of a new Mahonian…

Combinatorics · Mathematics 2010-10-25 T. Kyle Petersen

We extend a result by Ikeda and Suriajaya (2025) to find the asymptotic behaviour of the average number of representations of an integer $n$, over multiples of a fixed $q\ge 2$, as a sum of two prime $k$-th powers, for $k\ge 2$.

Number Theory · Mathematics 2026-03-26 Alessandra Migliaccio , Alessandro Zaccagnini

Consider the number of integers in a short interval that can be represented as a sum of two squares. What is an estimate for the variance of these counts over random short intervals? We resolve a function field variant of this problem in…

Number Theory · Mathematics 2024-10-15 Ofir Gorodetsky , Brad Rodgers

Let $\mathcal{A}=\{a_{n}\}_{n=1}^{\infty}$ and $\mathcal{B}=\{b_{n}\}_{n=1}^{\infty}$ be two sequences of positive integers (not necessarily distinct). Under some restrictions on $\mathcal{A}$ and $\mathcal{B}$, we obtain a lower bound for…

Number Theory · Mathematics 2026-01-22 Artyom Radomskii

A classical theorem in number theory due to Euler states that a positive integer $z$ can be written as the sum of two squares if and only if all prime factors $q$ of $z$, with $q\equiv 3 \pmod{4}$, have even exponent in the prime…

Number Theory · Mathematics 2014-04-02 Joshua Harrington , Lenny Jones , Alicia Lamarche

The divisor function $\sigma(n)$ denotes the sum of the divisors of the positive integer $n$. For a prime $p$ and $m \in \mathbb{N}$, the $p$-adic valuation of $m$ is the highest power of $p$ which divides $m$. Formulas for…

Number Theory · Mathematics 2020-07-08 Tewodros Amdeberhan , Victor H. Moll , Vaishavi Sharma , Diego Villamizar

In this note, we give an alternative proof of the following result. Let p, q >= 2 be two multiplicatively independent integers. If an infinite set of integers is both p- and q-recognizable, then it is syndetic. Notice that this result is…

Formal Languages and Automata Theory · Computer Science 2009-07-06 M. Rigo , L. Waxweiler