中文
相关论文

相关论文: Waring problem with the Ramanujan $\tau$-function

200 篇论文

We show how to determine the $k$-th bit of Chaitin's algorithmically random real number $\Omega$ by solving $k$ instances of the halting problem. From this we then reduce the problem of determining the $k$-th bit of $\Omega$ to determining…

数论 · 数学 2007-05-23 Toby Ord , Tien D. Kieu

Let $S := \{p_1,\ldots ,p_{\ell}\}$ be a finite set of primes and denote by $\mathcal{U}_S$ the set of all rational integers whose prime factors are all in $S$. Let $(U_n)_{n\geq 0}$ be a non-degenerate linear recurrence sequence with order…

数论 · 数学 2023-02-28 P. K. Bhoi , S. S. Rout , G. K. Panda

Ramanujan's Master theorem states that, under suitable conditions, the Mellin transform of a power series provides an interpolation formula for the coefficients of this series. Based on the duality of Riemannian symmetric spaces of compact…

表示论 · 数学 2012-03-14 Gestur Olafsson , Angela Pasquale

We establish a new multiplicity lemma for solutions of a differential system extending Ramanujan's classical differential relations. This result can be useful in the study of arithmetic properties of values of Riemann zeta function at odd…

数论 · 数学 2011-09-02 Evgeniy Zorin

We consider the equality of the values of the $n$th and $k$th elementary symmetric polynomials of $n$ not necessarily distinct positive integers. For $k < n$, we prove that this equation always has a solution, but only finitely many…

数论 · 数学 2026-01-21 Sándor Z. Kiss , Csaba Sándor , Maciej Zakarczemny

We deeply investigate the Diophantine equation $cx^2+d^{2m+1}=2y^n$ in integers $x, y\geq 1, m\geq 0$ and $n\geq 3$, where $c$ and $d$ are given coprime positive integers such that $cd\not\equiv 3 \pmod 4$. We first solve this equation for…

数论 · 数学 2023-06-01 Azizul Hoque

Let A(n) be a $k\times s$ matrix and $m(n)$ be a $k$ dimensional vector, where all entries of A(n) and $m(n)$ are integer-valued polynomials in $n$. Suppose that $$t(m(n)|A(n))=#\{x\in\mathbb{Z}_{+}^{s}\mid A(n)x=m(n)\}$$ is finite for each…

组合数学 · 数学 2007-10-02 Sheng Chen , Nan Li

Here, we find all positive integer solutions of the Diophantine equation in the title, where $(\mathcal{U}_n)_{n\geqslant 0}$ is the generalized Lucas sequence $\mathcal{U}_0=0, \ \mathcal{U}_1=1$ and $\mathcal{U}_{n+1}=r \mathcal{U}_n +s…

数论 · 数学 2023-06-08 P. Tiebekabe , I. Diouf , A. Tall , K. R. Kakanou

We generalize Ramanujan's expansions of the fractional-power Euler functions (q^{1/5})_{\infty} = [ J_1 - q^{1/5} + q^{2/5} J_2 ](q^5)_{\infty} and (q^{1/7})_{\infty} = [ J_1 + q^{1/7} J_2 - q^{2/7} + q^{5/7} J_3 ] (q^7)_{\infty} to…

数论 · 数学 2011-10-04 Jerome Malenfant

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

Let Q be an infinite set of positive integers. Denote by W_{\tau, n}(Q) (resp. W_{\tau, n}) the set of points in dimension n simultaneously \tau--approximable by infinitely many rationals with denominators in Q (resp. in N*). A non--trivial…

数论 · 数学 2014-01-14 Faustin Adiceam

Let $\mathbb{N}$ be the set of all nonnegative integers. For any positive integer $k$ and any subset $A$ of nonnegative integers, let $r_{1,k}(A,n)$ be the number of solutions $(a_1,a_2)$ to the equation $n=a_1+ka_2$. In 2016, Qu proved…

数论 · 数学 2023-09-12 Shi--Qiang Chen , Yuchen Ding , Xiaodong Lü , Yuhan Zhang

Let $1<c<\frac{26088036}{12301745},c\not=2$ and $N$ be a sufficiently large real number. In this paper, it is proved that, for almost all $R\in (N,2N]$, the Diophantine inequality \begin{equation*} \big|p_1^c+p_2^c+p_3^c-R\big|<\log^{-1}N…

数论 · 数学 2020-07-22 Yuetong Zhao , Jinjiang Li , Min Zhang

We apply a method of Davenport to improve several estimates for slim exceptional sets associated with the asymptotic formula in Waring's problem. In particular, we show that the anticipated asymptotic formula in Waring's problem for sums of…

数论 · 数学 2015-06-08 Koichi Kawada , Trevor D. Wooley

We study the Frobenius problem: given relatively prime positive integers $a_1,...,a_d$, find the largest value of t (the Frobenius number) such that $\sum_{k=1}^d m_k a_k = t$ has no solution in nonnegative integers $m_1,...,m_d$. Based on…

数论 · 数学 2007-05-23 Matthias Beck , David Einstein , Shelemyahu Zacks

In this paper, we use the method of Thue and Siegel, based on explicit Pade approximations to algebraic functions, to completely solve a family of quartic Thue equations. From this result, we can also solve the diophantine equation in the…

数论 · 数学 2018-07-12 Chen Jian Hua , Paul Voutier

In this paper we introduce a new diophantine inequality with prime numbers. Let $1<c<\frac{10}{9}$. We show that for any fixed $\theta>1$, every sufficiently large positive number $N$ and a small constant $\varepsilon>0$, the tangent…

数论 · 数学 2021-10-19 S. I. Dimitrov

Let $\mathbb{N}_0$ be a class of natural numbers whose binary expansions contain even numbers of ones. Waring problem in numbers of class $\mathbb{N}_0$ is solved.

数论 · 数学 2012-02-07 K. M. Eminyan

It is a popular paradoxical exercise to show that the infinite sum of positive integer numbers is equal to -1/12, sometimes called the Ramanujan sum. Here we propose a qualitative approach, much like that of a physicist, to show how the…

其他凝聚态物理 · 物理学 2025-09-11 Gilles Montambaux

Ramanujan's Master theorem states that, under suitable conditions, the Mellin transform of an alternating power series provides an interpolation formula for the coefficients of this series. Ramanujan applied this theorem to compute several…

经典分析与常微分方程 · 数学 2012-11-02 Gestur Olafsson , Angela Pasquale