Results 241 to 250 of about 12,813,623 (299)
Some of the next articles are maybe not open access.
Integers, 2012
Abstract.We discuss a relative of the perfect numbers for which it is possible to prove that there are infinitely many examples. Call a natural numberasWe conclude by discussing some related problems posed by Harborth and Cohen.
Pollack, Paul, Pomerance, Carl
openaire +1 more source
Abstract.We discuss a relative of the perfect numbers for which it is possible to prove that there are infinitely many examples. Call a natural numberasWe conclude by discussing some related problems posed by Harborth and Cohen.
Pollack, Paul, Pomerance, Carl
openaire +1 more source
A public key cryptosystem using Affine Hill Cipher under modulation of prime number
Journal of Information and Optimization Sciences, 2019M.K. Viswanath in [1] proposed the concepts a public key cryptosystem using Hill’s Cipher. This paper develops a public key cryptosystem using Affine Hill Cipher.
P. Sundarayya, N. Raju, M. Prasad
semanticscholar +1 more source
Counting Homomorphisms Modulo a Prime Number
International Symposium on Mathematical Foundations of Computer Science, 2019Counting problems in general and counting graph homomorphisms in particular have numerous applications in combinatorics, computer science, statistical physics, and elsewhere.
A. Kazeminia, A. Bulatov
semanticscholar +1 more source
1999
Es handelt sich um einen Vortrag, den der Autor im Mai 1991 vor Studenten der ETH Zürich hielt. Ohne zahlentheoretische Kenntnisse vorauszusetzen, werden zentrale Fragestellungen der Primzahltheorie vorgestellt. Den Primzahlsatz, sowie die Vermutung über die Anzahl der Primzahlzwillinge bzw.
+5 more sources
Es handelt sich um einen Vortrag, den der Autor im Mai 1991 vor Studenten der ETH Zürich hielt. Ohne zahlentheoretische Kenntnisse vorauszusetzen, werden zentrale Fragestellungen der Primzahltheorie vorgestellt. Den Primzahlsatz, sowie die Vermutung über die Anzahl der Primzahlzwillinge bzw.
+5 more sources
Oscillations of the error term in the prime number theorem
Acta Mathematica Hungarica, 2018Let $${\sigma + i{\gamma}}$$σ+iγ be a zero of the Riemann zeta function to the right of the line $${\frac{1}{2} + it}$$12+it. We show that this zero causes large oscillations of the error term of the prime number theorem.
J. Schlage-Puchta
semanticscholar +1 more source
Extreme biases in prime number races with many contestants
Mathematische Annalen, 2017We continue to investigate the race between prime numbers in many residue classes modulo q, assuming the standard conjectures GRH and LI. We show that provided $$n/\log q \rightarrow \infty $$n/logq→∞ as $$q \rightarrow \infty $$q→∞, we can find n ...
Kevin Ford +2 more
semanticscholar +1 more source
The College Mathematics Journal, 1994
Elementary exposition of the author's well-known survey [see mainly his monograph ``The book of prime numbers'' (Springer 1988; Zbl 0642.10001)] which has been published in slightly different versions in several languages, too.
openaire +3 more sources
Elementary exposition of the author's well-known survey [see mainly his monograph ``The book of prime numbers'' (Springer 1988; Zbl 0642.10001)] which has been published in slightly different versions in several languages, too.
openaire +3 more sources
Distribution of the prime numbers
Bulletin of Applied Mathematics and Mathematics EducationThis research explores the distribution of prime numbers, which are a fundamental topic in number theory. The study originated from the author's fascination with mathematics and the desire to discover something novel.
Lolav Ahmed Khalil
semanticscholar +1 more source
Algebraic Number Theory and Fermat's Last Theorem
Algebraic Methods Algebraic Background Rings and Fields Factorization of Polynomials Field Extensions Symmetric Polynomials Modules Free Abelian Groups Algebraic Numbers Algebraic Numbers Conjugates and Discriminants Algebraic Integers Integral Bases ...
I. Stewart, D. Tall
semanticscholar +1 more source
2018
We denote by π(x) the number of prime numbers smaller than or equal to x, and decide that p will always denote a prime number.
openaire +1 more source
We denote by π(x) the number of prime numbers smaller than or equal to x, and decide that p will always denote a prime number.
openaire +1 more source

