Hi, [caution possibly stupid remark]
>> > prime?: % -> Boolean >> > ++ prime?(x) tests if x can never be written as the product of >> > two >> > ++ non-units of the ring, >> > ++ i.e., x is an irreducible element. * Given this definition, why should -5=(-1)*5 be a prime at all? * given prime? uses a statistical method, the definition is also not met and should possibly be stated as: ++ prime?(x) tests if x can not be written as the product of two ++ non-units of the ring (with very small probability) Cheers and all the best wishes for 2010 BF. -- % PD Dr Bertfried Fauser % Research Fellow, School of Computer Science, Univ. of Birmingham % Honorary Associate, University of Tasmania % Privat Docent: University of Konstanz, Physics Dept <http://www.uni-konstanz.de> % contact |-> URL : http://www.cs.bham.ac.uk/~fauserb/ % Phone : +44-121-41-42795 and +49 1520 9874517
-- You received this message because you are subscribed to the Google Groups "FriCAS - computer algebra system" group. To post to this group, send email to fricas-de...@googlegroups.com. To unsubscribe from this group, send email to fricas-devel+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/fricas-devel?hl=en.
