中文
相关论文

相关论文: Strong paucity in the Br\"udern-Robert Diophantine…

200 篇论文

Using elementary number theory we study Diophantine equations over the rational integers of the following form, $y^2=(x+a)(x+a+k)(x+b)(x+b+k)$, $y^2=c^2x^4+ax^2+b$ and $y^2=(x^2-1)(x^2-\alpha^2)(x^2-(\alpha+1)^2).$ We express their integer…

数论 · 数学 2022-11-17 Konstantinos A. Draziotis

Recently, Hajdu and S\'{a}rk\"{o}zy studied the multiplicative decompositions of polynomial sequences. In particular, they showed that when $k \geq 3$, each infinite subset of $\{x^k+1: x \in \mathbb{N}\}$ is multiplicatively irreducible.…

数论 · 数学 2025-04-22 Chi Hoi Yip

The authors propose and analyze a well-posed numerical scheme for a type of ill-posed elliptic Cauchy problem by using a constrained minimization approach combined with the weak Galerkin finite element method. The resulting Euler-Lagrange…

数值分析 · 数学 2018-06-06 Chunmei Wang , Junping Wang

We examine the system given by \hfill -\Delta u = \lambda (v+1)^p \qquad \Omega \hfill -\Delta v = \gamma (u+1)^\theta \qquad \Omega, \hfill u = v =0 \qquad \quad \partial \Omega, where $ \lambda,\gamma$ are positive parameters and where $…

偏微分方程分析 · 数学 2012-06-20 Craig Cowan

This paper is concerned with the diophantine system, $\sum_{i=1}^{s_1} x_i^r=\sum_{i=1}^{s_2} y_i^r,\, r=1,\,2,\,\ldots,\,k, $ where $s_1$ and $s_2$ are integers such that the total number of terms on both sides, that is, $s_1+s_2,$ is as…

数论 · 数学 2016-03-01 Ajai Choudhry

We establish Diophantine inequalities for the fractional parts of generalized polynomials $f$, in particular for sequences $\nu(n)=\lfloor n^c\rfloor+n^k$ with $c>1$ a non-integral real number and $k\in\mathbb{N}$, as well as for $\nu(p)$…

数论 · 数学 2019-02-20 Manfred G. Madritsch , Robert F. Tichy

Author developed a method in the paper, which, unlike the circle method of Hardy and Littlewood (CM), allows you to perform a lower estimate for the number of natural (integer) solutions of algebraic Diophantine equation with integer…

数论 · 数学 2016-04-28 Victor Volfson

Let $\{ {U_{n}\}_{n \geq 0} }$ be a non-degenerate binary recurrence sequence with positive discriminant. Let $\{p_1,\ldots, p_s\}$ be fixed prime numbers and $\{b_1,\ldots ,b_s\}$ be fixed non-negative integers. In this paper, we obtain…

数论 · 数学 2016-12-20 N. K. Meher , S. S. Rout

The Brocard-Ramanujan problem pertaining to the diophantine equation $n!+1=m^2$, a famously unsolved problem, deals with finding the integer solutions to the equation. Nobody has discovered any new solution of the problem beyond $n=4,~5$…

数论 · 数学 2026-02-06 Somnath Maiti

Let $k\geq 2$ and $n\neq 0$. A Diophantine tuple with property $D_k(n)$ is a set of positive integers $A$ such that $ab+n$ is a $k$-th power for all $a,b\in A$ with $a\neq b$. Such generalizations of classical Diophantine tuples have been…

数论 · 数学 2026-03-17 Ernie Croot , Chi Hoi Yip

We refine a recent result of Parsell on the values of the form $\lambda_1p_1 + \lambda_2p_2 + \mu_1 2^{m_1} + ...m + \mu_s 2^{m_s}, $ where $p_1,p_2$ are prime numbers, $m_1,...c, m_s$ are positive integers, $\lambda_1 / \lambda_2$ is…

数论 · 数学 2013-02-14 A. Languasco , A. Zaccagnini

Intrinsic Diophantine approximation on fractals, such as the Cantor ternary set, was undoubtedly motivated by questions asked by K. Mahler (1984). One of the main goals of this paper is to develop and utilize the theory of infinite de…

组合数学 · 数学 2016-10-18 Lior Fishman , Keith Merrill , David Simmons

In this paper, first, we prove that the Diophantine system \[f(z)=f(x)+f(y)=f(u)-f(v)=f(p)f(q)\] has infinitely many integer solutions for $f(X)=X(X+a)$ with nonzero integers $a\equiv 0,1,4\pmod{5}$. Second, we show that the above…

数论 · 数学 2017-06-13 Yong Zhang , Zhongyan Shen

For any given positive definite binary quadratic form $Q$ with integer coefficients, we establish two results on Diophantine approximation with integers represented by $Q$. Firstly, we show that for every irrational number $\alpha$, there…

数论 · 数学 2026-04-03 Stephan Baier , Habibur Rahaman

This work determine the entire family of positive integer solutions of the diophantine equation. The solution is described in terms of $\frac{(m-1)(m+n-2)}{2} $ or $\frac{(m-1)(m+n-1)}{2}$ positive parameters depending on $n$ even or odd.…

数论 · 数学 2014-02-24 Zahid Raza , Hafsa Masood Malik

The present work includes some of the author's original researches on integer solutions of Diophantine liner equations and systems. The notion of "general integer solution" of a Diophantine linear equation with two unknowns is extended to…

综合数学 · 数学 2007-11-28 Florentin Smarandache

We consider certain systems of three linked simultaneous diagonal equations in ten variables with total degree exceeding five. By means of a complification argument, we obtain an asymptotic formula for the number of integral solutions of…

数论 · 数学 2021-06-09 Joerg Bruedern , Trevor D. Wooley

We study the number of lattice points in integer dilates of the rational polytope $P = (x_1,...,x_n) \in \R_{\geq 0}^n : \sum_{k=1}^n x_k a_k \leq 1$, where $a_1,...,a_n$ are positive integers. This polytope is closely related to the linear…

数论 · 数学 2007-05-23 Matthias Beck , Ricardo Diaz , Sinai Robins

Let $F_n$ denote the $n^{th}$ term of the Fibonacci sequence. In this paper, we investigate the Diophantine equation $F_1^p+2F_2^p+\cdots+kF_{k}^p=F_{n}^q$ in the positive integers $k$ and $n$, where $p$ and $q$ are given positive integers.…

数论 · 数学 2021-04-01 Gökhan Soydan , László Németh , László Szalay

Let $p>3$ be a prime. We prove that $$\sum_{k=0}^{p-1}\binom{2k}{k}/2^k=(-1)^{(p-1)/2}-p^2E_{p-3} (mod p^3),$$ $$\sum_{k=1}^{(p-1)/2}\binom{2k}{k}/k=(-1)^{(p+1)/2}8/3*pE_{p-3} (mod p^2),$$…

数论 · 数学 2015-05-18 Zhi-Wei Sun