mersenneforum.org  

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

Reply
 
Thread Tools
Old 2004-10-26, 21:37   #1
T.Rex
 
T.Rex's Avatar
 
Feb 2004
France

2·457 Posts
Default A primality test for Fermat numbers faster than Pépin's test ?

Hi,

I've published on my site the following paper:
"A primality test for Fermat numbers faster than Pépin's test ?
Conjecture and bits of history"

It is a kind of investigation about the history of Mathematics.

http://tony.reix.free.fr/Mersenne/Pr...matNumbers.pdf

It is the follow-up of a previous thread on this forum:
"I need a proof for this binomial property."

You are invited in providing comments and proposals in order to build a proof, leading to a 25 % faster test for Fermat numbers.

Regards,

Tony
T.Rex is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Pretty Fast Primality Test (for numbers = 3 mod 4) tapion64 Miscellaneous Math 40 2014-04-20 05:43
A (new) old, (faster) slower mersenne-(primality) PRP test boldi Miscellaneous Math 74 2014-04-17 07:16
Proof of Primality Test for Fermat Numbers princeps Math 15 2012-04-02 21:49
The fastest primality test for Fermat numbers. Arkadiusz Math 6 2011-04-05 19:39
Using Motorola 7410s to factor numbers or test for primality nukemyrman Hardware 7 2003-03-04 16:08

All times are UTC. The time now is 07:07.

Thu Nov 26 07:07:52 UTC 2020 up 77 days, 4:18, 3 users, load averages: 1.18, 1.44, 1.53

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, 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.