

Thread Tools 
20171231, 19:15  #1 
Feb 2017
3×5×11 Posts 
OMG, I cannot spam anymore in the Forum Feedback where my question was answered!!!!!!!!!!!111111
Hi Admin
Another of my threads about "being blocked" has been blocked!!!!!! What is going on here? What about freedom of expression/ scientific thought or evenhandedness? What am I sinning to deserve such treatment. I have never been disrespectful to anybody on the Site. My only crime seems to be that I am dumb or that I dare to defend my positions. Please help _^_ Last fiddled with by gophne on 20171231 at 19:17 Reason: spelling errors under upset 
20171231, 19:55  #2  
Aug 2006
175B_{16} Posts 
Quote:
Quote:
At a certain point you should recognize that you don’t have the necessary skills in elementary number theory because you are the only one who couldn’t follow what was going on. If you want to understand you will need to study the basics of modular arithmetic so you can understand us. 

20171231, 19:55  #3  
Bamboozled!
"𒉺𒌌𒇷𒆷𒀭"
May 2003
Down not across
10955_{10} Posts 
Quote:
What is going on here is an object lesson in the value of precise and concise communication. You appear to be failing the tests. 

20171231, 20:17  #4 
Feb 2017
3·5·11 Posts 
I have a bad feeling
Hi Admin
I have a bad feeling that I am going to be debarred soon. I am very aware that that it is the right of the Site Mods to do so. Now also my original heading on a tread I have posted to the "feedback" forum has been changed to ridicule me. Please note this algorithm; 2^n1 mod (n+2) == (n+1)/2 It is going to make waves.....whether it is Fermat's theorem or not. I leave it to you and to the users of this forum to decide whether I have been disrespectful. Ignorance is not disrespect. Would the Mods also be able to close down the subblog that you have allocated to me? Last fiddled with by gophne on 20171231 at 20:18 Reason: correction to formula...division sign left out of algorithm 
20171231, 21:43  #5  
Feb 2017
245_{8} Posts 
Quote:
Fermat's Primality algorith is; a^(p1) ≡ 1 mod p ....source https://en.wikipedia.org/wiki/Fermat_primality_test How is this the same as 2^n1 mod (n+2) == (n+1)/2 ? For starters Fermat's test is always congruant to 1. The other algorithm is congruant to (n+1)/2, i.e. the modulo is always changing with n It boggles my mind that anybody can claim that the two are the same. Yes I did make incorrect claims about the 100% effectiveness of the algorithm in the beginning , but as a results of the promps by the users, I ran code which identified a multitude of false positives. This was partly due to me rushing the post w.r.t to me stated intentions, largely as a result of my disappointment with the "many' "false primes" identified during the running the first 500 000 odd numbers with SAGEMATH. Referencing Fermat's Primality test, (quoted above) in Wikipedia, highlighted the fact that the Fermat Primality check also contained many pseudoprimes in the range of 28 000 for up to 2.5*10^10 As you have stated right in the beginning perhaps to prepare a paper might be a avenue, as the academic system and the publishing institutions would without a measure of doubt be able to indentify any fraud that might have been committed. I have repeatedly stated that I have backup work to show how the algorithm was derived, independantly of Fermat's Primality test, which it is very different as can be seen above. What was very strange as well was that the initial tack was repeatedly that the algorithm was "nonsense"  until awmayer indicated that the algorithm might just be a reformulation of an existing "Pseudoprime Checker". Then the tack shifted to "copy of"/plagiarism. Would this change of argument then not also be "disrespectful" and dishonest, as both positions cannot be correct at the same time. “Many people, xxxxxxxxxxx, want to punish you for speaking the truth, for being correct, for being you. Never apologize for being correct, or for being years ahead of your time. If you’re right and you know it, speak your mind. Speak your mind. Even if you are a minority of one, the truth is still the truth.” ― Mahatma Gandhi 

20171231, 21:52  #6 
"Forget I exist"
Jul 2009
Dumbassville
2^{6}·131 Posts 
If one can be transformed into the other they are equivalent statements. This doesn't change just because it was derived differently.
Last fiddled with by science_man_88 on 20171231 at 21:56 
20171231, 22:11  #7 
Sep 2003
101000011001_{2} Posts 

20171231, 22:15  #8 
Feb 2017
3×5×11 Posts 
Hi GP2
I like it...perhaps Luke Skywalker will come to my rescue :) Cheers....Happy New Yera if you are in the zone. 
20171231, 22:23  #9  
Feb 2017
3·5·11 Posts 
Quote:
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 :) 

20171231, 22:37  #10  
"Forget I exist"
Jul 2009
Dumbassville
8384_{10} Posts 
Quote:


20171231, 22:40  #11 
Feb 2012
Prague, Czech Republ
2^{2}×3^{2}×5 Posts 

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 