Related papers: Automatic Solving of Cubic Diophantine Equations I…
We formalise the undecidability of solvability of Diophantine equations, i.e. polynomial equations over natural numbers, in Coq's constructive type theory. To do so, we give the first full mechanisation of the…
The cutting plane approach to optimal matchings has been discussed by several authors over the past decades (e.g., Padberg and Rao '82, Grotschel and Holland '85, Lovasz and Plummer '86, Trick '87, Fischetti and Lodi '07) and its…
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…
We prove a number of new Rogers-Ramanujan type identities involving double, triple and quadruple sums. They were discovered after an extensive search using Maple. The main idea of proofs is to reduce them to some known identities in the…
Ramanujan stated an identity to the effect that if three sequences $\{a_n\}$, $\{b_n\}$ and $\{c_n\}$ are defined by $r_1(x)=:\sum_{n=0}^{\infty}a_nx^n$, $r_2(x)=:\sum_{n=0}^{\infty}b_nx^n$ and $r_3(x)=:\sum_{n=0}^{\infty}c_nx^n$ (here each…
We give solutions of a Diophantine equation containing factorials, which can be written as a cubic form, or as a sum of binomial coefficients. We also give some solutions to higher degree forms and relate some solutions to an unsolvable…
In this book a multitude of Diophantine equations and their partial or complete solutions are presented. How should we solve, for example, the equation {\eta}({\pi}(x)) = {\pi}({\eta}(x)), where {\eta} is the Smarandache function and {\pi}…
An identity by Ramanujan is expressed using polar coordinates, so that its proof reduces to the verification of an elementary trigonometric identity. This approach produces a few variations on Ramanujan's original identity.
Monograph "B. Grechuk, Polynomial Diophantine equations. A systematic approach" suggests solving Diophantine equations systematically in certain order. Many hundreds of the equations are left to the reader. Here, we provide complete…
We present the proof of Diophantus' 20th problem (book VI of Diophantus' Arithmetica), which consists in wondering if there exist right triangles whose sides may be measured as integers and whose surface may be a square. This problem was…
In this paper, first, we prove that the Diophantine system \[f(z)=f(x)+f(y)=f(u)-f(v)=f(p)f(q)\] has infinitely many integer solutions for $f(X)=X(X+a)$ with nonzero integers $a\equiv 0,1,4\pmod{5}$. Second, we show that the above…
This is an elementary explanation of a cubic composition formula due to Ramanujan.
This article describes the implementation in the software package NumGfun of classical algorithms that operate on solutions of linear differential equations or recurrence relations with polynomial coefficients, including what seems to be…
We give new nested radical equations of similar kind to Ramanujan's questions to the Indian Mathematical Society 100 years ago. While many have since considered these from the perspectives of the Notebooks of Ramanujan and from the theory…
In his solution of Hilbert's 17th problem Artin showed that any positive definite polynomial in several variables can be written as the quotient of two sums of squares. Later Reznick showed that the denominator in Artin's result can always…
Motivated by two identities published with Ramanujan's lost notebook and connected, respectively, with the Gauss circle problem and the Dirichlet divisor problem, in an earlier paper, three of the present authors derived representations for…
A perfect cuboid is a rectangular parallelepiped whose all linear extents are given by integer numbers, i. e. its edges, its face diagonals, and its space diagonal are of integer lengths. None of perfect cuboids is known thus far. Their…
A perfect cuboid is a rectangular parallelepiped whose edges, whose face diagonals, and whose space diagonal are of integer lengths. The problem of finding such cuboids or proving their non-existence is not solved thus far. The second…
We study a continued fraction due to Ramanujan, that he recorded as Entry 12 in Chapter 16 of his second notebook. It is presented in Part III of Berndt's volumes on Ramanujan's notebooks. We give two alternate approaches to proving…
We give a bijective proof of Macdonald's reduced word identity using pipe dreams and Little's bumping algorithm. This proof extends to a principal specialization due to Fomin and Stanley. Such a proof has been sought for over 20 years. Our…