mersenneforum.org

mersenneforum.org (https://www.mersenneforum.org/index.php)
-   Miscellaneous Math (https://www.mersenneforum.org/forumdisplay.php?f=56)
-   -   Challenge (https://www.mersenneforum.org/showthread.php?t=12289)

science_man_88 2009-08-18 20:48

other than the c99 function all it would need is error (like perror) checking by what I was told

science_man_88 2009-08-18 20:49

Okay maybe it needs a few more edits than that like instead of i writing in the form 2^i-1

science_man_88 2009-08-18 20:59

another thing I found is one I tried (don't remember which one) seems that if it rounds up it rounds to 6 could it relate to perfect number and if I find it again and that's true could perfect numbers be used to find the other half ?

science_man_88 2009-08-18 21:20

Possible Prime finder
 
I have code that someone on bytes.com forum helped me with and if what I think I've found to be true for half of all Mersenne primes to date then I might change it a bit and build it with help from someone more experienced in C . if what I think is true and my program runs as planned within minutes of compiling and building it and running it a new possible mersenne prime to be checked will possibly break the world record with a 64 bit processor i think it should be able to find over half of all possible mersennes under 2 ^ 18 quintillion+ -1 . So anyone want to help me ?

science_man_88 2009-08-18 22:06

43112639 seems possible but the other 2 I tried rounded to even numbers this rounds to an odd might be one to stay away from but you can try it if you want I'll try and find one that is close to an even answer

henryzz 2009-08-18 22:36

[quote=science_man_88;186413]I have code that someone on bytes.com forum helped me with and if what I think I've found to be true for half of all Mersenne primes to date then I might change it a bit and build it with help from someone more experienced in C . if what I think is true and my program runs as planned within minutes of compiling and building it and running it a new possible mersenne prime to be checked will possibly break the world record with a 64 bit processor i think it should be able to find over half of all possible mersennes under 2 ^ 18 quintillion+ -1 . So anyone want to help me ?[/quote]
Post your code and we might believe you and help you if it turns out to be true. Most claims like this are from cranks although occasionly huge discoveries are not believed because they are revolutionary so am willing to investigate if you post your code.

Mini-Geek 2009-08-18 22:47

[quote=henryzz;186418]Post your code and we might believe you and help you if it turns out to be true.[/quote]
He already posted [URL="http://www.mersenneforum.org/showthread.php?p=186403#post186403"]his code[/URL] in his Misc Math thread where it belongs.
[quote=henryzz;186418]Most claims like this are from cranks although occasionly huge discoveries are not believed because they are revolutionary so am willing to investigate if you post your code.[/quote]
I think he's demonstrated quite clearly that he is, in fact, a crank.

Uncwilly 2009-08-18 23:28

Can a mod start locking the doors that Science dude is opening?

Mini-Geek 2009-08-18 23:46

[URL]http://primes.utm.edu/notes/crackpot.html[/URL]

(for conciseness, I won't list ones that result in 0)

Debits (evidence of 'crackpot'ness)

* Syntax
2. 5 points for every statement that is clearly vacuous, logically inconsistent, or widely agreed on to be false.
[B]I'll estimate this to be 10 statements.
[/B][B]50[/B]
3. 10 points for each such statement that is adhered to despite careful correction.
[B]same
[/B][B]50[/B]
4. 10 points for not knowing (or not using) standard mathematical notation.
[B]check
10[/B]
* Subject and Claims
8. 20 points for each of the following conjectures that you purport to have solved: Goldbach's conjecture; twin prime conjecture; Riemann Hypothesis, GRH; Fermat's Last Theorem (*); infinitely many Mersennes, Fermats, primes of the form n^2+1...; or [U]finding new patterns in the primes[/U].
[B]check
20[/B]
9. 20 points for talking about how great your theory is, but never actually explaining it.
[B]check
20[/B]
* Hubris
11. 10 points for pointing out that you have gone to school, as if this were evidence of sanity.
[B]check
10[/B]
14. 10 points for claiming that your work is revolutionary, a "paradigm shift," or [U]a simple idea missed by all but you[/U].
[B]check
10[/B]
* Process and Proof
17. 10 points for expecting others to disprove your result(s) rather than providing the proof yourself.
[B]check
10[/B]
22. 50 points for failing to respond to appropriate corrections, questions and challenges.
[B]check
50[/B]

50+50+10+20+20+10+10+10+50=230

Uncwilly 2009-08-19 00:43

[QUOTE=Mini-Geek;186427][URL]http://primes.utm.edu/notes/crackpot.html[/URL]
Debits (evidence of 'crackpot'ness)

* Syntax
[/QUOTE]While not specified in #1 "1 point for each word in all capital letters.", one would like to add a few points for lack of punctuation, sentence division, and other problems with their mother tongue.

Also, a few bonus points are in order for the issues coding C and lack of knowledge about how one might find a free version of C. etc.

Mini-Geek 2009-08-19 01:01

[quote=Uncwilly;186433]While not specified in #1 "1 point for each word in all capital letters.", one would like to add a few points for lack of punctuation, sentence division, and other problems with their mother tongue.

Also, a few bonus points are in order for the issues coding C and lack of knowledge about how one might find a free version of C. etc.[/quote]
Yeah, the crackpot index doesn't exactly tailor to this sort of crank.


All times are UTC. The time now is 05:53.

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.