Loading [MathJax]/jax/output/CommonHTML/jax.js
Matematicheskie Zametki
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Forthcoming papers
Archive
Impact factor
Guidelines for authors
License agreement
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Mat. Zametki:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Matematicheskie Zametki, 2006, Volume 80, Issue 6, Pages 920–925
DOI: https://doi.org/10.4213/mzm3367 (Mi mzm3367) 		 
This article is cited in 2 scientific papers (total in 2 papers)

Properties of large prime divisors of numbers of the form p−1

M. A. Cherepnev

M. V. Lomonosov Moscow State University, Faculty of Mechanics and Mathematics
Full-text PDF (362 kB) Citations (2)
References:
PDF
HTML
DOI: https://doi.org/10.4213/mzm3367
Abstract: The main result of this paper is the fact that the fraction of primes p⩽x satisfying the condition that p−1 has a prime divisor q>exp(lnx/lnlnx) and the number of prime divisors of q−1 essentially differ from lnln(x/n), where n=(p−1)/q, tends to zero as x increases.
Received: 29.03.2004
Revised: 04.05.2006
English version:
Mathematical Notes, 2006, Volume 80, Issue 6, Pages 863–867
DOI: https://doi.org/10.1007/s11006-006-0208-2
Bibliographic databases:
UDC: 511
Language: Russian
Citation: M. A. Cherepnev, “Properties of large prime divisors of numbers of the form p−1”, Mat. Zametki, 80:6 (2006), 920–925; Math. Notes, 80:6 (2006), 863–867
Citation in format AMSBIB
\Bibitem{Che06}
\by M.~A.~Cherepnev
\paper Properties of large prime divisors of numbers of the form $p-1$
\jour Mat. Zametki
\yr 2006
\vol 80
\issue 6
\pages 920--925
\mathnet{http://mi.mathnet.ru/mzm3367}
\crossref{https://doi.org/10.4213/mzm3367}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2311618}
\zmath{https://zbmath.org/?q=an:1135.11046}
\elib{https://elibrary.ru/item.asp?id=9429654}
\transl
\jour Math. Notes
\yr 2006
\vol 80
\issue 6
\pages 863--867
\crossref{https://doi.org/10.1007/s11006-006-0208-2}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000243368900027}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-33845606384}
Linking options:
  • https://www.mathnet.ru/eng/mzm3367
  • https://doi.org/10.4213/mzm3367
  • https://www.mathnet.ru/eng/mzm/v80/i6/p920
    • This publication is cited in the following 2 articles:
    1. Cherepniov M., “Comparison of the Complexity of Diffie-Hellman and Discrete Logarithm Problems”, J. Comput. Virol. Hacking Tech., 16:4 (2020), 265–268  crossref  isi
    2. Kevin Ford, Sergei V. Konyagin, Florian Luca, “Prime Chains and Pratt Trees”, Geom. Funct. Anal., 20:5 (2010), 1231  crossref
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Математические заметки Mathematical Notes
    Statistics & downloads:
    Abstract page:498
    Full-text PDF :276
    References:63
    First page:3
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025