Diophantine m-tuples and elliptic curves Page 1 JOURNAL DE THÉORIE DES NOMBRES
DE BORDEAUX ANDREJ DUJELLA Diophantine m-tuples and elliptic curves Journal de …

Let C be a smooth genus one curve described by a quartic polynomial equation over the
rational field Q with P∈ C (Q). We give an explicit criterion for the divisibility-by-2 of a …

For a nonzero integer n, a set of m distinct nonzero integers {a_1, a_2, ..., a_m\} a 1, a 2,…,
am such that a_ia_j+ n aiaj+ n is a perfect square for all 1 ≤ i< j ≤ m 1≤ i< j≤ m, is called a …

Strong rational Diophantine D(q)-triples - ScienceDirect Skip to main contentSkip to article
Elsevier logo Journals & Books Search RegisterSign in View PDF Download full issue Search …

Let K be a number field and E be an elliptic curve described by the Weierstrass equation
over K. As a result of 2-descent Theorem on elliptic curves, a criterion for the divisibility-by-2 …

On Sequences of Matrix Strong Eulerian 2 -Tuples with Integer Coefficients Page 1 On
Sequences of Matrix Strong Eulerian 2 n+3 -Tuples with Integer Coefficients Joachim …

Klika je potpuno povezan podskup neusmjerenog grafa. Traženje najveće klike je NP-
problem (potrebno je eksponencijalno vrijeme da se problem riješi). Međutim, ako znamo da …

A clique is a fully connected subset of an undirected graph. Finding the largest clique is NP
complete problem (it takes exponential time to solve the problem). However, if we know that …

This book provides an overview of the main historical and recent results and problems
concerning Diophantine m-tuples and their various generalizations, with special emphasis …

For a nonzero integer n, a set of m distinct nonzero integers {a1, a2,..., am} such that aiaj+ n
is a perfect square for all 1≤ i< j≤ m, is called a D (n)-m-tuple. In this paper, we show that …