Related papers: Integer and Rational Solutions to Polynomial Equat…
Let $C$ be a hyperelliptic curve given by the equation $y^2=f(x)$, where $f\in\Z[x]$ and $f$ hasn't multiple roots. We say that points $P_{i}=(x_{i}, y_{i})\in C(\Q)$ for $i=1,2,..., n$ are in arithmetic progression if the numbers $x_{i}$…
In this paper, we propose a numerical method for verifying the positiveness of solutions to semilinear elliptic equations. We provide a sufficient condition for a solution to an elliptic equation to be positive in the domain of the…
By using pairs of nontrivial rational solutions of congruent number equation $$ C_N:\;\;y^2=x^3-N^2x, $$ constructed are pairs of rational right (Pythagorean) triangles with one common side and the other sides equal to the sum and…
In this work, we consider the rational points on elliptic curves over finite fields F_{p}. We give results concerning the number of points on the elliptic curve y^2{\equiv}x^3+a^3(mod p)where p is a prime congruent to 1 modulo 6. Also some…
We solve the problem of characteristic numbers of elliptic curves in any dimensional projective space The answers are given in the form of effective recursions. Many numerical examples are provided. A C++ program implementing all the…
By the theory of elliptic curves, we study the nontrivial rational parametric solutions and rational solutions of the Diophantine equations $z^2=f(x)^2 \pm f(y)^2$ for some simple Laurent polynomials $f$.
Linear differential equations of arbitrary order with polynomial coefficients are considered. Specifically, necessary and sufficient conditions for the existence of polynomial solutions of a given degree are obtained for these equations. An…
In this paper, the proof of the existence of a rational point on an elliptic curve is transformed into the proof of the existence of an integer solution for a Diophantine equation. By a new formula for calculating the number of elements in…
By the theory of elliptic curves, we study the nontrivial rational parametric solutions and rational solutions of the Diophantine equations $z^2=f(x)^2 \pm g(y)^2$ for some simple Laurent polynomials $f$ and $g$.
Enge and Schertz gave the method of using the double eta-quotient for the construction of elliptic curves over finite fields. In their method, it is necessary to count the number of rational points of elliptic curves corresponding to…
In this paper we report on an application of computer algebra in which mathematical puzzles are generated of a type that had been widely used in mathematics contests by a large number of participants worldwide. The algorithmic aspect of our…
Orthogonal polynomials in two variables on cubic curves are considered, including the case of elliptic curves. For an integral with respect to an appropriate weight function defined on a cubic curve, an explicit basis of orthogonal…
Given an elliptic curve ${\mathcal E}$ over a field $K$ it is a challenging problem to write down explicit elements of its endomorphism ring ${\rm End}({\mathcal E});$ the problem amounts to find all possible solutions to a functional…
A rational perfect cuboid is a rectangular parallelepiped whose edges and face diagonals are given by rational numbers and whose space diagonal is equal to unity. Its existence is equivalent to the existence of a perfect cuboid with all…
Given $k \geq 2$, we show that there are at most finitely many rational numbers $x$ and $y \neq 0$ and integers $\ell \geq 2$ (with $(k,\ell) \neq (2,2)$) for which $$ x (x+1) \cdots (x+k-1) = y^\ell. $$ In particular, if we assume that…
In this paper we provide a computational approach to the shape of curves which are rational in polar coordinates, i.e. which are defined by means of a parametrization (r(t),\theta(t)) where both r(t),\theta(t) are rational functions. Our…
Consider an elliptic curve $\mathcal{C}$ with coefficients in $\mathbb{K}$ with $[\mathbb{K}:\mathbb{Q}]<\infty$ and $\delta \in \mathcal{C}(\mathbb{K})$ a non torsion point. We consider an elliptic difference equation $\sum_{i=0}^l a_i(p)…
We describe deterministic and probabilistic algorithms to determine whether or not a given monic irreducible polynomial H in Z[X] is a Hilbert class polynomial, and if so, which one. These algorithms can be used to determine whether a given…
We investigate the problem of deciding whether the restriction of a rational function $r\in\mathbb{K}(x,y)$ to the curve associated with an irreducible polynomial $p\in\mathbb{K}[x,y]$ is the restriction of an element of…
For a given elliptic curve, its associated $L$-function evaluated at $1$ is closely related to its real period. In this article, we generalize this principle to a rational curve. We count the rational points over all finite fields and use…