Results 81 to 90 of about 385 (161)
Divisibility by 3 of even multiperfect numbers of abundancy 3 and 4
, 2010 We say a number is flat if it can be written as a non-trivial power of 2 times an odd squarefree number. The power is the “exponent” and the number of odd primes the “length”. Let N be flat and 4-perfect with exponent a and length m.
Broughan, Kevin A., Zhou, Qizhi
core
On prime factors of Mersenne numbers
, 2016 to appear in Palestine Journal of ...
Cambraia, Ady jun. +4 more
openaire +3 more sources
On inversion modulo pseudo-Mersenne primes [PDF]
, 2020 It is well established that the method of choice for implementing a side-channel secure modular inversion, is to use Fermat\u27s little theorem. So $1/x = x^{p-2} \bmod p$. This can be calculated using any multiply-and-square method safe in the knowledge
Michael Scott
core
High-Speed and Unified ECC Processor for Generic Weierstrass Curves over GF(p) on FPGA. [PDF]
Sensors (Basel), 2021 Awaludin AM, Larasati HT, Kim H.
europepmc +1 more source
Post-Quantum Security: Opportunities and Challenges. [PDF]
Sensors (Basel), 2023 Li S +7 more
europepmc +1 more source
Perfect and Mersenne Numbers [PDF]
, 2019 U ovom radu proučavamo Mersenneove i savršene brojeve. Kažemo da je prirodan broj N savršen ako je σ(N) = 2N, gdje je σ(N) suma pravih djelitelja broja N.
Patković, Kristina
core
Java Grid Computing or how to find large primes
, 2010 This Bachelor work contains methods of searching for Mersenne primes using Grid Computing technology. The goal of this work is to implement a network-based computing framework and an implementation of an algorithm for searching for large Mersenne ...
PAPEŽ, Petr
core
This paper tackles a longstanding problem in number theory: the existence of odd perfect numbers. A perfect number is defined as a positive integer whose sum of all its proper divisors (excluding itself) is equal to twice the number itself. While Euclid demonstrated a method to construct even perfect numbers using Mersenne primes (primes of the form $2^
openaire +1 more source
Teste de Lucas-Lehmer para primos de Mersenne
, 2022 The present work aims at a small summary of Mersenne's prime numbers and, consequently, prime numbers, a subject that has shown to have a certain relevance because of the increase in users of applications that use RSA encryption to protect their data ...
SANTOS, Elbi Jesus dos
core