English
Related papers

Related papers: Note on Fractional Sums with Fixed GCD

200 papers

Let $d_1 = 1 < d_2 < d_3 < \cdots < d_{\tau(n)} = n$ denote the increasing sequence of the divisors of a positive integer $n$. In this paper, for real or complex values of $\alpha$, we define and study some properties of two new divisor…

General Mathematics · Mathematics 2025-09-16 Brahim Mittou

We estimate exponential sums with the Fermat-like quotients $$ f_g(n) = \frac{g^{n-1} - 1}{n} \mand h_g(n)=\frac{g^{n-1}-1}{P(n)}, $$ where $g$ and $n$ are positive integers, $n$ is composite, and P(n) is the largest prime factor of $n$.…

Number Theory · Mathematics 2007-05-23 William D. Banks , Moubariz Z. Garaev , Florian Luca , Igor E. Shparlinski

We conjecture new elementary formulas for computing the greatest common divisor (GCD) of two integers, alongside an elementary formula for extracting the prime factors of semiprimes. These formulas are of fixed-length and require only the…

General Mathematics · Mathematics 2024-11-08 Joseph M. Shunia

We present a class of multiplicative functions $f:\mathbb{N}\to\mathbb{C}$ with bounded partial sums. The novelty here is that our functions do not need to have modulus bounded by $1$. The key feature is that they pretend to be the constant…

Number Theory · Mathematics 2022-07-11 Marco Aymone

A function $f:[n_1]\times\dots\times[n_d]\to\mathbb{F}_2$ is a direct sum if it is of the form $f\left(a_1,\dots,a_d\right) = f_1(a_1)\oplus\dots \oplus f_d (a_d),$ for some $d$ functions $f_i:[n_i]\to\mathbb{F}_2$ for all $i=1,\dots, d$,…

Computational Complexity · Computer Science 2019-10-11 Irit Dinur , Konstantin Golubev

Simplification of fractional powers of positive rational numbers and of sums, products and powers of such numbers is taught in beginning algebra. Such numbers can often be expressed in many ways, as this article discusses in some detail.…

Symbolic Computation · Computer Science 2013-02-12 Albert D. Rich , David R. Stoutemyer

We prove that if $f(n)$ is a Steinhaus or Rademacher random multiplicative function, there almost surely exist arbitrarily large values of $x$ for which $|\sum_{n \leq x} f(n)| \geq \sqrt{x} (\log\log x)^{1/4+o(1)}$. This is the first such…

Number Theory · Mathematics 2021-01-01 Adam J. Harper

A positive integer $n$ is practical if every $m \leq n$ can be written as a sum of distinct divisors of $n$. One can generalize the concept of practical numbers by applying an arithmetic function $f$ to each of the divisors of $n$ and…

Number Theory · Mathematics 2017-03-24 Nicholas Schwab , Lola Thompson

We study sums of the shape $\sum_{n \leqslant x} f \left( \lfloor x/n \rfloor \right)$ where $f$ is either the von Mangoldt function or the Dirichlet-Piltz divisor functions. We improve previous estimates when $f = \Lambda$ and $f = \tau$,…

Number Theory · Mathematics 2020-11-26 Olivier Bordellès

Two approximations, derived from continuous expansions of Riemann-Liouville fractional derivatives into series involving integer order derivatives, are studied. Using those series, one can formally transform any problem that contains…

Optimization and Control · Mathematics 2013-05-10 Shakoor Pooseh , Ricardo Almeida , Delfim F. M. Torres

Let $k\ge 2$ be a fixed integer. We consider sums of type $\sum_{n_1\cdots n_k\le x} F(n_1,\ldots,n_k)$, taken over the hyperbolic region $\{(n_1,\ldots,n_k)\in {\Bbb N}^k: n_1\cdots n_k\le x\}$, where $F:{\Bbb N}^k\to {\Bbb C}$ is a given…

Number Theory · Mathematics 2023-09-08 Randell Heyman , László Tóth

Let $f_1,\dots,f_k\in\mathbb{R}[X]$ be polynomials of degree at most $d$ with $f_1(0)=\dots=f_k(0)=0$. We show that there is an integer $n<x$ such that the fractional parts $\|f_i(n)\|\ll x^{c/k}$ for all $1\le i\le k$ and for some constant…

Number Theory · Mathematics 2020-11-25 James Maynard

We derive and prove an explicit formula for the sum of the fractional parts of certain geometric series. Although the proof is straightforward, we have been unable to locate any reference to this result. This summation formula allows us to…

Dynamical Systems · Mathematics 2021-09-15 J. J. P. Veerman , L. S. Fox , P. J. Oberly

We use the rationality of the generalized $h^{th}$ convergent functions, $Conv_h(\alpha, R; z)$, to the infinite J-fraction expansions enumerating the generalized factorial product sequences, $p_n(\alpha, R) =…

Combinatorics · Mathematics 2017-01-18 Maxie D. Schmidt

We obtain several asymptotic estimates for the sums of the restricted divisor function $$ \tau_{M,N}(k) = #\{1 \le m \le M, \ 1\le n \le N: mn = k\} $$ over short arithmetic progressions, which improve some results of J. Truelsen. Such…

Number Theory · Mathematics 2010-08-05 Igor E. Shparlinski

Divisor functions have attracted the attention of number theorists from Dirichlet to the present day. Here we consider associated divisor functions $c_j^{(r)}(n)$ which for non-negative integers $j, r$ count the number of ways of…

Number Theory · Mathematics 2019-10-08 Matthew C. Lettington , Karl Michael Schmidt

Let $\mathbb{N}$ be the set of natural numbers and $\mathcal{S}_r=\big\{1^r, 2^r, 3^r,\cdots\big\}$ the set of $r$-th powers, where $r\ge 2$ is a natural number. Let $\mathcal{W}_r$ be an additive complement of $\mathcal{S}_r$ and $$…

Number Theory · Mathematics 2026-05-19 Yuchen Ding , Csaba Sándor , Zihan Zhang

Analytical expressions are derived for the position of irreducible fractions in the Farey sequence $F_N$ of order $N$ for a particular choice of $N$. The asymptotic behaviour is derived obtaining a lower error bound than in previous results…

Number Theory · Mathematics 2024-04-15 Rogelio Tomas

Let $F({\bf x})\in\mathbb{Z}[x_1,x_2,\dots,x_n]$ be a quadratic polynomial in $n\geq 3$ variables with a nonsingular quadratic part. Using the circle method we derive an asymptotic formula for the sum $$ \Sigma_{k,F}(X;…

Number Theory · Mathematics 2019-09-18 Kostadinka Lapkova , Nian Hong Zhou

Let $D$ be a subset of a finite commutative ring $R$ with identity. Let $f(x)\in R[x]$ be a polynomial of positive degree $d$. For integer $0\leq k \leq |D|$, we study the number $N_f(D,k,b)$ of $k$-subsets $S\subseteq D$ such that…

Number Theory · Mathematics 2015-07-24 Jiyou Li , Daqing Wan