Scientific and Technical Journal

ELECTROTECHNIC AND COMPUTER SYSTEMS

ISSN Print 2221-3937
ISSN Online 2221-3805
GENERALIZED ARTINA HYPOTHESIS AND COMPUTER INFORMATION MODEL ITS SOLUTIONS
Abstract:

In this paper, computer simulation methods are used to study the properties of primes as a dynamically developing system. It is shown that unsolved problems in the theory of numbers severely limit the further development of mathematical science in both theoretical and applied aspects. The foundations of experimental mathematics are formed as a tool for constructing information technologies in pure and applied number theory. On the basis of Artin's hypothesis, a generalized hypothesis is formed and shown as a means of non-linear dynamical processes to obtain a sufficiently accurate solution of it.

Authors:
Keywords
References
  1. Godel, K. (1989), Collected Works, Volume I, Oxford, New York.
  2. Rogers, H. (1987), “Theory of Recursive Functions and Effective Computability”, McGraw-Hill Book Company, New York.
  3. Manin, Y. and Panchishkin, A. (2009), “Introduction to the modern theory of numbers”, Moscow, MTSNMO, p 551.
  4. Crandall, R. and Pomerance, C. (2005), “Prime Numbers A Computational Perspective”, Portland, Springer, p. 664.
  5. Artin, E. (1982), “Collected papers”, Edited by Serge, Lang and T. John, Springer-Verlag, New York.
  6. Brudern, J., Godinho, H. (2002), “On Artin’s conjecture, II: pairs of additive forms”, Proc. London Math. Soc. (3). Vol. 84, N83. p. 513‒538.
  7. Karatsuba, A. (1975), “Foundations of analytic number theory”. Moscow: Nauka, p. 1‒182.
  8. Selvam, A. (2008), “Universal Characteristics of fractal fluctuation in prime number distributation”, [online] Available at: https://arxiv.org/abs/0811.1853 [Accessed 10 November 2018] .
  9. Cohen, H. (2007), “Number Theory Volume II: Analytic and Modern Tools”, Graduate Texts in mathematics. Vol. 240. Springer. Science, Business Media, L. L. C.
  10. Bateman, P., Harold Diamond, G. (2004), “Analytic Number Theory: An Introductory Course” World Scientific Publishing Co. Pic. Ltd.
  11. Bach, E. and Shallfit, J. (1997), “Algorithmic Number Theory, Volume 1: Efficient Algorithms”, MIT press.
  12. Ambrose, D. (2014), “On Artin’s Primitive Root Conjecture”, Dissertation zur Erlangung des mathematisch-naturwissenschaftlichen Doktorgrades “Doctor rerum naturalium” der Georg-August-Universit at Gottingen der Georg-August-Universitat Gottingen.
  13. Moree, P. (2012), “Artin’s Primitive root conjecture a survey”, Integres, 12, pp. 1305‒1416.
  14. Shuguang, Li, and Pomerance, C. (2001), “Primitive roots: a survey”, Lisuka, vol. 8 of Dev. Math. Klower Acod Publ. (2002), Dordercht, pp. 219‒231.
  15. Lenstra, H. W. (1977), Ir. “On Artin’s Conjecture and Euclid’s Algorithms in Global Fields”, Springer-Veriag, Inventiones math. 42, pp. 201‒224.
  16. Vostrov, G. and Opiata, R. (2018), “Computer modeling of dynamic processes in analytic number theory”, ELTECS No. 26.
  17. Caragiu, M. (2017), “Sequential Experiments with Primes”, Springer International Publishing AG.
  18. Bailey, D., Borwein, J. (2006), N. Calkin, R. Girgensohn,D. Russell Luke and V. Moll “Experimental Mathematics in Action”, A. K. Peters.
  19. Bailey David H., Borwein Jonathon M. (2016), A Computational Mathematics view of Space, Time and Complexity, CDMTCS, Research Report Series, Centre for Discrete Mathematics and Theoretical Computer scince.
  20. Borwein, J., Borwein, P. (2010), Experimental and ComputaHonal mathematics, Selected writing, PS press.
  21. Kowalski, E., Arithmetic Randonnee (2018), An introduction to probabilistic number theory, Version of June 4.
Published:
Last download:
22 Apr 2019

[ © KarelWintersky ] [ All articles ] [ All authors ]
[ © Odessa National Polytechnic University, 2014-2018. Any use of information from the site is possible only under the condition that the source link! ]