

Thread Tools 
20171231, 22:41  #12  
Einyen
Dec 2003
Denmark
2·3·13·41 Posts 
Quote:
You agreed your algorithm gave the same false positives as I showed for fermat pseudoprime base 2 right? So why is it so hard to believe they are the same? Try and find different beginners guides to modular arithmetic, because you do not understand it yet. 

20171231, 23:26  #13  
Feb 2017
10100101_{2} Posts 
Quote:
Please I beg you as well, please publish the figures for the comparison. Publish the data for running the algorithms using the same imputs, say for about 10,000 inputs and see if the two algorithms generates the same OUTPUTS. If they do not generate the same outputs (eventhought the outputs may have many values in common) the two algorithms would NOT be the same, or more correctly put would not be IDENTICAL. If generating "the same/common output" is a criteria for rejecting an algorithm as "a copy" then many Primality algorithms, bar the original one, would not pass muster. 

20171231, 23:56  #14 
Feb 2017
A5_{16} Posts 

20171231, 23:58  #15  
Nov 2008
912_{16} Posts 
Quote:
Code:
x=0;for(n=1,9998,if(isprime(n+2)==0&&(2^n1)%(n+2)==(n+1)/2,x++;print(x" "n+2))) Code:
1 341 2 561 3 645 4 1105 5 1387 6 1729 7 1905 8 2047 9 2465 10 2701 11 2821 12 3277 13 4033 14 4369 15 4371 16 4681 17 5461 18 6601 19 7957 20 8321 21 8481 22 8911 Code:
x=0;for(n=1,10000,if(isprime(n)==0&&(2^(n1))%n==1,x++;print(x" "n))) Code:
1 341 2 561 3 645 4 1105 5 1387 6 1729 7 1905 8 2047 9 2465 10 2701 11 2821 12 3277 13 4033 14 4369 15 4371 16 4681 17 5461 18 6601 19 7957 20 8321 21 8481 22 8911 

20180101, 00:35  #16 
Dec 2017
2×5^{2} Posts 
Rephrasing the algorithm is as follows: (n + 1)/2 ≡ 2^n  1 (mod n)
Here, I have rephrased it to avoid conclusiona dn I believe this is what gophne means. gophne says that this is the primality tester, because this holds truth iff (if and only if) n is a prime number. I think there was heaps of confusion based on the way he wrote it, and because of this, I don’t think it comes from Fermat’s Little Theorem. I believe, actually, it comes from Wilson’s Theorem: (n  1)! ≡ 1 (mod n) iff n is prime.

20180101, 00:36  #17 
Dec 2017
2×5^{2} Posts 
Rephrasing the algorithm as follows: (n + 1)/2 ≡ 2^n  1 (mod n)
Here, I have rephrased it to avoid conclusiona dn I believe this is what gophne means. gophne says that this is the primality tester, because this holds truth iff (if and only if) n is a prime number. I think there was heaps of confusion based on the way he wrote it, and because of this, I don’t think it comes from Fermat’s Little Theorem. I believe, actually, it comes from Wilson’s Theorem: (n  1)! ≡ 1 (mod n) iff n is prime.

20180101, 00:40  #18 
"Composite as Heck"
Oct 2017
870_{10} Posts 
Come on man, all you need is a little self awareness to see that you haven't been snubbed or mistreated. This forum is very supportive in helping people understand and work through theories, and is amazingly tolerant when it goes beyond that. Don't worry about the thread renaming, that's a meme around here and is not evidence that you're being persecuted.

20180101, 00:42  #19 
Dec 2017
110010_{2} Posts 
I couldn’t agree more with the guy above this post.
If this forum was mean and punishing, I would be outta here. Look, what I’m trying to say is that we are here to help. It may not come across it like that, but we got people that did code and plugged in a bunch of data to test your algorithm. Inside, we do all appreciate your efforts :)
Last fiddled with by George M on 20180101 at 00:44 Reason: Because we are a bunch of nice people who like primes (at least most of us) 
20180101, 00:58  #20  
"Kieren"
Jul 2011
In My Own Galaxy!
2·3·1,693 Posts 
Quote:


20180101, 01:31  #21 
6809 > 6502
"""""""""""""""""""
Aug 2003
101×103 Posts
29·349 Posts 
You have been given your own domain to spout off as you will.
http://mersenneforum.org/forumdisplay.php?f=149 You have moderator powers there. Please keep your ranting and ideas there. If you have general comments on other threads, ok. But keep your stuff in your subforum. That is freedom of speech. 
20180101, 02:36  #22 
Dec 2017
2×5^{2} Posts 
,,,
Last fiddled with by guptadeva on 20180101 at 03:00 Reason: utterly nonsense ... 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Serious question about DH forum. How to get in for free?  Stargate38  Forum Feedback  39  20170908 08:14 
Question: Is Our Forum Secure in Some Areas  9021951  Information & Answers  7  20111102 23:29 
stupidest question you've ever answered  science_man_88  Lounge  11  20111010 06:16 
Question about spam posts  schickel  Forum Feedback  27  20090410 08:30 
Spam Bot is posting here in forum  Matthias C. Noc  Forum Feedback  19  20041122 03:37 