mersenneforum.org > Math A primality test for Fermat numbers faster than Pépin's test ?
 Register FAQ Search Today's Posts Mark Forums Read

 2004-10-26, 21:37 #1 T.Rex     Feb 2004 France 2×7×67 Posts 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

 Similar Threads Thread Thread Starter Forum Replies Last Post tapion64 Miscellaneous Math 40 2014-04-20 05:43 boldi Miscellaneous Math 74 2014-04-17 07:16 princeps Math 15 2012-04-02 21:49 Arkadiusz Math 6 2011-04-05 19:39 nukemyrman Hardware 7 2003-03-04 16:08

All times are UTC. The time now is 12:02.

Thu Jun 1 12:02:48 UTC 2023 up 287 days, 9:31, 0 users, load averages: 0.71, 0.75, 0.78

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.

≠ ± ∓ ÷ × · − √ ‰ ⊗ ⊕ ⊖ ⊘ ⊙ ≤ ≥ ≦ ≧ ≨ ≩ ≺ ≻ ≼ ≽ ⊏ ⊐ ⊑ ⊒ ² ³ °
∠ ∟ ° ≅ ~ ‖ ⟂ ⫛
≡ ≜ ≈ ∝ ∞ ≪ ≫ ⌊⌋ ⌈⌉ ∘ ∏ ∐ ∑ ∧ ∨ ∩ ∪ ⨀ ⊕ ⊗ 𝖕 𝖖 𝖗 ⊲ ⊳
∅ ∖ ∁ ↦ ↣ ∩ ∪ ⊆ ⊂ ⊄ ⊊ ⊇ ⊃ ⊅ ⊋ ⊖ ∈ ∉ ∋ ∌ ℕ ℤ ℚ ℝ ℂ ℵ ℶ ℷ ℸ 𝓟
¬ ∨ ∧ ⊕ → ← ⇒ ⇐ ⇔ ∀ ∃ ∄ ∴ ∵ ⊤ ⊥ ⊢ ⊨ ⫤ ⊣ … ⋯ ⋮ ⋰ ⋱
∫ ∬ ∭ ∮ ∯ ∰ ∇ ∆ δ ∂ ℱ ℒ ℓ
𝛢𝛼 𝛣𝛽 𝛤𝛾 𝛥𝛿 𝛦𝜀𝜖 𝛧𝜁 𝛨𝜂 𝛩𝜃𝜗 𝛪𝜄 𝛫𝜅 𝛬𝜆 𝛭𝜇 𝛮𝜈 𝛯𝜉 𝛰𝜊 𝛱𝜋 𝛲𝜌 𝛴𝜎𝜍 𝛵𝜏 𝛶𝜐 𝛷𝜙𝜑 𝛸𝜒 𝛹𝜓 𝛺𝜔