mersenneforum.org  

Go Back   mersenneforum.org > Extra Stuff > Blogorrhea > gophne

Reply
 
Thread Tools
Old 2017-12-31, 22:41   #12
ATH
Einyen
 
ATH's Avatar
 
Dec 2003
Denmark

3·23·43 Posts
Default

Quote:
Originally Posted by gophne View Post
For the last time LoL....you may be correct....BUT you must prove identity....identity is not so because you or Billy The Kid might say so. And even if the statement is repeated over and over...the matter is not resolved until the fat lady sings....the fat lady in this case being the results generated by the algorithms using the same inputs...nothing else would suffice, even if the claim is made by Chuck Norris :)
It was proven to you, but you do not accept the proof, so there is not much else we can do.

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.
ATH is offline   Reply With Quote
Old 2017-12-31, 23:26   #13
gophne
 
Feb 2017

3×5×11 Posts
Default

Quote:
Originally Posted by ATH View Post
It was proven to you, but you do not accept the proof, so there is not much else we can do.

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.
Hi ATH

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.
gophne is offline   Reply With Quote
Old 2017-12-31, 23:56   #14
gophne
 
Feb 2017

3×5×11 Posts
Default

Quote:
Originally Posted by science_man_88 View Post
Your same inputs part has nothing to do with it. If you input is n-2 Fermat's output would be for n.
DO IT...............PLEASE
gophne is offline   Reply With Quote
Old 2017-12-31, 23:58   #15
10metreh
 
10metreh's Avatar
 
Nov 2008

232210 Posts
Default

Quote:
Originally Posted by gophne View Post
Hi ATH

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.
Here is some Pari code to run your test for numbers n+2 from 1 to 10000, and print the false positives along with a counter:
Code:
x=0;for(n=-1,9998,if(isprime(n+2)==0&&(2^n-1)%(n+2)==(n+1)/2,x++;print(x" "n+2)))
Here is its output:

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
Here is some code to run Fermat's test to base 2 for n from 1 to 10000, and similarly print the false positives:
Code:
x=0;for(n=1,10000,if(isprime(n)==0&&(2^(n-1))%n==1,x++;print(x" "n)))
Here is its output:
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
Does that look at all familiar?
10metreh is offline   Reply With Quote
Old 2018-01-01, 00:35   #16
George M
 
Dec 2017

2×52 Posts
Default 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.
George M is offline   Reply With Quote
Old 2018-01-01, 00:36   #17
George M
 
Dec 2017

2×52 Posts
Post 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.
George M is offline   Reply With Quote
Old 2018-01-01, 00:40   #18
M344587487
 
M344587487's Avatar
 
"Composite as Heck"
Oct 2017

2×3×109 Posts
Default

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.
M344587487 is offline   Reply With Quote
Old 2018-01-01, 00:42   #19
George M
 
Dec 2017

2×52 Posts
Default 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 2018-01-01 at 00:44 Reason: Because we are a bunch of nice people who like primes (at least most of us)
George M is offline   Reply With Quote
Old 2018-01-01, 00:58   #20
kladner
 
kladner's Avatar
 
"Kieren"
Jul 2011
In My Own Galaxy!

100111000001002 Posts
Default

Quote:
Originally Posted by GP2 View Post
Help us, R.D. Silverman. You're our only hope.

https://www.youtube.com/watch?v=5cc_h5Ghuj4
LOL, on the RDS appeal!
kladner is offline   Reply With Quote
Old 2018-01-01, 01:31   #21
Uncwilly
6809 > 6502
 
Uncwilly's Avatar
 
"""""""""""""""""""
Aug 2003
101×103 Posts

23·1,091 Posts
Default

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 sub-forum. That is freedom of speech.
Uncwilly is online now   Reply With Quote
Old 2018-01-01, 02:36   #22
guptadeva
 
Dec 2017

2·52 Posts
Default

,,,

Last fiddled with by guptadeva on 2018-01-01 at 03:00 Reason: utterly nonsense ...
guptadeva is offline   Reply With Quote
Reply

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 2017-09-08 08:14
Question: Is Our Forum Secure in Some Areas 9021951 Information & Answers 7 2011-11-02 23:29
stupidest question you've ever answered science_man_88 Lounge 11 2011-10-10 06:16
Question about spam posts schickel Forum Feedback 27 2009-04-10 08:30
Spam Bot is posting here in forum Matthias C. Noc Forum Feedback 19 2004-11-22 03:37

All times are UTC. The time now is 03:50.

Sat Oct 24 03:50:20 UTC 2020 up 44 days, 1:01, 1 user, load averages: 1.21, 1.18, 1.25

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.