中文
相关论文

相关论文: On the exceptional set for binary Egyptian fractio…

200 篇论文

Let E_n={x_i=1, x_i+x_j=x_k, x_i \cdot x_j=x_k: i,j,k \in {1,...,n}}. For a positive integer n, let f(n) denote the greatest finite total number of solutions of a subsystem of E_n in integers x_1,...,x_n. We prove: (1) the function f is…

数论 · 数学 2014-03-25 Apoloniusz Tyszka

In this study we find all solutions of the Diophantine equation $B_{n_{1}}+B_{n_{2}}=2^{a_{1}}+2^{a_{2}}+2^{a_{3}}$ in positive integer variables $(n_{1},n_{2},a_{1},a_{2},a_{3}),$ where $B_{n}$ denotes the $n$-th balancing number.

数论 · 数学 2023-06-22 Kisan Bhoi , Prasanta Kumar Ray

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…

数论 · 数学 2026-04-14 Divyum Sharma , L. Singhal

Let $\Omega$ be a bounded domain in $\mathbb R^{N}$, $N\geq3$ with smooth boundary, $a>0, \lambda>0$ and $0<\delta<3$ be real numbers. Define $2^*:=\displaystyle\frac{2N}{N-2}$ and the characteristic function of a set $A$ by $\chi_A$. We…

偏微分方程分析 · 数学 2016-06-07 R. Dhanya , S. Prashanth , Sweta Tiwari , K. Sreenadh

By finding all integral points on certain elliptic and hyperelliptic curves we completely solve the Diophantine equation $\binom{n}{k}=\binom{m}{l}+d$ for $-3\leq d\leq 3$ and $(k,l)\in\{(2,3),\; (2,4),\;(2,5),\; (2,6),\; (2,8),\; (3,4),\;…

We study connections between linear equations over various semigroups and recursively enumerable sets of positive integers. We give variants of the universal Diophantine representation of recursively enumerable sets of positive integers…

形式语言与自动机理论 · 计算机科学 2024-06-04 Juha Honkala

Let $\Omega\subset \mathbb{R}^N$ be a bounded regular domain, $0<s<1$ and $N>2s$. We consider $$ (P)\left\{ \begin{array}{rcll} (-\Delta)^s u &= & \frac{u^{q}}{d^{2s}} & \text{ in }\Omega , \\ u &> & 0 & \text{in }\Omega , \\ u & = & 0 &…

偏微分方程分析 · 数学 2018-06-11 Boumediene Abdellaoui , kheireddine Biroud , Ana Primo

The Diophantine sums $\sum_{n=1}^N \| n \alpha \|^{-1}$ and $\sum_{n=1}^N n^{-1} \| n \alpha \|^{-1}$ appear in many different areas including the ergodic theory of circle rotations, lattice point counting and random walks, often in…

数论 · 数学 2024-07-09 Bence Borda

Let $f(x)=x^{2}(x^{2}-1)(x^{2}-2)(x^{2}-3).$ We prove that the Diophantine equation $ f(x)=2f(y)$ has no solutions in positive integers $x$ and $y$, except $(x, y)=(1, 1)$.

数论 · 数学 2018-11-06 Sanjay Bhatter , Richa Sharma

Let L_t denote the t-th Lucas number. We prove that the Diophantine equation L_m^{n+k} + L_m^n = L_r has no solutions in positive integers r, m, n, and k with m >= 2. In the case n = 1, the proof is based on a precise factorization formula…

数论 · 数学 2026-02-19 Seyran S. Ibrahimov , Nazim I. Mahmudov

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…

数论 · 数学 2021-02-11 Szabolcs Tengely , Maciej Ulas , Jakub Zygadło

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

If $k$ is a sufficiently large positive integer, we show that the Diophantine equation $$n (n+d) \cdots (n+ (k-1)d) = y^{\ell}$$ has at most finitely many solutions in positive integers $n, d, y$ and $\ell$, with $\operatorname{gcd}(n,d)=1$…

数论 · 数学 2017-09-05 Michael A. Bennett , Samir Siksek

Let $N$ be an odd perfect number. Then, Euler proved that there exist some integers $n, \alpha$ and a prime $q$ such that $N = n^{2}q^{\alpha}$, $q \nmid n$, and $q \equiv \alpha \equiv 1 \bmod 4$. In this note, we prove that the ratio…

数论 · 数学 2023-12-01 Yoshinosuke Hirakawa

In this article, we consider the Diophantine equation $\sigma_{2}(n)-n^2=An+B$ with $A=P^2\pm2$. For some $B$, we show that except for finitely many computable solutions in the range $n\leq(|A|+|B|)^{3}$, all the solutions are expressible…

数论 · 数学 2017-09-20 Hao Zhong , Tianxin Cai

In this paper, we investigate the Diophantine equation \[ (2^k - 1)(3^k - 1) = x^n \] and prove that it has no solutions in positive integers $k, x, n > 2$.

数论 · 数学 2025-07-29 Bo He , Chang Liu

Let $C_n=n2^n+1$ denote the $n$th Cullen number. There has been recent interest in finding all Cullen numbers having a given Diophantine property. We prove that, for a fixed integer $k$ and bounded integers $a_1,\ldots,a_k$, the greatest…

数论 · 数学 2026-05-28 Vikas Godara , Divyum Sharma

Diophantine problems involving recurrence sequences have a long history and is an actively studied topic within number theory. In this paper, we connect to the field by considering the equation \begin{align*} B_mB_{m+d}\dots…

数论 · 数学 2016-07-27 Lajos Hajdu , Shanta Laishram , Márton Szikszai

Suppose that $n$ is a positive integer. In this paper, we show that the exponential Diophantine equation $$(n-1)^{x}+(n+2)^{y}=n^{z},\ n\geq 2,\ xyz\neq 0$$ has only the positive integer solutions $(n,x,y,z)=(3,2,1,2), (3,1,2,3)$. The main…

数论 · 数学 2020-03-31 Hairong Bai , Elif Kızıldere , Gökhan Soydan , Pingzhi Yuan

We consider the equality of the values of the $n$th and $k$th elementary symmetric polynomials of $n$ not necessarily distinct positive integers. For $k < n$, we prove that this equation always has a solution, but only finitely many…

数论 · 数学 2026-01-21 Sándor Z. Kiss , Csaba Sándor , Maciej Zakarczemny