Results 31 to 40 of about 7,411,029 (61)
New primality criteria and factorizations of 2^{𝑚}±1
, 1975 A collection of theorems is developed for testing a given integer N for primality. The first type of theorem considered is based on the converse of Fermat’s theorem and uses factors of N − 1 N - 1 .
J. L. Selfridge +2 more
core +1 more source
Prime numbers and primality test
, 2018 Orientador: Ricardo Miranda MartinsDissertação (mestrado profissional) - Universidade Estadual de Campinas, Instituto de Matemática, Estatística e Computação CientíficaResumo: Nesta dissertação estudamos números inteiros, suas propriedades e congruências.
Paiva, Glaucia Innocencio de Jesus Paulo, 1985-
core
Probable prime tests for generalized mersenne numbers
, 2008 The classical Lucas-Lehmer test gives necessary and sufficient conditions for the primality of 2 p -1, p an odd prime. Such primes are called Mersenne primes.
Melham, RS
core
Mersenne primes and the proof of the Lucas-Lehmer test
V magistrskem delu so obravnavana Mersennova praštevila in Lucas-Lehmerjev test. Mersennova praštevila, ki so oblike 2^p-1, kjer je p praštevilo, so tudi največja znana praštevila. Njihovo praštevilskost preverjamo z Lucas-Lehmerjevim testom, ki je podan
Zupančič, Andrej
core
ANALISIS PERBANDINGAN TEOREMA LUCAS-LEHMER DAN TEOREMA POCKLINGTON DALAM UJI PRIMALITAS [PDF]
, 2006 ANALISIS PERBANDINGAN TEOREMA LUCAS-LEHMER DAN TEOREMA POCKLINGTON DALAM UJI ...
SWANDANA, KELLY
core
A Formalisation of Lehmer’s Primality Criterion
, 2014 In 1927, Lehmer presented criterions for primality, based on the converse of Fermat’s litte theorem [2]. This work formalizes the second criterion from Lehmer’s paper, a necessary and sufficient condition for primality.
Lars Noschinski, Simon Wimmer
core
Some Primality Tests Constructed from a Cubic Extension of the Lucas Functions
, 2020 The properties of a pair of integer valued sequences, similar to those of Lucas, are used to produce a sufficiency test for the primality of numbers $N$ such that $N^2 + N + 1$ is divisible by a large power of a prime p.Non UBCUnreviewedAuthor ...
Roettger, Eric
core +1 more source
Determination of the primality of 𝑁 by using factors of 𝑁²±1
, 1976 Algorithms are developed which can be used to determine the primality of a large integer N when a sufficient number of prime factors of N 2 + 1 {N^2} + 1 are known. A
J. S. Judd, H. C. Williams
core +1 more source
The class of Lucas-Lehmer polynomials [PDF]
, 2016 In this paper we introduce a new sequence of polynomials, which follow the same recursive rule of the well-known Lucas-Lehmer integer sequence. We show the most important properties of this sequence, relating them to the Chebyshev plynomials of the first
BERSANI, Alberto Maria +2 more
core
, 2013 Security of a written message from one person to another during communication is important. It takes an application to secure the contents of the message to be sent. The main objective of this study is to build an applications that can sent plaintexts.
Wijayanti, Ratnaningtyas Yoga
core