mersenneforum.org  

Go Back   mersenneforum.org > Great Internet Mersenne Prime Search > Math

Reply
 
Thread Tools
Old 2019-07-31, 05:13   #1
SELROC
 

27·71 Posts
Default Conference paper: On the Combined Fermat/Lucas Probable Prime Test

I am carrying out my research for optimized software, and all the papers I find on the subject.


I hope to find who is serious enough to look at the content and substance and not at the mere form of message.


So here's the Paper link from ResearchGate


https://www.researchgate.net/publica...ble_Prime_Test


This possibility to make a program that can compute both Mersenne and Fermat numbers.


Abstract

Based on the well-known Baillie/Wagstaff suggestion [R. Baillie and S. Wagstaff jun., Math. Comput. 35, 1391-1417 (1980; Zbl 0458.10003)] we introduce a rapid pseudoprimality test with high confidence. The test is extremely fast and only requires evaluation of power polynomials and the Lucas V-sequence. This is in contrast to the original version, where usually the more cumbersome evaluation of the Lucas U-sequence is required as well. We analyze the underlying properties of the proposed test and give a characterization of the pseudoprimes. Software and hardware evaluation methods for both modular exponentiation and evaluation of recursion sequences are widely employed and very efficient. Therefore the test can be run at low cost for varieties of different bases/parameters. The number of those that pass the test are of great interest. We exhibit the exact number of these “liars”.

Last fiddled with by SELROC on 2019-07-31 at 05:18
  Reply With Quote
Old 2019-07-31, 09:54   #2
paulunderwood
 
paulunderwood's Avatar
 
Sep 2002
Database er0rr

7·523 Posts
Default

Quote:
Originally Posted by SELROC View Post
This possibility to make a program that can compute both Mersenne and Fermat numbers.
Pepin's test for Fermat numbers and LL/3-PRP tests for Mersenne numbers all have a running time of 1 selfridge. BPSW is 1+3 selfridges and some variants are 1+2 and my own is 2.5. BPSW will not improve on the LL test nor on Pepin's test.

Last fiddled with by paulunderwood on 2019-07-31 at 21:00
paulunderwood is online now   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Hi, how can I test my probable prime number? mohdosa Information & Answers 22 2014-10-10 11:34
Question on Lucas Lehmer variant (probably a faster prime test) MrRepunit Math 9 2012-05-10 03:50
Miller-Rabin Strong Probable Prime Test (SPRP) fenderbender Miscellaneous Math 22 2010-11-11 01:04
Lucas test for billion bit prime MESCALINE1968 Lone Mersenne Hunters 2 2005-06-06 22:06
about Lucas-Lehmer test and Prime 95 Annunaki Math 22 2003-08-05 21:52

All times are UTC. The time now is 19:39.

Thu May 6 19:39:13 UTC 2021 up 28 days, 14:20, 0 users, load averages: 1.74, 1.89, 2.00

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.