Results of Brocard-Ramanujan problem on diophantine equation $n!+1=m^2$
The LNM Institute of Information Technology, Jaipur, India（LNM信息技术学院）；Department of Mathematics, Rajendra College(A Constituent Unit of Jai Prakash University), Chapra 841301, Bihar, India（Rajendra学院（Jai Prakash大学附属单位））；Department of Mathematical Sciences, Indian Institute of Technology (BHU)Varanasi 221005, India（印度理工学院瓦拉纳西分校数学科学系）
The Brocard-Ramanujan problem pertaining to the diophantine equation $n!+1=m^2$, a famously unsolved problem, deals with finding the integer solutions to the equation. Nobody has discovered any new solution of the problem beyond $n=4,~5$ and $7$ although many of us have tried it. Bruce Berndt and William Galway \cite{Berndt} had not found any new solution in 2000 by extensive computer search for a solution with $n$ up to $10^9$. The purpose of this study is to show that the solutions should satisfy some necessary and/or sufficient conditions. If $\sqrt{n!}=k+ε,~n>1,~0<ε<1$; then it has solution if and only if $n!=k(k+2)$ and $ε,~k$ are strictly monotonic increasing. It has only finitely many solutions which is not based on any conjecture or previous research on the Brocard-Ramanujan problem. For the new solution of Brocard-Ramanujan problem ($n\ge 10^5$), the value of $ε$ should be more than $0.999 \cdots 905915$ (digit 0 is coming after 228287 numbers of 9 digit, which takes more than 66 pages in (LibreOffice Writer) indicating almost impossibility of new solution. If we consider $n\geq 10^9$, I am unable to calculate the said numbers of 9 digit in the value of $ε$ in my personal laptop (with 8GB Ram) using MATHEMATICA 8. Finally, it has been claimed to discover that the problem has no further solution.
Let $\left\lbrace a_{n}\right\rbrace_{n\geq 0}$ be the Narayana Sequence defined by the recurence $a_{n}=a_{n-1}+a_{n-3}$ for all $n\geq 3$ with intital values $a_{0}=0$ and $a_{1}=a_{2}=1$. In This paper, we fully characterize the $3-$adic valuation of $a_{n}+1$ and $a_{n}-1$ and then we prove that there are no integer solutions $(u,m)$ to the Brocard-Ramanujan Equation $m!+1=u^2$ where $u$ is a Narayana number.
We explicitly solve the diophantine equations of the form $$ A_{n_1}A_{n_2}\cdots A_{n_k}\pm 1 = B_m^2 $$ where $(A_n)_{n\geq 0}$ and $(B_m)_{m\geq 0}$ are either the Fibonacci sequence or Lucas sequence. This extends the result of D. Marques (2011) and L. Szalay (2012) concerning a variant of Brocard-Ramanujan equation. This is a manuscript of the article published in Communications of the Korean Mathematical Society, 32(3) (2017), pp. 511-522
In this part we show that the diophantine equation $X^5+Y^5=\varepsilon^5(1-X^5Y^5)$, where $\varepsilon=\frac{-1+\sqrt{5}}{2}$, has solutions in specific abelian extensions of quadratic fields $K=\mathbb{Q}(\sqrt{-d})$ in which $-d \equiv \pm 1$ (mod $5$). The coordinates of these solutions are values of the Rogers-Ramanujan continued fraction $r(τ)$, and are shown to be periodic points of an algebraic function.
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…
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.
In Ramanujan's Lost Notebook there is an amazing identity that furnishes infinitely many "almost counterexamples" to the cubic Fermat's Last Theorem, with no indication whatsoever how he discovered it. In 1995, Michael Hirschhorn explained, in a brilliant way, how Ramanujan may have done it, based on a certain polynomial identity for a sum of four cubes. Much earlier, Eri Jabotinsky, in an article published in 1946 (in a mathematics journal for teenagers) explained how Ramanujan may have discovered these polynomial identities needed for Hirschhorn's approach. Here we combine these two brillian…
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\}$.
Let $τ(n)$ be the Ramanujan $τ$-function. We prove that for any integer $N$ the diophantine equation $$ \sum_{i=1}^{74000}τ(n_i)=N $$ has a solution in positive integers $n_1, n_2,..., n_{74000}$ satisfying the condition $$ \max_{1\le i\le 74000}n_i\ll |N|^{2/11}+1. $$ We also consider similar questions in the residue ring modulo a large prime $p.$
Let $b_3(n)$ be the number of $3$-regular partitions of $n$. Recently, W. J. Keith and F. Zanello discovered infinite families of Ramanujan type congruences modulo $2$ for $b_3(2n)$ involving every prime $p$ with $p \equiv 13, 17, 19, 23 \pmod {24}$, and O. X. M. Yao provided new infinite families of Ramanujan type congruences modulo $2$ for $b_3(2n)$ involving every prime $p\geqslant 5$. In this paper, we introduce new infinite Ramanujan type congruences modulo $2$ for $b_3(2n)$. They complement naturally the results of Keith-Zanello and Yao and involve primes in $\mathcal P=\{p \text{ prime …
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.
For a positive integer $t\geq 2$, let $b_{t}(n)$ denote the number of $t$-regular partitions of a nonnegative integer $n$. In a recent paper, Keith and Zanello investigated the parity of $b_{t}(n)$ when $t\leq 28$. They discovered new infinite families of Ramanujan type congruences modulo 2 for $b_{21}(n)$ involving every prime $p$ with $p\equiv 13, 17, 19, 23 \pmod{24}$. In this paper, we investigate the parity of $b_{21}(n)$ involving the primes $p$ with $p\equiv 1, 5, 7, 11 \pmod{24}$. We prove new infinite families of Ramanujan type congruences modulo 2 for $b_{21}(n)$ involving the odd pr…
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…
All the periodic points of a certain algebraic function related to the Rogers-Ramanujan continued fraction $r(τ)$ are determined. They turn out to be $0, \frac{-1 \pm \sqrt{5}}{2}$, and the conjugates over $\mathbb{Q}$ of the values $r(w_d/5)$, where $w_d$ is one of a specific set of algebraic integers, divisible by the square of a prime divisor of 5, in the field $K_d=\mathbb{Q}(\sqrt{-d})$, as $-d$ ranges over all negative quadratic discriminants for which $\left(\frac{-d}{5}\right) = +1$. This yields new insights on class numbers of orders in the fields $K_d$. Conjecture 1 of Part I is prov…
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…
