z-logo
Premium
Le problème de Tchébychev pour le douzième polynôme cyclotomique
Author(s) -
Dartyge Cécile
Publication year - 2015
Publication title -
proceedings of the london mathematical society
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.899
H-Index - 65
eISSN - 1460-244X
pISSN - 0024-6115
DOI - 10.1112/plms/pdv001
Subject(s) - mathematics , combinatorics , integer (computer science) , computer science , programming language
  LetP + ( n )denote the largest prime factor of the integer n andΦ 12 ( n ) = n 4 − n 2 + 1 . We prove that for X large enough we have: P + ( ∏ X < n ⩽ 2 XΦ 12 ( n ) ) ⩾ X 1 + c   w i t h   c = 10 − 26 531 .Résumé On noteP + ( n )le plus grand facteur premier de lʼentier n etΦ 12 ( n ) = n 4 − n 2 + 1 . Nous montrons pour X assez grand la minoration : P + ( ∏ X < n ⩽ 2 XΦ 12 ( n ) ) ⩾ X 1 + c   a v e c   c = 10 − 26 531 .

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here