中文
相关论文

相关论文: On the equation $ \boldsymbol{n_1n_2=n_3n_4}$ rest…

200 篇论文

We show that whenever $m \geq 1$ and $M_1, \dots, M_m$ are nonamenable factors in a large class of von Neumann algebras that we call $\mathcal C_{(\text{AO})}$ and which contains all free Araki-Woods factors, the tensor product factor $M_1…

算子代数 · 数学 2025-07-17 Cyril Houdayer , Yusuke Isono

When $k\ge 4$ and $0\le d\le (k-2)/4$, we consider the system of Diophantine equations \[ x_1^j+\ldots +x_k^j=y_1^j+\ldots +y_k^j\quad (1\le j\le k,\, j\ne k-d). \] We show that in this cousin of a Vinogradov system, there is a paucity of…

数论 · 数学 2023-08-16 Trevor D. Wooley

In this paper we consider Diophantine equations of the form $f(x)=g(y)$ where $f$ has simple rational roots and $g$ has rational coefficients. We give strict conditions for the cases where the equation has infinitely many solutions in…

数论 · 数学 2022-04-27 L. Hajdu , R. Tijdeman

We study the Diophantine equation of type $U_n(x)=V_m(y)$, where $(U_n)_{n\geq 0}$ and $(V_m)_{m\geq 0}$ are polynomial power sums defined over a number field $K$. By applying the finiteness criterion of Bilu and Tichy, we show under…

数论 · 数学 2025-12-24 Darsana N , Sudhansu Sekhar Rout

The equation $f^n+g^n=1$, $n\in\mathbb{N}$ can be regarded as the Fermat Diophantine equation over the function field. In this paper we study the characterization of entire solutions of some system of Fermat type functional equations by…

复变函数 · 数学 2023-11-01 Goutam Haldar

A classic question in analytic number theory is to find asymptotics for $\sigma_{k}(x)$ and $\pi_{k}(x)$, the number of integers $n\leq x$ with exactly $k$ prime factors, where $\pi_{k}(x)$ has the added constraint that all the factors are…

数论 · 数学 2023-03-13 Eric Naslund

We consider Lagrange's equation $x_1^2 + x_2^2 + x_3^2 + x_4^2 = N$, where $N$ is a sufficiently large and odd integer, and prove that it has a solution in natural numbers $x_1, \dots, x_4 $ such that $x_1 x_2 x_3 x_4 + 1$ has no more than…

数论 · 数学 2014-01-07 T. L. Todorova , D. I. Tolev

In this paper, we use the method of Thue and Siegel, based on explicit Pade approximations to algebraic functions, to completely solve a family of quartic Thue equations. From this result, we can also solve the diophantine equation in the…

数论 · 数学 2018-07-12 Chen Jian Hua , Paul Voutier

In this paper we solve the ternary Piatetski-Shapiro inequality with prime numbers of a special form. More precisely we show that, for any fixed $1<c<\frac{427}{400}$, every sufficiently large positive number $N$ and a small constant…

数论 · 数学 2025-02-11 S. I. Dimitrov

We study purely exponential Diophantine equations with four terms of consecutive bases. Notably, we prove that all solutions to the equation \[ n^x=(n+1)^y+(n+2)^z+(n+3)^w \] in positive integers $n,x,y,z$ and $w$ are given by…

数论 · 数学 2025-08-26 Maohua Le , Takafumi Miyazaki

First, we consider the equation $ax^2 - by^2 + c = 0$, with $a,b \in N*$ and $c \in Z*$, which is a generalization of Pell's equation. Here, we show that: if this equation has an integer solution and $ab$ is not a perfect square, then it…

综合数学 · 数学 2007-05-23 Florentin Smarandache

We deeply investigate the Diophantine equation $cx^2+d^{2m+1}=2y^n$ in integers $x, y\geq 1, m\geq 0$ and $n\geq 3$, where $c$ and $d$ are given coprime positive integers such that $cd\not\equiv 3 \pmod 4$. We first solve this equation for…

数论 · 数学 2023-06-01 Azizul Hoque

Let $n$ be a non-negative integer and put $p_{n}(x)=\prod_{i=0}^{n}(x+i)$. In the first part of the paper, for given $n$, we study the existence of integer solutions of the Diophantine equation $$ y^m=p_{n}(x)+\sum_{i=1}^{k}p_{a_{i}}(x), $$…

数论 · 数学 2018-09-13 Szabolcs Tengely , Maciej Ulas

Let $f(x_1,\ldots,x_n)$ be a regular indefinite integral quadratic form with $n\ge 9$, and let $t$ be an integer. It is established that $f(x_1,\ldots,x_n)=t$ has solutions in prime variables if there are no local obstructions.

数论 · 数学 2014-02-18 Lilu Zhao

Let $k\ge 2$ and $a_1, a_2, \cdots, a_k$ be positive integers with \[ \gcd(a_1, a_2, \cdots, a_k)=1. \] It is proved that there exists a positive integer $G_{a_1, a_2, \cdots, a_k}$ such that every integer $n$ strictly greater than it can…

数论 · 数学 2025-09-11 Yuchen Ding , Weijia Wang , Hao Zhang

For relatively prime natural numbers $a$ and $b$, we study the two equations $ax+by = (a-1)(b-1)/2$ and $ax+by+1= (a-1)(b-1)/2$, which arise from the study of cyclotomic polynomials. Previous work showed that exactly one equation has a…

We study the Frobenius problem: given relatively prime positive integers a_1,...,a_d, find the largest value of t (the Frobenius number g(a_1,...,a_d)) such that m_1 a_1 + ... m_d a_d = t has no solution in nonnegative integers m_1,...,m_d.…

数论 · 数学 2007-05-23 Matthias Beck , Shelemyahu Zacks

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…

数论 · 数学 2017-07-04 Sudhansu Sekhar Rout

We obtain an essentially optimal estimate for the moment of order 32/3 of the exponential sum having argument $\alpha x^3+\beta x^2$. Subject to modest local solubility hypotheses, we thereby establish that pairs of diagonal Diophantine…

数论 · 数学 2023-05-10 Trevor D. Wooley

We show that in n-fold cartesian product, n >= 4, a related component need not be a full component. We also prove that when n >= 4, uniform boundedness of lengths of geodesics is not a necessary condition for boundedness of solutions of (1)…

泛函分析 · 数学 2007-07-16 K Gowri Navada