English
Related papers

Related papers: Mean value theorems for binary Egyptian fractions …

200 papers

This paper is a continuation of [1], in which I studied Harvey Friedman's problem of whether the function f(x,y) = x^2 + y^3 satisfies any identities; however, no knowledge of [1] is necessary to understand this paper. We will break the…

General Mathematics · Mathematics 2009-10-13 Roger Tian

We study the value distribution of the Sudler product $\prod_{n=1}^N |2 \sin (\pi n \alpha )|$ and the Diophantine product $\prod_{n=1}^N (2e\| n \alpha \|)$ for various irrational $\alpha$, as $N$ ranges in a long interval of integers. At…

Dynamical Systems · Mathematics 2025-01-07 Bence Borda

We answer a question raised by Alam and Ghosh concerning an error term for a spiralling result in Diophantine approximation by rationals in a number field. The proof relies on a generalisation of Rogers' Mean Value Theorem to algebraic…

Number Theory · Mathematics 2023-06-06 Nathan Hughes

For an odd integer $d > 1$ and a finite Galois extension $K/\mathbb{Q}$ of degree $d$, G. L\"{u} and Z. Yang \cite{lu3} obtained an asymptotic formula for the mean values of the divisor function for $K$ over square integers. In this…

Number Theory · Mathematics 2019-06-05 Jaitra Chattopadhyay , Pranendu Darbar

We find all solutions of Diophantine equation x^{2}+11^{2k} = y^{n} where x>=1, y>=1, n>=3 and k is natural number. We give p-adic interpretation of this equation.

Number Theory · Mathematics 2011-12-30 Ismail Naci Cangul , Gokhan Soydan , Yilmaz Simsek

Let $\alpha$ be a fixed quadratic irrational. Consider the Diophantine equation \[ y^a\ =\ q_{N_1} + \cdots + q_{N_K},\quad N_1 \geq \cdots \geq N_{K} \geq 0,\quad a, y \geq 2 \] where $(q_N)_{N\,\geq\,0}$ is the sequence of convergent…

Number Theory · Mathematics 2026-04-14 Divyum Sharma , L. Singhal

Let $a>1$ be an integer. Denote by $l_a(n)$ the multiplicative order of $a$ modulo integer $n\geq 1$. We prove that there is a positive constant $\delta$ such that if $x^{1-\delta}\log^3 x = o(y)$, then $$ \frac1y \sum_{a<y} \frac1x…

Number Theory · Mathematics 2016-05-20 Sungjin Kim

An Egyptian fraction is a sum of distinct unit fractions (reciprocals of positive integers). We show that every rational number has Egyptian fraction representations where the number of terms is of the same order of magnitude as the largest…

Number Theory · Mathematics 2007-05-23 Greg Martin

We study Riemann-type functional equations with respect to value-distribution theory and derive implications for their solutions. In particular, for a fixed complex number $a\neq0$ and a function from the Selberg class $\mathcal{L}$, we…

Number Theory · Mathematics 2024-07-22 Athanasios Sourmelidis , Jörn Steuding , Ade Irma Suriajaya

Let us denote by $F_n$ the $n$-th Fibonacci number. In this paper we show that for a fixed integer $y$ there exists at most one integer exponent $a>0$ such that the Diophantine equation $F_n+F_m=y^a$ has a solution $(n,m,a)$ in positive…

Number Theory · Mathematics 2021-03-29 Volker Ziegler

We prove a strong simultaneous Diophantine approximation theorem for values of additive and multiplicative functions provided that the functions have certain regularity on the primes.

Number Theory · Mathematics 2009-06-18 Emre Alkan , Kevin Ford , Alexandru Zaharescu

In this work, we investigate the existence of positive solutions for a multi-point boundary value problem for a second order delay differential equation. Under certain growth conditions on the nonlinearity, and by the mean of Leray-Schauder…

Analysis of PDEs · Mathematics 2018-01-09 Abdelkader Lakmeche , Horiya Habbaze , Ahmed Lakmeche

We study solvability of the Diophantine equation \begin{equation*} \frac{n}{2^{n}}=\sum_{i=1}^{k}\frac{a_{i}}{2^{a_{i}}}, \end{equation*} in integers $n, k, a_{1},\ldots, a_{k}$ satisfying the conditions $k\geq 2$ and $a_{i}<a_{i+1}$ for…

Number Theory · Mathematics 2021-02-11 Szabolcs Tengely , Maciej Ulas , Jakub Zygadło

We propose a method to determine the solvability of the diophantine equation $x^2-Dy^2=n$ for the following two cases: $(1)$ $D=pq$, where $p,q\equiv 1 \mod 4$ are distinct primes with $(\frac{q}{p})=1$ and…

Number Theory · Mathematics 2011-02-21 Dasheng Wei

A Diophantine $m$-tuple is a set $A$ of $m$ positive integers such that $ab+1$ is a perfect square for every pair $a,b$ of distinct elements of $A$. We derive an asymptotic formula for the number of Diophantine quadruples whose elements are…

Number Theory · Mathematics 2014-01-14 Greg Martin , Scott Sitar

We give the complete solution in integers $(n,a,b,x,y)$ of the title equation when $\gcd(x,y)=1$, except for the case when $xab$ is odd.

Number Theory · Mathematics 2010-01-15 I. N. Cangül , M. Demirci , G. Soydan , N. Tzanakis

In this paper we completely solve the Diophantine equation $F_n+F_m=2^{a_1}+2^{a_2}+2^{a_3}+2^{a_4}+2^{a_5}$, where $F_k$ denotes the $k$-th Fibonacci number. In addition to complex linear forms in logarithms and the Baker-Davenport…

Number Theory · Mathematics 2021-04-27 Ingrid Vukusic , Volker Ziegler

Let $a>1$ be an integer. Denote by $l_a(p)$ the multiplicative order of $a$ modulo primes $p$. We prove that if $\frac{x}{\log x\log\log x}=o(y)$, then $$\frac 1 y \sum_{a\leq y}\sum_{p\leq x}\frac{1}{l_a(p)}=\log x + C\log\log…

Number Theory · Mathematics 2021-02-10 Sungjin Kim

In this paper analyzes \textit{The Erd\H{o}s-Straus conjecture} asserts that $f$$(n)$ $>$ 0 for every $n$ $\geq$ 2, where $f(n)$ indicates the number of solutions to the Diophantine Equation…

General Mathematics · Mathematics 2016-09-02 Elias Rios

We consider the problem of finding, for a given quadratic measure of non-uniformity of a set of $N$ points (such as $L_2$ star-discrepancy or diaphony), the asymptotic distribution of this discrepancy for truly random points in the limit…

Computational Physics · Physics 2009-10-30 Andre van Hameren , Ronald Kleiss , Jiri Hoogland
‹ Prev 1 3 4 5 6 7 10 Next ›