mersenneforum.org OMG, I cannot spam anymore in the Forum Feedback where my question was answered!!!!!!!!!!!111111
 Register FAQ Search Today's Posts Mark Forums Read

2018-01-01, 06:21   #23
gophne

Feb 2017

16510 Posts

Quote:
 Originally Posted by science_man_88 Your same inputs part has nothing to do with it. If you input is n-2 Fermat's output would be for n.
Correct.

But what should then happen is for "equivalent" inputs to be run...that is (n-2) for the first case and n for Fermat.

Any volunteers. I do not want to do it myself, because my expertise is under suspicion (no problem), so I think whatever I come up with might be questionable right from the starting blocks.

So I think it would be better to come from more established contributors.

2018-01-01, 06:22   #24
gophne

Feb 2017

3×5×11 Posts

Quote:
 Originally Posted by ATH 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.
POST RESULTS FOR ALL TO SEE.

2018-01-01, 06:40   #25
gophne

Feb 2017

3·5·11 Posts

Quote:
 Originally Posted by 10metreh 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?
Hi 10metreh

OMG. It is exactly THE SAME.

I accept now that the algorithm is a "clone" and that it is a repitition of Fermat. I shall not persue this matter any further.

I apologise to all the contributors that tried to unsuccessfully point this out to me for wasting your time all the while.

Now all that remains, if anybody might be interested, would be how I derived "my" algorithm. I did not reference to Fermat.

Oh my goodness!

2018-01-02, 09:48   #26
MisterBitcoin

"Nuri, the dragon :P"
Jul 2016
Good old Germany

35216 Posts

Quote:
 Originally Posted by gophne POST RESULTS FOR ALL TO SEE.

 2018-01-02, 11:21 #27 gophne   Feb 2017 3×5×11 Posts Hi MisterBitcoin Hahaha
 2018-01-03, 03:56 #28 flagrantflowers   Apr 2014 12810 Posts We need to develop some kind of operational manual for dealing with people who appear, at first glance, to be having an acutely difficult time with … . To ban people in such a state does a disservice to someone who is seeking a community for whatever comfort. I see a lot of people at risk who are mocked and dismissed. Is engaging the right method; doubtful. I do not have a solution but I think we need to do better.
2018-01-03, 11:26   #29
ET_
Banned

"Luigi"
Aug 2002
Team Italia

113548 Posts

Quote:
 Originally Posted by flagrantflowers I do not have a solution but I think we need to do better.
...then you are part of the problem... just kidding.

 2018-01-03, 14:17 #30 LaurV Romulan Interpreter     "name field" Jun 2011 Thailand 996210 Posts Yay!

 Similar Threads Thread Thread Starter Forum Replies Last Post Stargate38 Forum Feedback 39 2017-09-08 08:14 9021951 Information & Answers 7 2011-11-02 23:29 science_man_88 Lounge 11 2011-10-10 06:16 schickel Forum Feedback 27 2009-04-10 08:30 Matthias C. Noc Forum Feedback 19 2004-11-22 03:37

All times are UTC. The time now is 13:30.

Sat May 21 13:30:43 UTC 2022 up 37 days, 11:32, 0 users, load averages: 1.43, 1.40, 1.41