中文
相关论文

相关论文: Je{\'s}manowicz' conjecture for polynomials

200 篇论文

The Sun polynomials $g_n(x)$ are defined by \begin{align*} g_n(x)=\sum_{k=0}^n{n\choose k}^2{2k\choose k}x^k. \end{align*} We prove that, for any positive integer $n$, there hold \begin{align*} &\frac{1}{n}\sum_{k=0}^{n-1}(4k+3)g_k(x)…

数论 · 数学 2015-12-29 Victor J. W. Guo , Guo-Shuai Mao , Hao Pan

We discuss two conjectures. (I) For each x_1,...,x_n \in R (C) there exist y_1,...,y_n \in R (C) such that \forall i \in {1,...,n} |y_i| \leq 2^{2^{n-2}} \forall i \in {1,...,n} (x_i=1 \Rightarrow y_i=1) \forall i,j,k \in {1,...,n}…

交换代数 · 数学 2010-03-30 Apoloniusz Tyszka

Let $d\equiv 2\pmod 4$ be a square-free integer such that $x^2 - dy^2 =- 1$ and $x^2 - dy^2 = 6$ are solvable in integers. We prove the existence of infinitely many quadruples in $\mathbb{Z}[\sqrt{d}]$ with the property $D(n)$ when $n \in…

数论 · 数学 2022-11-10 Kalyan Chakraborty , Shubham Gupta , Azizul Hoque

In this note we will analyze a diophantine equation raised by Michael Bennett in [1] that is pivotal in establishing that powers of five has few digits in its ternary expansion. We will show that the Diophantine equation…

数论 · 数学 2013-04-19 Satyanand Singh

A result by C. C.-A. Cheng, J. H. Mckay and S. S.-S. Wang says the following: Suppose the Jacobian of $A$ and $B$ is invertible in $\mathbb{C}[x,y]$ and the Jacobian of $A$ and $w$ is zero for $A,B,w \in \mathbb{C}[x,y]$. Then $w \in…

交换代数 · 数学 2018-02-21 Vered Moskowicz

In this note, we find all the solutions of the Diophantine equation x^2 +2^a.3^b.11^c=y^n in nonnegative integers a, b, c, x, y, n>= 3 with x and y coprime.

We prove that for any positive integer c there are at least N(c), $1\leq N(c) < \phi(c)/2$ representations of c as a sum of two positive integers a, b, with no common divisor, such that the N(c) radicals R(abc) are all greater than kc,…

数论 · 数学 2007-05-23 Constantin M. Petridi

Let $s\ge 2$ be an integer. Denote by $\mu_s$ the least integer so that every integer $\ell >\mu_s$ is the sum of exactly $s$ integers $>1 $ which are pairwise relatively prime. In 1964, Sierpi\'nski asked a determination of $\mu_s$. Let…

数论 · 数学 2014-09-16 Jin-Hui Fang , Yong-Gao Chen

Let $1<c<d$ be two relatively prime integers and $g_{c,d}=cd-c-d$. We confirm, by employing the Hardy--Littlewood method, a 2020 conjecture of Ram\'{\i}rez Alfons\'{\i}n and Ska{\l}ba which states that $$#\left\{p\le g_{c,d}:p\in…

数论 · 数学 2023-10-19 Yuchen Ding , Wenguang Zhai , Lilu Zhao

We conjecture that, if the quotient of two $q$-binomial coefficients with the same top argument is a polynomial, then it has non-negative coefficients. We summarise what is known about the conjecture and prove it in two non-trivial cases.…

组合数学 · 数学 2026-01-05 Mona Gatzweiler , Christian Krattenthaler

We formulate Goldbach type questions for Gaussian, Hurwitz, Octavian and Eisenstein primes. They are different from Goldbach type statements by Takayoshi Mitsui from 1960 for number fields or C.A. Holben and James Jordan from 1968 for…

数论 · 数学 2016-06-21 Oliver Knill

In this paper, we study three integers arising naturally from B\'{e}zout's identity, the resultant and the reduced resultant of two coprime integer polynomials. We establish several new divisibility relations among them. We also pose two…

数论 · 数学 2026-04-16 Zhiqian Liu , Xiaoting Li , Wenheng Liu , Min Sha

Let k be a fixed integer. We study the asymptotic formula of R(H, r, k), which is the number of positive integer solutions x, y, z greater than or equal to 1 and less than or equal to H such that the polynomial x^2+y^2+z^2+k is r-free. We…

数论 · 数学 2022-05-12 Gongrui Chen , Wenxiao Wang

For coprime positive integers $a, b, c$, where $a+b=c$, $\gcd(a,b,c)=1$ and $1\leq a < b$, the famous $abc$ conjecture (Masser and Oesterl\`e, 1985) states that for $\varepsilon > 0$, only finitely many $abc$ triples satisfy $c >…

综合数学 · 数学 2021-09-22 Zenon B. Batang

In his paper Almost-Primes Represented by Quadratic Polynomials, Iwaniec proved that the polynomial n^2 + 1 takes on values with at most two prime factors (counted with multiplicity) infinitely often. He states that "in order to avoid…

数论 · 数学 2019-10-08 Vishaal Kapoor

Let $q$ be a prime power. We construct stable polynomials of the form $b^{m-1}(x+a)^m+c(x+a)+d$ over a finite field $\mathbb{F}_{q}$ for $m=2,3,4$ by Capelli's lemma. When $m=3$ and $q$ is even, we confirm the conjecture of Ahmadi and…

数论 · 数学 2023-10-05 Tong Lin , Qiang Wang

The Collatz conjecture is explored using polynomials based on a binary numeral system. It is shown that the degree of the polynomials, on average, decreases after a finite number of steps of the Collatz operation, which provides a weak…

数论 · 数学 2019-05-22 Feng Pan , Jerry P. Draayer

Let A be a finite set of integers. For a polynomial f(x_1,...,x_n) with integer coefficients, let f(A) = {f(a_1,...,a_n) : a_1,...,a_n \in A}. In this paper it is proved that for every pair of normalized binary linear forms f(x,y)=u_1x+v_1y…

We obtain a new bound for the number of solutions to polynomial equations in cosets of multiplicative subgroups in finite fields, which generalises previous results of P. Corvaja and U. Zannier (2013). We also obtain a conditional…

数论 · 数学 2020-05-13 Sergei V. Konyagin , Igor E. Shparlinski , Ilya V. Vyugin

We consider a set of equations of the form $p_j (x,y) = (10 x+m_j)(10 y + n_j),\,\,x\geq 0, y\geq0$, $j=1,2,3$, such that $\{m_1=7, n_1=3\}$, $\{m_2=n_2=9\}$ and $\{m_3=n_3=1\}$, respectively. It is shown that if $(a(p_j),b(p_j)) \in N…

数论 · 数学 2018-08-21 B. M. Cerna Maguiña , H. Blas , V. H. López Solís
‹ 上一页 1 8 9 10 下一页 ›