En poursuivant votre navigation sur ce site, vous acceptez l'utilisation d'un simple cookie d'identification. Aucune autre exploitation n'est faite de ce cookie. OK

Documents 11Y50 2 résultats

Filtrer
Sélectionner : Tous / Aucun
Q
Déposez votre fichier ici pour le déplacer vers cet enregistrement.
y

$D(n)$-sets with square elements - Dujella, Andrej (Auteur de la conférence) | CIRM H

Virtualconference

For an integer n, a set of distinct nonzero integers $\left \{ a_{1},a_{2},...a_{m} \right \}$ such that $a_{i}a_{j}+n$ is a perfect square for all 1 ≤ i < j ≤ m, is called a Diophantine m-tuple with the property $D(n)$ or simply a $D(n)$-set. $D(1)$-sets are known as Diophantine m-tuples. When considering $D(n)$-sets, usually an integer n is fixed in advance. However, we may ask if a set can have the property $D(n)$ for several different n's. For example, {8, 21, 55} is a $D(1)$-triple and $D(4321)$-triple. In a joint work with Adzaga, Kreso and Tadic, we presented several families of Diophantine triples which are $D(n)$-sets for two distinct n's with $n\neq 1$. In a joint work with Petricevic we proved that there are infinitely many (essentially different) quadruples which are simultaneously $D(n_{1})$-quadruples and $D(n_{2})$-quadruples with $n_{1}\neq n_{2}$. Morever, the elements in some of these quadruples are squares, so they are also $D(0)$-quadruples. E.g. $\left \{ 54^{2}, 100^{2}, 168^{2}, 364^{2}\right \} $ is a $D(8190^{2})$, $D(40320^{2})$ and $D(0)$-quadruple. In this talk, we will describe methods used in constructions of mentioned triples and quadruples. We will also mention a work in progress with Kazalicki and Petricevic on $D(n)$-quintuples with square elements (so they are also $D(0)$-quintuples). There are infinitely many such quintuples. One example is a $D(4804802)$-quintuple $\left \{ 225^{2}, 286^{2}, 819^{2}, 1408^{2}, 2548^{2}\right \}$.[-]
For an integer n, a set of distinct nonzero integers $\left \{ a_{1},a_{2},...a_{m} \right \}$ such that $a_{i}a_{j}+n$ is a perfect square for all 1 ≤ i < j ≤ m, is called a Diophantine m-tuple with the property $D(n)$ or simply a $D(n)$-set. $D(1)$-sets are known as Diophantine m-tuples. When considering $D(n)$-sets, usually an integer n is fixed in advance. However, we may ask if a set can have the property $D(n)$ for several different n's. ...[+]

11D09 ; 11G05 ; 11Y50

Sélection Signaler une erreur
Déposez votre fichier ici pour le déplacer vers cet enregistrement.
y

On S-Diophantine Tuples - Ziegler, Volker (Auteur de la conférence) | CIRM H

Virtualconference

Given a finite set of primes $S$ and a m-tuple $(a_{1},...,a_{m})$ of positive, distinct integers we call the m-tuple $S$-Diophantine, if for each 1 ≤ i < j ≤ m the quantity $a_{i}a_{j}+1$ has prime divisors coming only from the set $S$. In this talk we discuss the existence of m-tuples if the set of primes $S$ is small. We will discuss recent results concerning the case that $|S| = 2$ and $|S| = 3$.

11D61 ; 11Y50 ; 11A51

Sélection Signaler une erreur