Jump to content

Talk:Prime decomposition: Difference between revisions

no edit summary
(It's fine)
No edit summary
Line 10:
I note the J example simply calls a built-in - is that allowed? The task is kinda vague: "write a function that..." which could well include access to some language builtin. Or is the intent to show how one would solve the actual problem in that language? [[User:Sgeier|Sgeier]] 11:32, 6 February 2008 (MST)
:The vagueness is fine. Do it as simply as you see fit. If your language has prime decomposition built-in then that just makes it easier. --[[User:Mwn3d|Mwn3d]] 11:44, 6 February 2008 (MST)
 
 
The OCaml and Python versions are incorrent, wrt big numbers?
Anonymous user
Cookies help us deliver our services. By using our services, you agree to our use of cookies.