Results 21 to 30 of about 12,813,623 (299)

ALTERNATIVE PROOF OF THE INFINITUDE PRIMES AND PRIME PROPERTIES

open access: yesBarekeng, 2023
Prime numbers is one of kind number that have many uses, one of which is cryptography. The uniqueness of prime numbers in their divisors and distributions causes prime numbers to be widely used in digital security systems. In number theory, one of famous
Dinni Rahma Oktaviani   +2 more
doaj   +1 more source

A new elementary proof of the Prime Number Theorem [PDF]

open access: yesBulletin of the London Mathematical Society, 2020
Let Ω(n) denote the number of prime factors of n . We show that for any bounded f:N→C one has 1N∑n=1Nf(Ω(n)+1)=1N∑n=1Nf(Ω(n))+oN→∞(1).This yields a new elementary proof of the Prime Number Theorem.
F. Richter
semanticscholar   +1 more source

Blockchain Security Mechanism Design Based on Chinese Cryptosystem SM2 Algorithm

open access: yesMathematics, 2023
The cryptographic system is the foundation of blockchain security mechanisms. This paper constructs a blockchain security mechanism based on the Chinese national cryptographic SM2 algorithm, involving the generation of public–private key pairs and the ...
Lu Meng, Zeyao Liu
doaj   +1 more source

On the number of edges of a graph and its complement [PDF]

open access: yesArab Journal of Mathematical Sciences, 2021
Let G=(V,E) be a graph. The complement of G is the graph G¯:=(V,[V]2 \ E) where [V]2 is the set of pairs {x,y} of distinct elements of V. If K is a subset of V, the restriction of G to K is the graph G↾K:=(K,[K]2∩E).
Jamel Dammak   +2 more
doaj   +1 more source

The error term in the prime number theorem [PDF]

open access: yesMathematics of Computation, 2018
We make explicit a theorem of Pintz concerning the error term in the prime number theorem. This gives an improved version of the prime number theorem with error term roughly square-root of that which was previously known. We apply this to a long-standing
David J. Platt, Timothy S. Trudgian
semanticscholar   +1 more source

Relation between Prime and Composite Number

open access: yesBibechana, 2018
This article was not peer-reviewed. No abstract available.
Raju Ram Thapa
doaj   +3 more sources

On the Universal Encoding Optimality of Primes

open access: yesMathematics, 2021
The factorial-additive optimality of primes, i.e., that the sum of prime factors is always minimum, implies that prime numbers are a solution to an integer linear programming (ILP) encoding optimization problem. The summative optimality of primes follows
Ioannis N. M. Papadakis
doaj   +1 more source

A conditional explicit result for the prime number theorem in short intervals [PDF]

open access: yesResearch in Number Theory, 2019
This paper gives an explicit bound for the prime number theorem in short intervals under the assumption of the Riemann hypothesis.
Michaela Cully-Hugill, Adrian W. Dudek
semanticscholar   +1 more source

On Prime Index of a Graph

open access: yesRatio Mathematica, 2023
In prime labeling, vertices are labeled from 1 to n, with the condition that any two adjacent vertices have relatively prime labels. Coprime labeling maintains the same criterion as prime labeling with adjacent vertices using any set of distinct positive
Janani R, Ramachandran T
doaj   +1 more source

Prime Slaughter: Playful Prime Numbers [PDF]

open access: yes, 2012
Starting from the difficulty of creating playful representation of domain-specific abstract concepts, this study discusses the design of Prime Slaughter, a computer game aimed at facilitating individual sense-making of abstract mathematical concepts. Specifically the game proposes a transposition of primality and factorization into playful interactions,
Valente, Andrea, Marchetti, Emanuela
openaire   +4 more sources

Home - About - Disclaimer - Privacy