中文
相关论文

相关论文: A general formula in Additive Number Theory

200 篇论文

In this note we investigate the set $S(n)$ of positive integer solutions of the title Diophantine equation. In particular, for a given $n$ we prove boundedness of the number of solutions, give precise upper bound on the common value of…

数论 · 数学 2022-03-09 Piotr Miska , Maciej Ulas

A classification of ordinary differential equations and finite-difference equations in one variable having polynomial solutions (the generalized Bochner problem) is given. The method used is based on the spectral problem for a polynomial…

高能物理 - 理论 · 物理学 2008-02-03 Alexander Turbiner

We give an infinite number of integer solutions to the Diophantine equation x^5 - (x+1)^5 -(x+2)^5 +(x+3)^5 = 5^m + 5^n, and some solutions to some similar equations.

数论 · 数学 2016-03-02 Geoffrey B Campbell , Aleksander Zujev

We study the problem of representing integers as sums of prime numbers from a fixed Beatty sequence $B_{\alpha,\beta}$, where $\alpha>1$ is irrational and of finite type.

数论 · 数学 2015-06-26 William D. Banks , Ahmet M. Guloglu , C. Wesley Nevans

In this paper we present a new approach to prove effective results in Diophantine approximation. We then use it to prove an effective theorem on the simultaneous approximation of two algebraic numbers satisfying an algebraic equation with…

数论 · 数学 2020-05-15 Matthias Nickel

The multiplicative theory of a set of numbers (which could be natural, integer, rational, real or complex numbers) is the first-order theory of the structure of that set with (solely) the multiplication operation (that set is taken to be…

逻辑 · 数学 2021-11-30 Saeed Salehi

In this paper, we consider some hybrid Diophantine equations of addition and multiplication. We first improve a result on new Hilbert-Waring problem. Then we consider the equation \begin{equation} \begin{cases} A+B=C ABC=D^n \end{cases}…

数论 · 数学 2014-03-05 Tianxin Cai , Deyi Chen , Yong Zhang

Let $A$ be an additive basis. We call ``essential subset'' of $A$ any finite subset $P$ of $A$ such that $A \setminus P$ is not an additive basis and that $P$ is minimal (for the inclusion order) to have this property. A recent theorem due…

数论 · 数学 2008-07-23 Bakir Farhi

A basic question of Diophantine approximation, which is the first issue we discuss, is to investigate the rational approximations to a single real number. Next, we consider the algebraic or polynomial approximations to a single complex…

数论 · 数学 2009-08-28 Michel Waldschmidt

We point out that the recursive formula that appears in Erickson's presentation "Fusible Numbers" is incorrect, and pose an alternate conjecture about the structure of fusible numbers. Although we are unable to solve the conjecture, we…

组合数学 · 数学 2012-02-28 Junyan Xu

We solve the Diophantine equation $Y^2=X^3+k$ for all nonzero integers $k$ with $|k| \leq 10^7$. Our approach uses a classical connection between these equations and cubic Thue equations. The latter can be treated algorithmically via lower…

数论 · 数学 2019-02-20 Michael A. Bennett , Amir Ghadermarzi

The ancient unsolved problem of congruent numbers has been reduced to one of the major questions of contemporary arithmetic: the finiteness of the number of curves over $\bf Q$ which become isomorphic at every place to a given curve. We…

历史与综述 · 数学 2010-03-15 Chandan Singh Dalawat

Let $\mathfrak{p}=(\mathfrak{p}_1,...,\mathfrak{p}_r)$ be a system of $r$ polynomials with integer coefficients of degree $d$ in $n$ variables $\mathbf{x}=(x_1,...,x_n)$. For a given $r$-tuple of integers, say $\mathbf{s}$, a general local…

数论 · 数学 2015-06-18 Brian Cook , Ákos Magyar

We will be presenting two theorems in this paper. The first theorem, which is a new result, is about the non-existence of integer solutions of the cubic diophantine equation. In the proof of this theorem we have used some known results from…

综合数学 · 数学 2007-05-23 Joseph Amal Nathan

We solve an elementary number theory problem on sums of fractional parts, using methods from group theory. We apply our result to deduce the finiteness of certain monodromy representations.

数论 · 数学 2016-12-15 Eknath Ghate , T. N. Venkataramana

For a fixed integer $k \ge 0$, consider representations of positive integers as sums of binomial coefficients of the form $\binom{n}{k}$. While exact minimal bounds for the number of required summands are known only in a few low-dimensional…

组合数学 · 数学 2026-04-29 Alexander Povolotsky

An exact, number-conserving solution to the generalized, orbit-dependent pairing problem is derived by introducing an infinite-dimensional algebra. A method for obtaining eigenvalues and eigenvectors of the corresponding Hamiltonian is also…

核理论 · 物理学 2009-10-30 Feng Pan , J. P. Draayer , W. E. Ormand

In an earlier paper, Tatong and Suvarnamani explores the Diophantine equation $p^x + p^y = z^2$ for a prime number $p$. In that paper they find some solutions to the equation for $p=2, 3$. In this paper, we look at a general version of this…

数论 · 数学 2017-09-07 Dibyajyoti Deb

The Subspace Theorem is a powerful tool in number theory. It has appeared in various forms and been adapted and improved over time. It's applications include diophantine approximation, results about integral points on algebraic curves and…

组合数学 · 数学 2013-11-18 Ryan Schwartz , Jozsef Solymosi

For two relatively prime positive integers $a, b\in \mathbb{N}$, it is known that exactly one of the two Diophantine equations $$ax + by \ =\ \frac{(a-1)(b-1)}{2}\ \mbox{ and }\ 1 + ax + by \ =\ \frac{(a-1)(b-1)}{2}$$ has a nonnegative…

数论 · 数学 2025-12-16 Hung Viet Chu , Steven J. Miller , Garrett Tresch