User talk:PrimeHunter

From Wikipedia, the free encyclopedia

Welcome!

Hello PrimeHunter, and welcome to Wikipedia! Thank you for your contributions. I hope you like the place and decide to stay. Here are a few good links for newcomers:

I hope you enjoy editing here and being a Wikipedian! Please sign your name on talk pages using four tildes (~~~~); this will automatically produce your name and the date. If you have any questions, check out Wikipedia:Where to ask a question or ask me on my talk page. Again, welcome! HGB 23:33, 3 November 2005 (UTC)

1 Thanks
2 Elliptic curve primality proving
3 Re ...Category:Fictional wardens
4 My As of question
5 Smarandache-Wellin number
6 The Brakes
7 Truncatable prime
8 Humor :)

[edit] Thanks

Thank you for the advice about linking categories! Sr13 01:49, 13 December 2006 (UTC)

[edit] Elliptic curve primality proving

I had not checked carefully that Morain's program is free. I assumed that since he wrote an article about it and since there was a separate section for binaries that it was. Apparently the source used to be available, but is not anymore, because he doesn't want to get bug reports about it. So the implementations are both non-free. Since they are non-free it is not clear that they are implementations of the algorithm claimed or that they do not contain malware. We shouldn't be linking to malware. --MarSch 15:41, 18 December 2006 (UTC)

(This originated at User_talk:MarSch#ECPP_programs) We shouldn't link to known malware but nobody (AFAIK) has ever mentioned the possibility that the 2 programs might contain malware. I would be extremely surprised if they do. I search primes and have cooperated with both authors. I have great respect for their work on Elliptic curve primality proving. Writing these programs is very hard and there are few potential users. Wikipedia links to lots of sites with programs which are not open source (is there a policy against that?). The lacking source means listing them under "Implementations" could be misunderstood, but I think the sites (which also have ECPP information) should be in external links. They are the fastest and most respected publicly available ECPP programs, and they have both set several ECPP records (no other publicly available program has set any AFAIK). PrimeHunter 16:29, 18 December 2006 (UTC)

By the way, the programs output ECPP certificates (verifiable by other programs) for primes not known at programming time, so they are by definition ECPP implementations. PrimeHunter 16:49, 18 December 2006 (UTC)

[edit] Re ...Category:Fictional wardens

Hi Jens,

...You closed Wikipedia:Categories for deletion/Log/2006 December 5#Fictional Her Majesty's Prison Service employees. Category:Fictional wardens pointed and still points to the same CfD debate. There is also a Category:Fictional correctional officers which should perhaps be merged with the others.

Thanks for spotting this oversight; Fictional wardens is now slated to be merged with Fictional prison officers and governors. I've also tagged Fictional correctional officers as a {{categoryredirect}} to Fictional prison officers and governors, so this too should soon be emptied. Best wishes, David Kernow (talk) 12:27, 2 January 2007 (UTC)

[edit] My As of question

Thanks for pointing this out to me, when the help desk query had already been and gone (relatively) - this was exactly what I had remembered seeing, but couldn't remember exactly where!Ga rr ie 00:52, 15 January 2007 (UTC)

[edit] Smarandache-Wellin number

I have added a "{{prod}}" template to the article Smarandache-Wellin number, suggesting that it be deleted according to the proposed deletion process. All contributions are appreciated, but I don't believe it satisfies Wikipedia's criteria for inclusion, and I've explained why in the deletion notice (see also "What Wikipedia is not" and Wikipedia's deletion policy). Please either work to improve the article if the topic is worthy of inclusion in Wikipedia, or, if you disagree with the notice, discuss the issues at its talk page. Removing the deletion notice will prevent deletion through the proposed deletion process, but the article may still be sent to Articles for Deletion, where it may be deleted if consensus to delete is reached, or if it matches any of the speedy deletion criteria. —David Eppstein 19:35, 15 January 2007 (UTC)

[edit] The Brakes

Thanks for the notification you left on my talk page. Newartriot 02:44, 1 February 2007 (UTC)

[edit] Truncatable prime

Great work fixing up Truncatable prime. I'd have liked to see footnotes used for the refs, but beggars can't be choosers, and you've certainly improved the article vastly. Thanks for your efforts. --Sopoforic 19:12, 7 February 2007 (UTC)

Thanks. It's a short article with short references, and most information can easily be found in several of them. I don't know policy on this point, but I view the OEIS template as an inline citation equivalent to a footnote, but with no need to repeat under notes/references. The OEIS sequences include definitions, the first truncatable primes, the number of them, and the largest. All this information is also in MathWorld, the first in the references section. By the way, my own website has a page about truncatable primes [1], but I didn't reference it. PrimeHunter 13:40, 8 February 2007 (UTC)