mersenneforum.org  

Go Back   mersenneforum.org > Extra Stuff > Miscellaneous Math

Reply
 
Thread Tools
Old 2018-03-19, 01:11   #12
Chair Zhuang
 
Dec 2017

1010 Posts
Default

I'm not good at English. Can you take a example,or say it in other words.
Chair Zhuang is offline   Reply With Quote
Old 2018-03-19, 01:28   #13
CRGreathouse
 
CRGreathouse's Avatar
 
Aug 2006

176316 Posts
Default

Quote:
Originally Posted by science_man_88 View Post
So basically a suped up fermat test. p-1 factors into them all last I checked.
sm, if you are able to understand the algorithm I'd appreciate an explanation. Reading your post and then CZ's I get the impression it's something like a base-16644 pseudoprime test, but if you could give more details that would be great.

(Of course this might not be possible!)
CRGreathouse is offline   Reply With Quote
Old 2018-03-19, 01:33   #14
Chair Zhuang
 
Dec 2017

2×5 Posts
Default

I'm not good at English. Can you take a example or say it in other words.
Chair Zhuang is offline   Reply With Quote
Old 2018-03-19, 01:55   #15
Chair Zhuang
 
Dec 2017

A16 Posts
Default

As you say I would not to say the detail currently. If GQQ is a base-16644 pseudoprime test, it can not test Carmichael numbers, but it has done it.
Chair Zhuang is offline   Reply With Quote
Old 2018-03-19, 02:01   #16
science_man_88
 
science_man_88's Avatar
 
"Forget I exist"
Jul 2009
Dartmouth NS

2·3·23·61 Posts
Default

Quote:
Originally Posted by CRGreathouse View Post
sm, if you are able to understand the algorithm I'd appreciate an explanation. Reading your post and then CZ's I get the impression it's something like a base-16644 pseudoprime test, but if you could give more details that would be great.

(Of course this might not be possible!)
I know the following:

1) they try relating it to Fermat's sequence (thought they meant fermats test)
2) they use polynomials that divide by p-1
3) they made me think it was a suped up fermat test.
science_man_88 is offline   Reply With Quote
Old 2018-03-19, 03:58   #17
ryanlatterell
 
"Ryan Latterell"
Mar 2018
Saint Paul, MN

2 Posts
Default I only write legit, deterministic factorization algorithms every day. No psuedo ever

All the factors, all at once, every time, guaranteed
Attached Thumbnails
Click image for larger version

Name:	FACTALG.JPG
Views:	142
Size:	27.0 KB
ID:	17941  
ryanlatterell is offline   Reply With Quote
Old 2018-03-19, 04:34   #18
CRGreathouse
 
CRGreathouse's Avatar
 
Aug 2006

176316 Posts
Default

Quote:
Originally Posted by Chair Zhuang View Post
As you say I would not to say the detail currently. If GQQ is a base-16644 pseudoprime test, it can not test Carmichael numbers, but it has done it.
Agreed.

It seems you have found a pseudoprimality test. It might even be a real primality test, but without a proof we couldn't know. (Technically, we can't even be sure it's a pseudoprimality test but I'll give you the benefit of the doubt there.)
CRGreathouse is offline   Reply With Quote
Old 2018-03-21, 09:21   #19
Chair Zhuang
 
Dec 2017

2×5 Posts
Default

To CRGreathouse
I agree what you said. In Mathematically, 10^10 or more concrete test is not better

than only one abstract proof.
Your doubt is reasonable. Maybe, we would think GQQ is only a database. But if it is

so my computer must has a very big hard disk or I must spend much money to rent

cloud drive to store the primes. And on the other hand, how did I obtain these

primes?
Acording to the prime number theory there are about 2^10000/ln(2^10000)=

(about)10^3000 primes from 2 to 2^10000 in the database.
Chair Zhuang is offline   Reply With Quote
Old 2018-03-21, 20:27   #20
CRGreathouse
 
CRGreathouse's Avatar
 
Aug 2006

10111011000112 Posts
Default

Quote:
Originally Posted by Chair Zhuang View Post
Your doubt is reasonable. Maybe, we would think GQQ is only a database.
No, as you say, there are too many numbers to store. Much more likely is a pseudoprime test. You wouldn't need much space or a powerful machine to pull that off.

And if it is a novel test, congrats -- though you're certainly not the first, it's not every day you see a new pseudoprimaliy test pop up, and it's only the second one I can think of being announced here on these forums (the other being the Vrba-Reix test).
CRGreathouse is offline   Reply With Quote
Old 2018-03-26, 22:02   #21
Chair Zhuang
 
Dec 2017

2×5 Posts
Default

To CRGreathouse
Thank you for your congratulations.
Can you tell me the way to Vrba-Reix test?
Let's see the words below on 2018/3/19 again.
In GQQ primality test:
______________________________________________________________________________________
.p=40751 base 16644: 1,17409,10638,36705,3788,..... The value numbers are

59568 and 59568 at item (40751+1)/2 and next.
q=122251 base 16644: 1,83349,83494,74553,56287,...... The value

numbers are 1 and 83349 at item (122251+1)/2 and next.
_______________________________________________________________________________________
p=40751 is using a right base, so we can decide its primality. And
q=122251 is'nt using a right base, and "the value number is also 1 at item

(122251-1)/2. This sequence is LIKELY a Fermat sequence, but is'nt really Fermat

sequence." (Giving it a right base, its sequence is really Fermat sequrnce.)
To a prime number we can give it a right base by its form of the number , and

decide its primality. If a number is the form as a prime is and the value numbers at

item (n+1)/2 and next are not correct, the number is composite.
GQQ is single algorithm and its sequence, Quifu sequence, contains Fermat

sequence, but determining primality is'nt by Fermat sequence.
Chair Zhuang is offline   Reply With Quote
Old 2018-03-26, 22:33   #22
CRGreathouse
 
CRGreathouse's Avatar
 
Aug 2006

5,987 Posts
Default

Quote:
Originally Posted by Chair Zhuang View Post
Can you tell me the way to Vrba-Reix test?
Many of the bits and pieces have been collected together here:
https://trex58.wordpress.com/math2matiques/
CRGreathouse is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
"New" primality test/check gophne gophne 272 2018-04-24 13:16
Aouessare-El Haddouchi-Essaaidi "test": "if Mp has no factor, it is prime!" wildrabbitt Miscellaneous Math 11 2015-03-06 08:17
"New primality proving test from Alex Petrov" ewmayer Math 11 2007-04-23 19:07
P-1 B1/B2 selection with "Test=" vs "Pfactor=" James Heinrich Software 2 2005-03-19 21:58
Would Minimizing "iterations between results file" may reveal "is not prime" earlier? nitai1999 Software 7 2004-08-26 18:12

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


Sat Jan 28 11:14:15 UTC 2023 up 163 days, 8:42, 0 users, load averages: 1.01, 1.08, 1.04

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

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