| Peer-Reviewed

Algorithm of Search of Large Prime Numbers

Received: 3 December 2016     Accepted: 22 December 2016     Published: 17 January 2017
Views:       Downloads:
Abstract

The large number of problems in the theory of the numbers possessing one characteristic sign called by us binary mathematical statements from the natural parameter which in the time of Pythagoras and Euclid still aren’t solved was prompted to us that the reason of such situation should be looked for in the mathematics bases. We have entered concept of the binary mathematical statement depending from natural parameter and have specified axiomatic of natural numbers of Peano, having added one axiom called by us the axiom of descent which is interpretation of a so-called method of descent of Fermat by means of which he has proved the Great Hypothesis for a special case of n=4. By means of a descent axiom we managed to receive a large number of the results published in Russian. Wishing to expand a readership, we have decided to give the review of our results which are already published in Russian without proofs and to add new results among which the algorithm of search of large prime numbers is dominating with proofs.

Published in International Journal of Discrete Mathematics (Volume 1, Issue 1)
DOI 10.11648/j.dmath.20160101.15
Page(s) 30-32
Creative Commons

This is an Open Access article, distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution and reproduction in any medium or format, provided the original work is properly cited.

Copyright

Copyright © The Author(s), 2017. Published by Science Publishing Group

Keywords

Binary Mathematical Problem, Axiom of Descent, Algebraic Equation, Diophantine Equation

References
[1] Kochkarev B. S. Ob odnom klasse algebraicheskikh uravnenii, ne imejutchikh ratsionalnykh reshenii. Problems of modern science and education. 2014. 4 (22), s. 9-11 (in Russian).
[2] Kochkarev B. S. Ob odnom svoistve naturalnykh chisel. Problems of modern science and education. 2014. 7 (25), s. 6-7 (in Russian).
[3] Kochkarev B. S. Svedenie odnogo Diophantova uravnenija k klassu algebraicheskikh uravnenii ot dvukh naturalnykh parametrov. Problems of modern science and education. 2015. 7 (37), s. 6-7 (in Russian).
[4] Kochkarev B. S. K metodu spuska Ferma. Problems of modern science and education. 2015. 11 (41), s. 7-10 (in Russian).
[5] Kochkarev B. S. Problema bliznetsov i drugie binarnye problem. Problems of modern science and education 2015. 11 (41), s. 10-12 (in Russian).
[6] Singkh S. Velikaya teorema Ferma. MTSNMO. 2000. s. 288.
[7] Samin D. K. Sto velikikh uchenykh. Moskow, “Veche”. 2001. S. 592 (in Russian).
[8] Bukhshtab A. A. Teoriya chisel. Moskow. Izd. “Prosvetchenie”. 1966, s. 384 (in Russian).
[9] Postnikov M. M. Vvedenie v teoriju algebraicheskikh chisel. Moskow, “Nauka” Glavnaya redaktsiya fiziko- matematicheskoy literatury, 1982. s. 240 (in Russian).
[10] Kochkarev B. S. About one binary problem in a class of algebraic equations and her communication with the Great Hypothesis of Fermat. International Journal of Current Multidisciplinary Studies. Vol. 2, Issue, 10, pp. 457-459, October, 2016.
[11] Wiles A. Modular elliptic curves and Fermat’s Last Theorem. Annals of Mathematics, v. 141 Second series 3 May 1995 pp. 445-551.
[12] Abrarov D. Teorema Ferma: fenomen dokazatelstva Uailsa. http: //polit.ru/article/2006/12/28/abrarov/.
[13] Kudryavtsev L. D. O matematike//Tezisy dokladov Mejdunarodnoi nauchno-obrazovatelnoi konferentsii 23-27 marta 2009 goda. Nauka v Vuzakh: matematika, fizika, informatika. Moskow, RUDN, 2008 (in Russian).
[14] Kochkarev B. S. Otlichitelnoe svoistvo naturalnykh chisel v razlichnykh geometriyakh. Problems of modern science and education 2015. 5 (35), s. 6-9 (in Russian).
[15] Laptev B. L. Nikolai Ivanovich Lobachevsky. Izd. Kazanskogo universiteta. 1976. s. 136 (in Russian).
Cite This Article
  • APA Style

    Kochkarev Bagram Sibgatullovich. (2017). Algorithm of Search of Large Prime Numbers. International Journal of Discrete Mathematics, 1(1), 30-32. https://doi.org/10.11648/j.dmath.20160101.15

    Copy | Download

    ACS Style

    Kochkarev Bagram Sibgatullovich. Algorithm of Search of Large Prime Numbers. Int. J. Discrete Math. 2017, 1(1), 30-32. doi: 10.11648/j.dmath.20160101.15

    Copy | Download

    AMA Style

    Kochkarev Bagram Sibgatullovich. Algorithm of Search of Large Prime Numbers. Int J Discrete Math. 2017;1(1):30-32. doi: 10.11648/j.dmath.20160101.15

    Copy | Download

  • @article{10.11648/j.dmath.20160101.15,
      author = {Kochkarev Bagram Sibgatullovich},
      title = {Algorithm of Search of Large Prime Numbers},
      journal = {International Journal of Discrete Mathematics},
      volume = {1},
      number = {1},
      pages = {30-32},
      doi = {10.11648/j.dmath.20160101.15},
      url = {https://doi.org/10.11648/j.dmath.20160101.15},
      eprint = {https://article.sciencepublishinggroup.com/pdf/10.11648.j.dmath.20160101.15},
      abstract = {The large number of problems in the theory of the numbers possessing one characteristic sign called by us binary mathematical statements from the natural parameter which in the time of Pythagoras and Euclid still aren’t solved was prompted to us that the reason of such situation should be looked for in the mathematics bases. We have entered concept of the binary mathematical statement depending from natural parameter and have specified axiomatic of natural numbers of Peano, having added one axiom called by us the axiom of descent which is interpretation of a so-called method of descent of Fermat by means of which he has proved the Great Hypothesis for a special case of n=4. By means of a descent axiom we managed to receive a large number of the results published in Russian. Wishing to expand a readership, we have decided to give the review of our results which are already published in Russian without proofs and to add new results among which the algorithm of search of large prime numbers is dominating with proofs.},
     year = {2017}
    }
    

    Copy | Download

  • TY  - JOUR
    T1  - Algorithm of Search of Large Prime Numbers
    AU  - Kochkarev Bagram Sibgatullovich
    Y1  - 2017/01/17
    PY  - 2017
    N1  - https://doi.org/10.11648/j.dmath.20160101.15
    DO  - 10.11648/j.dmath.20160101.15
    T2  - International Journal of Discrete Mathematics
    JF  - International Journal of Discrete Mathematics
    JO  - International Journal of Discrete Mathematics
    SP  - 30
    EP  - 32
    PB  - Science Publishing Group
    SN  - 2578-9252
    UR  - https://doi.org/10.11648/j.dmath.20160101.15
    AB  - The large number of problems in the theory of the numbers possessing one characteristic sign called by us binary mathematical statements from the natural parameter which in the time of Pythagoras and Euclid still aren’t solved was prompted to us that the reason of such situation should be looked for in the mathematics bases. We have entered concept of the binary mathematical statement depending from natural parameter and have specified axiomatic of natural numbers of Peano, having added one axiom called by us the axiom of descent which is interpretation of a so-called method of descent of Fermat by means of which he has proved the Great Hypothesis for a special case of n=4. By means of a descent axiom we managed to receive a large number of the results published in Russian. Wishing to expand a readership, we have decided to give the review of our results which are already published in Russian without proofs and to add new results among which the algorithm of search of large prime numbers is dominating with proofs.
    VL  - 1
    IS  - 1
    ER  - 

    Copy | Download

Author Information
  • Department of Mathematics and Mathematical Modeling, Institute of Mathematics and Mechanics Named After N. I. Lobachevsky, Kazan (Volga Region) Federal University, Kazan, Russia

  • Sections