Anonymous user
Talk:Prime decomposition: Difference between revisions
→C
(→Factor missing from 15 November 2001 to 23 March 2012: questioned the mention of the year 2001 for a deletion of an example (before birth of Rosetta Code). -- ~~~~) |
(→C) |
||
| (2 intermediate revisions by 2 users not shown) | |||
Line 4:
It prints out the factors seperated by * to stdout, In the context of unix, where everything is a text stream this counts as a collection.
Why do you think it's unconventional, If you haven't used libgmp it may look strange.
==C==
This method seems to be incorrect. E.g. it does not find the decomposition for 2^41 - 1 == 13367 * 164511353. Can someone confirm this?
--[[User:Renfield|Renfield]] ([[User talk:Renfield|talk]]) 12:18, 18 June 2019 (UTC)
==Java==
Line 42 ⟶ 46:
I also think that bignum/growing array requirements should be dropped. At the very least, the title of the page should indicate that big numbers are part of the challenge. --[[User:Showell|Showell]] 07:33, 5 January 2012 (UTC)
:Agreed. The task is asking far too much. Integer factorization is one of those basic programs one learns early, in any language. But if bignums are required, it's entirely another matter: first one needs a library (relatively hard), then one needs a good factorization algorithm (very hard). [[User:Eoraptor|Eoraptor]] ([[User talk:Eoraptor|talk]]) 23:28, 17 December 2017 (UTC)
== NZMATH ==
Line 89 ⟶ 94:
: '''2001'''? I thought ''Rosetta Code'' was inaugurated in '''2007'''. -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 13:37, 16 October 2013 (UTC)
== Javascript ==
Javascript implementation without libraries fails with 100 as an argument. It decomposes to 2,2,25
| |||