mersenneforum.org  

Go Back   mersenneforum.org > Extra Stuff > Miscellaneous Math

Reply
 
Thread Tools
Old 2021-11-16, 23:54   #1
paulunderwood
 
paulunderwood's Avatar
 
Sep 2002
Database er0rr

10000101110102 Posts
Default 1+1 selfridges test for 1/8 of numbers

I was playing around while I waiting for some results to come in...

For n=3 mod 4 such that kronecker(-3,n)==-1 and kronecker(-7,n)==-1 test

Mod(2,n)^((n-1)/2)==kronecker(2,n) and Mod(-7,n)^((n-1)/2)==-1.

That's it! It is 1+1 selfridges. I have tested it for n < 7*10^9 so far. Pretty good, eh?

Can you fool it?

For convenience here is the test:

Code:
{tst(n)=n%4==3&&kronecker(-3,n)==-1&&kronecker(-7,n)==-1&&
Mod(-7,n)^((n-1)/2)==-1&&Mod(2,n)^((n-1)/2)==kronecker(2,n);}


Morning after... A quick 1 second scan of Jan Feitsma's 2-PSP list yields the fraud tst(619033*670619).

Last fiddled with by paulunderwood on 2021-11-17 at 08:13
paulunderwood is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Single Parameter Frobenius test -- 1+1+1+1+2 Selfridges paulunderwood Miscellaneous Math 2 2021-10-14 22:03
was: a deterministic test for primes p=1 or p=7 mod 8 with 2 Selfridges bhelmes Miscellaneous Math 0 2021-06-07 00:43
a d̶e̶t̶e̶r̶m̶i̶n̶i̶s̶t̶i̶c̶ test for primes p=1 or p=7 mod 8 with 2 (??) Selfridges bhelmes Miscellaneous Math 35 2021-04-10 17:01
1+1 Selfridges PRP test paulunderwood Miscellaneous Math 21 2020-11-20 13:16
I found the primality test, there seems to be no composite numbers that pass the test sweety439 sweety439 7 2020-02-11 19:49

All times are UTC. The time now is 09:14.


Thu Sep 29 09:14:01 UTC 2022 up 42 days, 6:42, 0 users, load averages: 0.86, 1.06, 1.09

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

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