中文
相关论文

相关论文: Only finitely many $s$-Cullen numbers are repunits…

200 篇论文

Assuming the abc conjecture with $\epsilon=1/6$, we use elementary methods to show that only finitely many $s$-Cullen numbers are repunits, aside from two known infinite families. More precisely, only finitely many positive integers $s$,…

数论 · 数学 2021-05-27 Jon Grantham , Hester Graves

Let $(U_n)_{n\geq 0}$ be a fixed linear recurrence sequence of integers with order at least two, and for any positive integer $\ell$, let $\ell \cdot 2^{\ell} + 1$ be a Cullen number. Recently in \cite{bmt}, generalized Cullen numbers in…

数论 · 数学 2020-10-21 Nabin Kumar Meher , Sudhansu Sekhar Rout

In this note we prove that: \begin{theorem} for $2\leq s<\frac{n}{2}$ or $1\leq s<\frac{2n}{n+1}$ or $1\leq s<\frac{n}{2}$ but n is even, $(-\Delta)^{s}(u)=|u|^{q-2}u,q=\frac{2n}{n-2s}$ has infinitely many sign changing solutions or…

偏微分方程分析 · 数学 2010-04-20 Chen Shibing

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

Let $s(n)$ denote the sum of digits in the binary expansion of the integer $n$. Hare, Laishram and Stoll (2011) studied the number of odd integers such that $s(n)=s(n^2)=k$, for a given integer $k\geq 1$. The remaining cases that could not…

We conjecture that if a system S \subseteq {x_i=1, x_i+x_j=x_k, x_i \cdot x_j=x_k: i,j,k \in {1,...,n}} has only finitely many solutions in integers x_1,...,x_n, then each such solution (x_1,...,x_n) satisfies |x_1|,...,|x_n| \leq…

数论 · 数学 2014-10-21 Apoloniusz Tyszka

Although there are infinitely many knots with superbridge index n for every even integer n>2, there are only finitely many knots with superbridge index 3.

几何拓扑 · 数学 2007-05-23 Choon Bae Jeon , Gyo Taek Jin

We prove that for each fixed $m \ge 2$, there are only finitely many disjoint covering systems with minimum modulus at least $3$ in which precisely one modulus is repeated, namely the largest modulus, and it occurs exactly $m$ times.

数论 · 数学 2026-03-30 Yu Hashimoto

In [Kim05], Kim gave a new proof of Siegel's Theorem that there are only finitely many $S$-integral points on $\mathbb P^1_{\mathbb Z}\setminus\{0,1,\infty\}$. One advantage of Kim's method is that it in principle allows one to actually…

We show that for any positive integer $N$, there are only finitely many holomorphic eta quotients of level $N$, none of which is a product of two holomorphic eta quotients other than 1 and itself. This result is an analog of Zagier's…

数论 · 数学 2017-09-19 Soumya Bhattacharya

We show that there exist arbitrarily large sets $S$ of $s$ prime numbers such that the equation $a+b=c$ has more than $\exp(s^{2-\sqrt{2}-\epsilon})$ solutions in coprime integers $a$, $b$, $c$ all of whose prime factors lie in the set $S$.…

数论 · 数学 2007-05-23 S. Konyagin , K. Soundararajan

A composite positive integer $n$ has the Lehmer property if $\phi(n)$ divides $n-1,$ where $\phi$ is an Euler totient function. In this note we shall prove that if $n$ has the Lehmer property, then $n\leq 2^{2^{K}}-2^{2^{K-1}}$, where $K$…

数论 · 数学 2018-07-02 Dominik Burek , Błażej Żmija

Here, we show that there is no positive integer $n$ such that the $n$th Cullen number $C_n=n2^n+1$ has the property that it is composite but $\phi(C_n)\mid C_n-1$.

数论 · 数学 2011-03-21 Jose Maria Grau , Florian Luca

We find a formula for the number of permutations of $[n]$ that have exactly $s$ runs up and down. The formula is at once terminating, asymptotic, and exact.

组合数学 · 数学 2007-05-23 E. Rodney Canfield , Herbert S. Wilf

It is known that the Scholz conjecture on addition chains is true for all integers $n$ with $\ell(2n) = \ell(n)+1$. There exists infinitely many integers with $\ell(2n) \leq \ell(n)$ and we don't know if the conjecture still holds for them.…

数论 · 数学 2022-10-26 Amadou Tall

Let $\alpha_1, \cdots, \alpha_d$ be real numbers, and let $S$ be the set of integers $s$ so that $||\alpha_i s||_{\mathbb{R}/\mathbb{Z}}>\delta$ for some $i$ and some fixed $\delta>0$. We prove $S$ is not \enquote{$2$-large}, i.e. there is…

组合数学 · 数学 2025-12-25 Ryan Alweiss

It is sufficient to prove that there is an excess of prime factors in the product of repunits with odd prime bases defined by the sum of divisors of the integer $N=(4k+1)^{4m+1}\prod_{i=1}^\ell ~ q_i^{2\alpha_i}$ to establish that there do…

高能物理 - 理论 · 物理学 2008-06-02 Simon Davis

Given $k, \ell \in {\bf N}^+$, let $x_{i,j}$ be, for $1 \le i \le k$ and $0 \le j \le \ell$, some fixed integers, and define, for every $n \in {\bf N}^+$, $s_n := \sum_{i=1}^k \prod_{j=0}^\ell x_{i,j}^{n^j}$. We prove that the following are…

数论 · 数学 2018-05-15 Paolo Leonetti , Salvatore Tringali

Recently, the authors showed that for every irrational number $\alpha$, there exist infinitely many positive integers $n$ represented by any given positive definite binary quadratic form $Q$, satisfying $||\alpha n||<n^{-(1/2-\varepsilon)}$…

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

Suppose that $(U_{n})_{n \geq 0}$ is a binary recurrence sequence and has a dominant root $\alpha$ with $\alpha>1$ and the discriminant $D$ is square-free. In this paper, we study the Diophantine equation $U_n + U_m = x^q$ in integers $n…

数论 · 数学 2024-07-29 P. K. Bhoi , S. S. Rout , G. K. Panda
‹ 上一页 1 2 3 10 下一页 ›