中文
相关论文

相关论文: An elementary proof of a result Ma and Chen

200 篇论文

In this paper we confirm a conjecture of Sun which states that each positive integer is a sum of a square, an odd square and a triangular number. Given any positive integer m, we show that p=2m+1 is a prime congruent to 3 modulo 4 if and…

数论 · 数学 2009-02-07 Byeong-Kweon Oh , Zhi-Wei Sun

We show that there are at most two solutions in positive integers $(x,y,z)$ to the equation $a^x+b^y=c^z$ for positive integers $a$, $b$, and $c$ all greater than one, with just one exceptional case when $\gcd(a,b)=1$, and just one…

数论 · 数学 2024-12-25 Reese Scott , Robert Styer

Let k => 1, m => 1 be small fixed integers, gcd(k, m) = 1. This note develops some techniques for proving the existence of infinitely many primes solutions x = p, and y = q of the linear Diophantine equation y = mx + k.

综合数学 · 数学 2014-04-04 N. A. Carella

Let $M$ be a unitary $S^1$-manifold with only isolated fixed points such that $M$ is not a boundary. We show that $4\chi(M)>\dim M$, where $\chi(M)$ is the Euler characteristic of $M$. This gives an affirmative answer of Kosniowski…

几何拓扑 · 数学 2021-08-31 Zhi Lü

We prove that for each odd prime p, positive integer alpha, and non-negative integers beta and gamma, the Diophantine equation X^{2N} + 2^{2 alpha} 5^{2 beta} p^{2 gamma} = Z^5 has no solution with X, Z, N in Z^+, N > 1, and gcd(X,Z) = 1.

数论 · 数学 2014-09-09 Eva G. Goedhart , Helen G. Grundman

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.

数论 · 数学 2010-01-15 I. N. Cangül , M. Demirci , G. Soydan , N. Tzanakis

The Kahane--Salem--Zygmund inequality for multilinear forms in $\ell_{\infty}$ spaces claims that, for all positive integers $m,n_{1},...,n_{m}$, there exists an $m$-linear form $A\colon\ell_{\infty}^{n_{1}}\times\cdots\times…

组合数学 · 数学 2021-11-04 Daniel Pellegrino , Anselmo Raposo

We improve earlier work on the title equation (where $p$ and $q$ are primes and $c$ is a positive integer) by allowing $x$ and $y$ to be zero as well as positive. Earlier work on the title equation showed that, with listed exceptions, there…

数论 · 数学 2011-12-21 Reese Scott , Robert Styer

We study an extension to the uniqueness conjecture for Markov numbers. For any three positive integers $m\geq a$ and $m\geq b$ satisfying $a^2+b^2+m^2=3abm$, this conjecture states that the triple $(a,m,b)$ is uniquely determined by the…

数论 · 数学 2019-11-05 Matty van Son

We obtain existence results for the $Q$-curvature equation of order $2k$ on a closed Riemannian manifold of dimension $n\ge 2k+1$, where $k\ge1$ is an integer. We obtain these results under the assumptions that the Yamabe invariant of order…

偏微分方程分析 · 数学 2022-12-22 Saikat Mazumdar , Jérôme Vétois

Let $m$ and $n$ be positive integers with $m,n \geq 2$. The second Hardy-Littlewood conjecture states that the number of primes in the interval $(m,m+n]$ is always less than or equal to the number of primes in the interval $[2,n]$. Based on…

数论 · 数学 2019-10-01 Christian Axler

We prove two positivity conjectures proposed by Guo for alternating sums and factorial ratios built from Gaussian coefficients. The first result proves the positivity of the odd $q$-super Catalan numbers \[…

组合数学 · 数学 2026-05-28 Ji-Cai Liu

Let $a,b$ and $n$ be positive integers with $a>b$. In this note, we prove that $$(2bn+1)(2bn+3){2bn \choose bn}\bigg|3(a-b)(3a-b){2an \choose an}{an\choose bn}.$$ This confirms a recent conjecture of Amdeberhan and Moll.

数论 · 数学 2015-02-26 Quan-Hui Yang

Using an adaptation of Qin Jiushao's method from the 13th century, it is possible to prove that a system of linear modular equations a(i,1) x(i) + ... + a(i,n) x(n) = b(i) mod m(i), i=1, ..., n has integer solutions if m(i)>1 are pairwise…

历史与综述 · 数学 2012-06-25 Oliver Knill

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

We provide a method, using essentially elementary arithmetic, to solve the exponential diophantine equation 7x^2 + 59y^2 = 3^m, which leads to a simple algorithm, with no use of radicals or complex numbers, that generates all the…

数论 · 数学 2019-07-01 Roy Barbara

Given odd, coprime integers $a$, $b$ ($a>0$), we consider the Diophantine equation $ax^2+b^{2l}=4y^n$, $x, y\in\Bbb Z$, $l \in \Bbb N$, $n$ odd prime, $\gcd(x,y)=1$. We completely solve the above Diophantine equation for…

数论 · 数学 2020-01-15 Andrzej Dąbrowski , Nursena Günhan , Gökhan Soydan

Zaremba's conjecture (1971) states that every positive integer number $d$ can be represented as a denominator (continuant) of a finite continued fraction $\frac{b}{d}=[d_1,d_2,\ldots,d_{k}],$ with all partial quotients…

数论 · 数学 2016-04-19 I. D. Kan

Let $N$ denote a sufficiently large even integer and $x$ denote a sufficiently large integer, we define $D_{1,2}(N)$ as the number of primes $p$ that such that $N - p$ has at most 2 prime factors. In this paper, we show that $D_{1,2}(N)…

数论 · 数学 2025-06-03 Runbo Li

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…

综合数学 · 数学 2016-09-02 Elias Rios
‹ 上一页 1 8 9 10 下一页 ›