English
Related papers

Related papers: Arithmetic-term representations for the greatest c…

200 papers

Let $N$ be a positive number. We give an asymptotic formula for the sum of $\tau(\gcd(a,b))$ for all $a$ and $b$ with $ab \le N$.

Number Theory · Mathematics 2020-12-14 Randell Heyman

Following work of Bugeaud, Corvaja, and Zannier for integers, Ailon and Rudnick prove that for any multiplicatively independent polynomials, $a, b \in {\mathbb C}[x]$, there is a polynomial $h$ such that for all $n$, we have \[ \gcd(a^n -…

Number Theory · Mathematics 2016-11-15 Liang-Chung Hsia , Thomas J. Tucker

We describe the explicit form of a left greatest common divisor and a least common multiple of solutions of a solvable linear matrix equation over a commutative elementary divisor domain. We prove that these left greatest common divisor and…

General Mathematics · Mathematics 2020-11-11 Volodymyr P. Shchedryk

We prove a result on the distribution of the general divisor functions in arithmetic progressions to smooth moduli which exceed the square root of the length.

Number Theory · Mathematics 2016-08-24 Fei Wei , Boqing Xue , Yitang Zhang

We give a method of representing the modular invariant function by generators of a modular function field.

Number Theory · Mathematics 2007-05-23 Noburo Ishii

We prove a new equidistribution estimate for the divisor function in arithmetic progression to moduli that have two small factors. We give two applications. First, we show an asymptotic formula for the divisor function over arithmetic…

Number Theory · Mathematics 2025-09-05 Lasse Grimmelt , Jori Merikoski

A representation of divisor function $\tau(n)\equiv \sigma_{0}(n)$ by means of logarithmic residue of a function of complex variable is suggested. This representation may be useful theoretical instrument for further investigations of…

Number Theory · Mathematics 2011-09-19 E. E. Kholupenko

We design polynomial size, constant depth (namely, $\mathsf{AC}^0$) arithmetic formulae for the greatest common divisor (GCD) of two polynomials, as well as the related problems of the discriminant, resultant, B\'ezout coefficients,…

Computational Complexity · Computer Science 2026-01-27 Robert Andrews , Avi Wigderson

We propose a new algorithm solving the extended gcd problem, which provides a solution minimizing one of the two coordinates. The algorithm relies on elementary arithmetic properties.

Data Structures and Algorithms · Computer Science 2018-09-24 Marc Wolf , François Wolf , Corentin Le Coz

While studying a characteristic number of manifolds we noticed that the calculation was simply computing a multiple of a multinomial coefficient. We were, at the time, interested in computing the greatest common divisor of these…

Number Theory · Mathematics 2015-11-04 John E. Mosley

The classical Dedekind sums $s(d, c)$ can be represented as sums over the partial quotients of the continued fraction expansion of the rational $\frac{d}{c}$. Hardy sums, the analog integer-valued sums arising in the transformation of the…

Number Theory · Mathematics 2022-03-21 Alessandro Lägeler

A general explicit form for generating functions for approximating fractional derivatives is derived. To achieve this, an equivalent characterisation for consistency and order of approximations established on a general generating function…

Numerical Analysis · Mathematics 2021-05-31 W. A. Gunarathna , H. M. Nasir , W. B. Daundasekera

We consider the problem of the representation of real continuous functions by linear superpositions $\sum_{i=1}^{k}g_{i}\circ p_{i}$ with continuous $g_{i}$ and $p_{i}$. This problem was considered by many authors. But complete, and at the…

Functional Analysis · Mathematics 2015-01-22 Vugar Ismailov

One may consider the generalization of Jacobi polynomials and the Jacobi function of the second kind to a general function where the index is allowed to be a complex number instead of a non-negative integer. These functions are referred to…

Classical Analysis and ODEs · Mathematics 2023-08-29 Howard S. Cohl , Roberto S. Costas-Santos

A GGC (Generalized Gamma Convolution) representation of Riemann's Xi-function is constructed.

General Mathematics · Mathematics 2018-10-16 Nicholas G. Polson

The 2-adic valuation of an integer n which is the exponent of the highest power of 2 that divides n. In this paper, we give representations of certain restricted partition functions in terms of 2-adic valuation.

Number Theory · Mathematics 2024-10-29 Sabi Biswas , Nipen Saikia

In this paper we establish a new formula for the arithmetic functions that verify $ f(n) = \sum_{d|n} g(d)$ where $g$ is also an arithmetic function. We prove the following identity, $$\forall n \in \mathbb{N}^*, \ \ \ f(n) = \sum_{k=1}^n…

General Mathematics · Mathematics 2020-09-15 Jason Akoun

We consider a class of generalized binomials emerging in fractional calculus. After establishing some general properties, we focus on a particular yet relevant case, for which we provide several ready-for-use combinatorial identities,…

Combinatorics · Mathematics 2020-10-13 Mirko D'Ovidio , Anna Chiara Lai , Paola Loreti

In this note we prove the following fact: if finite many elements $p_1,p_2,...,p_n$ of a unique factorization domain are given such that the greatest common divisor of each pair $(p_i,p_j)$ can be expressed as a linear combination of $p_i$…

Commutative Algebra · Mathematics 2012-07-02 Géza Kós

We prove inequalities on non-integer powers of products of generalized matrices functions on the sum of positive semi-definite matrices. For example, for any real number $r \in \{1\} \cup [2, \infty)$, positive semi-definite matrices $A_i,\…

Functional Analysis · Mathematics 2016-09-01 Shaowu Huang , Chi-Kwong Li , Yiu-Tung Poon , Qing-Wen Wang