Using.Liouville’s function for Creating a weird numbers from Reals
During 1937 Beurling Showed that any positive infinitely increasing real sequence such that the its first element precisely greater than one, called a Beurling’s primes. Furthermore, the series of Beurling integers (or generalized integers) can be constructed using the fundamental theorem of arithme...
Main Authors: | Nagham A. Hameed, Faez Al-Maamori |
---|---|
Format: | Article |
Language: | English |
Published: |
ATNAA
2024-01-01
|
Series: | Advances in the Theory of Nonlinear Analysis and its Applications |
Subjects: | |
Online Access: | https://atnaea.org/index.php/journal/article/view/288/246 |
Similar Items
-
Counting Functions to Generate The Primes in the RSA Algorithm and Diffie-Hellman Key Exchange
by: Faez Ali AL-Maamori, et al.
Published: (2018-04-01) -
Eigenvalues of Sturm-Liouville operators and prime numbers
by: Rauf Amirov, et al.
Published: (2017-02-01) -
A note on Sturm-Liouville problems whose spectrum is the set of prime numbers
by: Angelo B. Mingarelli
Published: (2011-09-01) -
The prime numbers and their distribution /
by: 376098 Tenenbaum, Gerald, et al.
Published: (2000) -
Prime numbers : a computational perspective /
by: Crandall, Richard E., 1947-, et al.
Published: (2005)