Let $D_{1}$, $D_{2}$ be coprime odd integers with min$(D_{1},D_{2})>1$, and let $N(D_{1},D_{2})$ denote the number of positive integer solutions $(x, m, n)$ of the equation $D_{1}x^2+D_{2}^{m}=2^{n+2}$. In this paper, we prove that $N(D_{1},D_{2})\leq 2$ except for $N(3,5)=N(5,3)=4$ and $N(13,3)=N(31,97)=3$.
The paper consists of two parts. The aim of the first, and main, part is to explain, in an elementary way, Hasse's proof of Ramanujan-Nagell's Theorem. In the second part, we formulate some natural extensions of Ramanujan-Nagell's equation.
The generalized Lebesgue-Ramanujan-Nagell equation is an important type of polynomial-exponential Diophantine equation in number theory. In this survey, the recent results and some unsolved problems of this equation are given.
We shall show that, for any positive integer $D>0$ and any primes $p_1, p_2$ not dividing $D$, the diophantine equation $x^2+D=2^s p_1^k p_2^l$ has at most $63$ integer solutions $(x, k, l, s)$ with $x, k, l\geq 0$ and $s\in \{0, 2\}$.
It is well-known that for $p=1, 2, 3, 7, 11, 19, 43, 67, 163$, the class number of $\mathbb{Q}(\sqrt{-p})$ is one. We use this fact to determine all the solutions of $x^2+p^m=4y^n$ in non-negative integers $x, y, m$ and $n$.
Let $k$ be a fixed positive integer with $k>1$. In this paper, using various elementary methods in number theory, we give criteria under which the equation $x^2+(2k-1)^y=k^z$ has no positive integer solutions $(x,y,z)$ with $y\in\{3,5\}$.
We describe a computationally efficient approach to resolving equations of the form $C_1x^2 + C_2 = y^n$ in coprime integers, for fixed values of $C_1$, $C_2$ subject to further conditions. We make use of a factorisation argument and the Primitive Divisor Theorem due to Bilu, Hanrot and Voutier.
We completely solve the Diophantine equation $x^2+2^k11^\ell19^m=y^n$ in integers $x,y\geq 1;~ k,\ell, m\geq 0~$ and $n\geq 3$ with $\gcd(x,y)=1$, except the case $2\mid k, 2\nmid \ell m$ and $5\mid n$. We use this result to recover some earlier results in the same direction.
Let $k$ be a positive integer. In this paper, using the modular approach, we prove that if $k\equiv 0 \pmod{4}$, $30< k<724$ and $2k-1$ is an odd prime power, then under the GRH, the equation $x^2+(2k-1)^y=k^z$ has only one positive integer solution $(x,y,z)=(k-1,1,2)$. The above results solve some difficult cases of Terai's conecture concerning this equation.
Stiller proved that the Diophantine equation $x^2+119=15\cdot 2^{n}$ has exactly six solutions in positive integers. Motivated by this result we are interested in constructions of Diophantine equations of Ramanujan-Nagell type $x^2=Ak^{n}+B$ with many solutions. Here, $A,B\in\Z$ (thus $A, B$ are not necessarily positive) and $k\in\Z_{\geq 2}$ are given integers. In particular, we prove that for each $k$ there exists an infinite set $\cal{S}$ containing pairs of integers $(A, B)$ such that for each $(A,B)\in \cal{S}$ we have $\gcd(A,B)$ is square-free and the Diophantine equation $x^2=Ak^n+B$ h…
In the first part we construct algorithms which we apply to solve S-unit, Mordell, cubic Thue, cubic Thue-Mahler and generalized Ramanujan-Nagell equations. As a byproduct we obtain alternative practical approaches for various classical Diophantine problems, including the fundamental problem of finding all elliptic curves over Q with good reduction outside a given finite set of rational primes. To illustrate the utility of our algorithms we determined the solutions of large classes of equations, containing many examples of interest which are out of reach for the known methods. In addition we u…
In this paper, we study the generalized Lebesgue-Nagell equation \[ x^2+7^{2k+1}=y^n. \] This is the last case of equations of the form $x^2+q^{2k+1}=y^n$ with $k\geq0$ and $q>0$ where $\mathbb{Q}(\sqrt{-q})$ has class number one. Our proof is based on the modular method and the symplectic argument.
We consider a natural generalization of the Nagell-Ljunggren equation to the case where the qth power of an integer y, for q >= 2, has a base-b representation that consists of a length-l block of digits repeated n times, where n >= 2. Assuming the abc conjecture of Masser and Oesterlé, we completely characterize those triples (q, n, l) for which there are infinitely many solutions b. In all cases predicted by the abc conjecture, we are able (without any assumptions) to prove there are indeed infinitely many solutions.
Ramanujan sums have been studied and generalized by several authors. For example, Nowak studied these sums over quadratic number fields, and Grytczuk defined that on semigroups. In this note, we deduce some properties on sums of generalized Ramanujan sums and give examples on number fields. In particular, we have a relational expression between Ramanujan sums and residues of Dedekind zeta functions.
We derive certain identities involving various known arithmetical functions and a generalized version of Ramanujan sum. L. Toth constructed certain weighted averages of Ramanujan sums with various arithmetic functions as weights. We choose a generalization of Ramanujan sum given by E. Cohen and derive the weighted averages corresponding to the versions of the weighted averages established by Toth.
Explicit formulas involving a generalized Ramanujan sum are derived. An analogue of the prime number theorem is obtained and equivalences of the Riemann hypothesis are shown. Finally, explicit formulas of Bartz are generalized.
We prove a simple formula for the main value of $r$-even functions and give applications of it. Considering the generalized Ramanujan sums $c_A(n,r)$ involving regular systems $A$ of divisors we show that it is not possible to develop a Fourier theory with respect to $c_A(n,r)$, like in the the usual case of classical Ramanujan sums $c(n,r)$.
The aim of this paper is to study the convergence and divergence of the Rogers-Ramanujan and the generalized Rogers-Ramanujan continued fractions on the unit circle. We provide an example of an uncountable set of measure zero on which the Rogers-Ramanujan continued fraction $R(x)$ diverges and which enlarges a set previously found by Bowman and Mc Laughlin. We further study the generalized Rogers-Ramanujan continued fractions $R_a(x)$ for roots of unity $a$ and give explicit convergence and divergence conditions. As such, we extend some work of Huang towards a question originally investigated …
In this paper we establish several results concerning the generalized Ramanujan primes. For $n\in\mathbb{N}$ and $k \in \mathbb{R}_{> 1}$ we give estimates for the $n$th $k$-Ramanujan prime which lead both to generalizations and to improvements of the results presently in the literature. Moreover, we obtain results about the distribution of $k$-Ramanujan primes. In addition, we find explicit formulae for certain $n$th $k$-Ramanujan primes. As an application, we prove that a conjecture of Mitra, Paul and Sarkar concerning the number of primes in certain intervals holds for every sufficiently la…
Motivated by work of Chan, Chan, and Liu, we obtain a new general theorem which produces Ramanujan-Sato series for $1/π$. We then use it to construct explicit examples related to non-compact arithmetic triangle groups, as classified by Takeuchi. Some of our examples are new, and some reproduce existing examples.
In this article, we investigate the bound of the valency of the Cayley graphs of the generalized quaternion groups which guarantees to be Ramanujan. As is the cases of the cyclic and dihedral groups in our previous studies, we show that the determination of the bound in a special setting is related to the classical Hardy-Littlewood conjecture for primes represented by a quadratic polynomial.
Let $K$ be a number field, and $S$ a finite set of places in $K$ containing all infinite places. We present an implementation for solving the $S$-unit equation $x + y = 1$, $x,y \in\mathscr{O}_{K,S}^\times$ in the computer algebra package SageMath. This paper outlines the mathematical basis for the implementation. We discuss and reference the results of extensive computations, including exponent bounds for solutions in many fields of small degree for small sets $S$. As an application, we prove an asymptotic version of Fermat's Last Theorem for totally real cubic number fields with bounded disc…
Bruinier and Ono recently developed the theory of generalized Borcherds products, which uses coefficients of certain Maass forms as exponents in infinite product expansions of meromorphic modular forms. Using this, one can use classical results on congruences of modular forms to obtain congruences for Maass forms. In this note we work out the example of Ramanujan's mock theta functions f and ω in detail.
Consider the linear congruence equation $x_1+\ldots+x_k \equiv b\,(\text{mod } n)$ for $b,n\in\mathbb{Z}$. By $(a,b)_s$, we mean the largest $l^s\in\mathbb{N}$ which divides $a$ and $b$ simultaneously. For each $d_j|n$, define $\mathcal{C}_{j,s} = \{1\leq x\leq n^s | (x,n^s)_s = d^s_j\}$. Bibak et al. gave a formula using Ramanujan sums for the number of solutions of the above congruence equation with some gcd restrictions on $x_i$. We generalize their result with generalized gcd restrictions on $x_i$ by proving that for the above linear congruence, the number of solutions is $$\frac{1}{n^s}\s…
A comprehensive study of the generalized Lambert series $\displaystyle\sum_{n=1}^{\infty}\frac{n^{N-2h}\exp{(-an^{N}x)}}{1-\exp{(-n^{N}x)}}, 0<a\leq 1,\ x>0$, $N\in\mathbb{N}$ and $h\in\mathbb{Z}$, is undertaken. Two of the general transformations of this series that we obtain here lead to two-parameter generalizations of Ramanujan's famous formula for $ζ(2m+1)$, $m>0$ and the transformation formula for $\logη(z)$. Numerous important special cases of our transformations are derived. An identity relating $ζ(2N+1), ζ(4N+1),\cdots, ζ(2Nm+1)$ is obtained for $N$ odd and $m\in\mathbb{N}$. Certain t…
Asymptotic expansions for a class of generalized holomorphic Eisenstein series, Ramanujan's formula for $ζ(2k+1)$, Weierstrass' elliptic and allied functions
In 1845, Bertrand conjectured that for all integers $x\ge2$, there exists at least one prime in $(x/2, x]$. This was proved by Chebyshev in 1860, and then generalized by Ramanujan in 1919. He showed that for any $n\ge1$, there is a (smallest) prime $R_n$ such that $π(x)- π(x/2) \ge n$ for all $x \ge R_n$. In 2009 Sondow called $R_n$ the $n$th Ramanujan prime and proved the asymptotic behavior $R_n \sim p_{2n}$ (where $p_m$ is the $m$th prime). In the present paper, we generalize the interval of interest by introducing a parameter $c \in (0,1)$ and defining the $n$th $c$-Ramanujan prime as the …
Let $K$ be a number field. This paper considers arithmetic functions over $K$, that are, complex valued functions on the set of nonzero integral ideals in $K$. Firstly we generalize some basic results on arithmetic functions. Next we define the generalized Ramanujan sums over $K$ and show some properties.
A Generalized Closed Form of Ramanujan-Type Fourier Cosine Transform via Meijer's G-Function
Department of Mathematics and Statistics, Govt Degree College Sopore, Jammu and Kashmir Higher Education Department, India(印度查谟和克什米尔高等教育部索波政府学位学院数学与统计系);Division of Computing and Mathematics, Abertay University, Dundee DD1 1HG, UK(英国邓迪阿伯泰大学计算与数学系)
In this paper, transformation formulas for a large class of Eisenstein series defined by \[ G(z,s;A_α,B_β;r_{1},r_{2})=\sum\limits_{m,n=-\infty}^{\infty }\ \hspace{-0.19in}^{^{\prime}}\frac{f(αm)f^{\ast}(βn)} {((m+r_{1})z+n+r_{2})^{s}},\text{ }\operatorname{Re}(s)>2,\text{ }\operatorname{Im}(z)>0 \] are investigated for $s=1-r$, $r\in\mathbb{N}$. Here $\left\{ f(n)\right\}$ and $\left\{ f^{\ast}(n)\right\}$, $-\infty<n<\infty$ are sequences of complex numbers with period $k>0$, and $A_α=\left\{ f(αn)\right\} $ and $B_β=\left\{ f^{\ast}(βn)\right\}$, $α,β\in\mathbb{Z}$. Appearing in the transfo…
The purpose of this paper is to show that under a part of generalized Arthur's A-packet conjecture, locally generic cuspidal automorphic representations of a quasisplit group over a number field are of Ramanujan type, i.e., are tempered at almost all places. The A-packet conjecture allows one to reduce the problem to a special case of a general local question about the components of the corresponding Langlands L-packet which is then answered here in its generality.
We study the quotient of hypergeometric functions \begin{equation*} μ_{a}^*(r)=\fracπ{2\sin{(πa)}}\frac{F(a,1-a;1;1-r^3)}{F(a,1-a;1;r^3)} \quad (r\in(0,1)) \end{equation*} in the theory of Ramanujan's generalized modular equation for $a\in(0,1/2]$, find an infinite product formula for $μ_{1/3}^*(r)$ by use of the properties of $μ_{a}^*(r)$ and Ramanujan's cubic transformation. Besides, a new cubic transformation formula of hypergeometric function is given, which complements the Ramanujan's cubic transformation.
We generalize recent matrix-based factorization theorems for Lambert series generating functions generating the coefficients $(f \ast 1)(n)$ for some arithmetic function $f$. Our new factorization theorems provide analogs to these established expansions generating sums of the form $\sum_{d: (d,n)=1} f(d)$ (type I) and the Anderson-Apostol sums $\sum_{d|(m,n)} f(d) g(n/d)$ (type II) for any arithmetic functions $f$ and $g$. Our treatment of the type II sums includes a matrix-based factorization method relating the partition function $p(n)$ to arbitrary arithmetic functions $f$. We also conclude…
We derive the asymptotic formula for $p_n(N,M)$, the number of partitions of integer $n$ with part size at most $N$ and length at most $M$. We consider both $N$ and $M$ are comparable to $\sqrt{n}$. This is an extension of the classical Hardy-Ramanujan formula and Szekeres' formula. The proof relies on the saddle point method.
Page 332 of Ramanujan's Lost Notebook contains a compelling identity for $ζ(1/2)$, which has been studied by many mathematicians over the years. On the same page, Ramanujan also recorded the series, \begin{align*} \frac{1^r}{\exp(1^s x) - 1} + \frac{2^r}{\exp(2^s x) - 1} + \frac{3^r}{\exp(3^s x) - 1} + \cdots, \end{align*} where $s$ is a positive integer and $r-s$ is any even integer. Unfortunately, Ramanujan doesn't give any formula for it. This series was rediscovered by Kanemitsu, Tanigawa, and Yoshimoto, although they studied it only when $r-s$ is a negative even integer. Recently, Dixit a…
Using Pascal triangle, we give a simple generalization to the so-called STRAND Puzzle solved by Srinivasa Ramanujan. Thus we are interested in computing the median, first and third quartiles of some integer valued distributions, arising naturally when extending partial sums of the arithmetic progression (triangular numbers) to tetrahedral numbers and beyond. We show this reduces to equations of Pell-Fermat type of higher order, which admit very few integer solutions, but for which, following Ramanujan's original idea, we can always find integer sequences of best approximation, in the Diophanti…
In a recent paper, Griffin, Ono and Warnaar present a framework for Rogers-Ramanujan type identities using Hall-Littlewood polynomials to arrive at expressions of the form \[\sum_{λ: λ_1 \leq m} q^{a|λ|}P_{2λ}(1,q,q^2,\ldots ; q^{n}) = \text{"Infinite product modular function"}\] for $a = 1,2$ and any positive integers $m$ and $n$. A recent paper of Rains and Warnaar presents further Rogers-Ramanujan type identities involving sums of terms $q^{|λ|/2}P_λ(1,q,q^2,\ldots;q^n)$. It is natural to attempt to reformulate these various identities to match the well-known Andrews-Gordon identities they …
Ramanujan provided several results involving the modified Bessel function $K_z(x)$ in his Lost Notebook. One of them is the famous Ramanujan-Guinand formula, equivalent to the functional equation of the non-holomorphic Eiesenstien series on $SL_2(z)$. Recently, this formula was generalized by Dixit, Kesarwani, and Moll. In this article, we first obtain a generalization of a theorem of Watson and, as an application of it, give a new proof of the result of Dixit, Kesarwani, and Moll. Watson's theorem is also generalized in a different direction using ${}_μK_z(x,λ)$ which is itself a generalizati…
In this article, we obtain a transformation formula for the higher power of odd zeta values, which generalizes Ramanujan's formula for odd zeta values. We have also investigated many important applications, which in turn provide generalizations of the transformation formula of the Eisenstein series, Dedekind eta function etc.
We provide an historical account of equivalent conditions for the Riemann Hypothesis arising from the work of Ramanujan and, later, Guy Robin on generalized highly composite numbers. The first part of the paper is on the mathematical background of our subject. The second part is on its history, which includes several surprises.
In his 1984 AMS Memoir, George Andrews defined the family of $k$--colored generalized Frobenius partition functions. These are denoted by $cϕ_k(n)$ where $k\geq 1$ is the number of colors in question. In that Memoir, Andrews proved (among many other things) that, for all $n\geq 0,$ $cϕ_2(5n+3) \equiv 0\pmod{5}.$ Soon after, many authors proved congruence properties for various $k$--colored generalized Frobenius partition functions, typically with a small number of colors. Work on Ramanujan--like congruence properties satisfied by the functions $cϕ_k(n)$ continues, with recent works completed b…
A Ramanujan-type formula involving the squares of odd zeta values is obtained. The crucial part in obtaining such a result is to conceive the correct analogue of the Eisenstein series involved in Ramanujan's formula for $ζ(2m+1)$. The formula for $ζ^{2}(2m+1)$ is then generalized in two different directions, one, by considering the generalized divisor function $σ_z(n)$, and the other, by studying a more general analogue of the aforementioned Eisenstein series, consisting of one more parameter $N$. A number of important special cases are derived from the first generalization. For example, we ob…