The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Currently displaying 1 – 9 of 9

Showing per page

Order by Relevance | Title | Year of publication

Périodicité (mod q ) des suites elliptiques et points S -entiers sur les courbes elliptiques

Mohamed Ayad — 1993

Annales de l'institut Fourier

Soit E une courbe elliptique sur par un modèle de Weierstrass généralisé : y 2 + A 1 x y + A 3 y = x 3 + A 2 x 2 + A 4 x + A 6 ; A i . Soit M = ( a / d 2 , b / d 3 ) avec ( a , d ) = 1 , un point rationnel sur cette courbe. Pour tout entier m , on exprime les coordonnées de m M sous la forme : m M = φ m ( M ) ψ n 2 ( m ) , ω m ( M ) ψ m 3 ( M ) = φ ^ m d 2 ψ ^ m 2 , ω ^ m d 3 ψ ^ m 3 , φ m , ψ _ m , ω m [ A 1 , , A 6 , x , y ] et φ ^ m , ψ ^ m , ω ^ m sont déduits par multiplication par des puissances convenables de d . Soit p un nombre premier impair et supposons que M ( mod p ) est non singulier et que le rang d’apparition de p dans la suite d’entiers ( ψ ^ m ) est supérieur ou égal à trois....

Irreducibility of the iterates of a quadratic polynomial over a field

Mohamed AyadDonald L. McQuillan — 2000

Acta Arithmetica

1. Introduction. Let K be a field of characteristic p ≥ 0 and let f(X) be a polynomial of degree at least two with coefficients in K. We set f₁(X) = f(X) and define f r + 1 ( X ) = f ( f r ( X ) ) for all r ≥ 1. Following R. W. K. Odoni [7], we say that f is stable over K if f r ( X ) is irreducible over K for every r ≥ 1. In [6] the same author proved that the polynomial f(X) = X² - X + 1 is stable over ℚ. He wrote in [7] that the proof given there is quite difficult and it would be of interest to have an elementary proof. In the sequel...

Page 1

Download Results (CSV)