Talk:Prime decomposition: Difference between revisions

Content added Content deleted

Inline

Revision as of 18:08, 5 February 2008

Could someone explain the C example a bit more (either in text around it or in comments)? It's using some things I think may be a bit unconventional. Also, does it actually return some sort of collection which contains the factors? The task says it should. --Mwn3d 09:17, 5 February 2008 (MST)

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.

Also the java example doesn't work for all integers > 1, maybe it could be fixed using the java bignum lib.

I added a BigDecimal example, though I don't think anyone will ever need to go beyond Double.MAX_VALUE. If they want to, they shouldn't be using Java. Also, sign your talk page posts please. See Help:Formatting for tips. --Mwn3d 11:08, 5 February 2008 (MST)

Revision as of 17:51, 5 February 2008 (view source) 83.104.248.190 (talk) No edit summary ← Older edit		Revision as of 18:08, 5 February 2008 (view source) rosettacode>Mwn3d (Happy now?) Newer edit →
Line 5:		Line 5:

	Also the java example doesn't work for all integers > 1, maybe it could be fixed using the java bignum lib.		Also the java example doesn't work for all integers > 1, maybe it could be fixed using the java bignum lib.

			:I added a BigDecimal example, though I don't think anyone will ever need to go beyond Double.MAX_VALUE. If they want to, they shouldn't be using Java. Also, sign your talk page posts please. See [[Help:Formatting]] for tips. --[[User:Mwn3d\|Mwn3d]] 11:08, 5 February 2008 (MST)