Zobrazeno 1 - 10
of 23
pro vyhledávání: '"Entiers friables"'
Autor:
Wang, Zhiwei
Dans cette thèse, on s'intéresse aux plus grands facteur premiers d'entiers consécutifs. Désignons par $P^+(n)$ (resp. $P^-(n)$) le plus grand (resp. plus petit) facteur premier d'un entier générique $n\geq 1$ avec la convention que $P^+(1)=1$
Externí odkaz:
http://www.theses.fr/2018LORR0022/document
Autor:
Sary Drappeau, Xuancheng Shao
Publikováno v:
Acta Arithmetica
Acta Arithmetica, 2016, 176, pp.249-299. ⟨10.4064/aa8448-7-2016⟩
Acta Arithmetica, Instytut Matematyczny PAN, 2016, 176, pp.249-299. ⟨10.4064/aa8448-7-2016⟩
Acta Arithmetica, 2016, 176, pp.249-299. ⟨10.4064/aa8448-7-2016⟩
Acta Arithmetica, Instytut Matematyczny PAN, 2016, 176, pp.249-299. ⟨10.4064/aa8448-7-2016⟩
In this paper we study Weyl sums over friable integers (more precisely $y$-friable integers up to $x$ when $y = (\log x)^C$ for a large constant $C$). In particular, we obtain an asymptotic formula for such Weyl sums in major arcs, nontrivial upper b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ac9555fb3914e92f61d0bacd10cb4f80
https://doi.org/10.4064/aa8448-7-2016
https://doi.org/10.4064/aa8448-7-2016
Autor:
Wang, Zhiwei
Publikováno v:
Théorie des nombres [math.NT]. Université de Lorraine, 2018. Français. ⟨NNT : 2018LORR0022⟩
In this thesis, we study the largest prime factors of consecutive integers. Denote by $P^+(n)$ (resp. $P^-(n)$) the largest (resp. the smallest) prime factors of the integer $n\geq 1$ with the convention $P^+(1)=1$ (resp. $P^-(1)=\infty$). In the fir
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::703a5bce1727d881af2bc9c888d89162
https://theses.hal.science/tel-01772251
https://theses.hal.science/tel-01772251
Autor:
Régis de la Bretèche, Gérald Tenenbaum
Publikováno v:
Compositio Mathematica
Compositio Mathematica, 2017, 153, pp.453-473. ⟨10.1112/S0010437X16007806⟩
Compositio Mathematica, Foundation Compositio Mathematica, 2017, 153, pp.453-473. ⟨10.1112/S0010437X16007806⟩
Compositio Mathematica, 2017, 153, pp.453-473. ⟨10.1112/S0010437X16007806⟩
Compositio Mathematica, Foundation Compositio Mathematica, 2017, 153, pp.453-473. ⟨10.1112/S0010437X16007806⟩
International audience; By a new approach starting with a residue computation we sharpen some of the known estimates for the counting function of friable integers. The gained accuracy reveals crucial for various applications, some of which concern fu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8b41f8b47144470f02bf2ab91c76078e
https://hal.science/hal-01348147
https://hal.science/hal-01348147
Autor:
Gérald Tenenbaum, Régis de la Bretèche
Publikováno v:
Journal of the London Mathematical Society
Journal of the London Mathematical Society, 2016, 93 (1), pp.175-193. ⟨10.1112/jlms/jdv051⟩
Journal of the London Mathematical Society, London Mathematical Society, 2016, 93 (1), pp.175-193. ⟨10.1112/jlms/jdv051⟩
Journal of the London Mathematical Society, 2016, 93 (1), pp.175-193. ⟨10.1112/jlms/jdv051⟩
Journal of the London Mathematical Society, London Mathematical Society, 2016, 93 (1), pp.175-193. ⟨10.1112/jlms/jdv051⟩
International audience; We obtain a new form, uniform with respect to all parameters, of the friable (i.e. relevant to integers free of large prime factors) Turán-Kubilius inequality, comparing the empirical variance of an additive arithmetical func
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d8ea6165dc5d29baf303d758f10ba92a
https://hal.science/hal-01281714/file/TK6.pdf
https://hal.science/hal-01281714/file/TK6.pdf
Autor:
Basquin, Joseph
Ce travail est consacré à l'étude de trois problèmes liés à l'évaluation de sommes de fonctions multiplicatives sur les entiers friables. On dit qu'un nombre entier n est y-friable si son plus grand facteur premier P(n) n'excède pas y. Dans u
Externí odkaz:
http://www.theses.fr/2012LORR0148/document
Autor:
Basquin, Joseph
Publikováno v:
Mathématiques générales [math.GM]. Université de Lorraine, 2012. Français. ⟨NNT : 2012LORR0148⟩
This dissertation is devoted to studying three problems, all linked to estimates for sums of multiplicative functions over friable integers. An integer n is called y-friable if its largest prime factor P(n) does not exceed y. In a first part, we cons
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::6131f26d7778d86cf61737520fcf87cb
https://hal.univ-lorraine.fr/tel-01749344/document
https://hal.univ-lorraine.fr/tel-01749344/document
Autor:
Lachand, Armand
Un entier est dit y-friable si tous ses facteurs premiers n'excèdent pas y. Les valeurs friables de formes binaires interviennent de manière essentielle dans l'algorithme de factorisation du crible algébrique (NFS). Dans cette thèse, nous obtenon
Externí odkaz:
http://www.theses.fr/2014LORR0189/document
Autor:
Lachand, Armand
Publikováno v:
Théorie des nombres [math.NT]. Université de Lorraine, 2014. Français. ⟨NNT : 2014LORR0189⟩
An integer is called $y$-friable if its largest prime factor does not exceed $y$. Friable values of binary forms play a central role in the integer factoring algorithm NFS (Number Field Sieve). In this thesis, we obtain some asymptotic formulas for t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::c845741bacd2e612b21cafcf64f6c927
https://theses.hal.science/tel-01751134v2
https://theses.hal.science/tel-01751134v2
Autor:
Barbulescu, Razvan
Publikováno v:
Other [cs.OH]. Université de Lorraine, 2013. English. ⟨NNT : 2013LORR0183⟩
In this thesis we study at length the discrete logarithm problem in finite fields. In the first part, we focus on the notion of smoothness and on ECM, the fastest known smoothness test. We present an improvement to the algorithm by analyzing the Galo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::c86031b409e16e18d07f84af91b8e703
https://hal.univ-lorraine.fr/tel-01750438
https://hal.univ-lorraine.fr/tel-01750438