GIMPS wiki account request thread

[10metreh]

Originally Posted by ixfd64

Fair enough. A PM has been sent to 10metreh.

Thanks. Honestly, I'm intending to do things to the aliquot sequence pages, not to the whole wiki.

[flouran]

I would like to request an account with username: flouran.

I intend to add to the run-time complexity information of the primality tests presented in the wiki.

Thank you very much.

[ixfd64]

Originally Posted by flouran

I would like to request an account with username: flouran.

I intend to add to the run-time complexity information of the primality tests presented in the wiki.

Thank you very much.

PM sent.

[S485122]

Originally Posted by flouran

II intend to add to the run-time complexity information of the primality tests presented in the wiki.

Could I suggest you familiarise yourself a bit more with the big O notation before starting to modify the wiki article ? See our discussion Fastest Primality Tests.

Jacob

[flouran]

Originally Posted by S485122

Could I suggest you familiarise yourself a bit more with the big O notation before starting to modify the wiki article ? See our discussion Fastest Primality Tests.

Jacob

Well, I've learned a lot already about the topic over the course of this month and a half. And, as you can see, my knowledge regarding this topic is increasing. Furthermore, I only edited the bit-complexity of L-L if N represents the Mersenne number to be tested for primality. You only corrected me on my usage of nomenclature, such as using N for the Mersenne number instead of n, which is used to denote the exponent. Thus, I came up with the underlying mathematics, and you just corrected my notation (as you can see in the thread). So no, although I would not consider myself "fluent" or "professional" in the topic of Big-O and Landau notation, I would consider myself "familiar". Besides, anyone can edit the wiki if they think my math is wrong.

[S485122]

No problem, I was not sure that you read my comments about the precision needed so carefuly :-) Beware I am not an expert at all about computational complexity, this is why I did not modify your modification directly but first posted what I think the the correct values are. The article as it was before you modified it was wrong AFAIK because it stated that computational complexity was O(n^2 ln n) where n is the number of digits of the exponent and that is a log to much ! (If n is the number of digits of the exponent E of the Mersenne number M, then O(n^2 ln n) is equivalent to O((ln² E ln ln E) and O(ln²ln M ln ln ln M)

Jacob

[mdettweiler]

Could I please have a wiki account (same as my forum username)? It would mainly be used to edit the Aliquot sequence pages.

[ixfd64]

Originally Posted by mdettweiler

Could I please have a wiki account (same as my forum username)? It would mainly be used to edit the Aliquot sequence pages.

PM sent.

[wreck]

wreck
To update the NFSNet description.
I have participate this project about 5 years though the CPU power I've is very few.
And it seems like that frmky doesn't have many time to update this page,
I'd like to update this page if he didn't update it in a long time.

[ixfd64]

Originally Posted by wreck

wreck
To update the NFSNet description.
I have participate this project about 5 years though the CPU power I've is very few.
And it seems like that frmky doesn't have many time to update this page,
I'd like to update this page if he didn't update it in a long time.

PM sent.

[S46055]

Hi,
I use prime95 for long time. I would a login for edit the articles on mersennewiki. please help me.
there is a mistake on http://mersennewiki.org/index.php/George_Woltman :" Massachusetts Insititute of Technology" and what a bother to correct it!
I must create a login here on http://mersenneforumm.org to ask a login for http://mersennewiki.org. No much person have patience for this.

I wait, bye.

PS: somebody can talk to M. George Woltman if he could give a free photo for mersennewiki? I translate his article for fr:wikipédia and there is no photo too on en:wikipedia.