Hi Waldek, Unfortunately, you did not in detail comment on what I wrote.
On 10/05/2015 02:17 PM, Waldek Hebisch wrote: > Actually, the case when there is no order is most intersting. > Namely, ordered ring contains copy of integers, so > > random(n)::R > > gives a generic implementation in such case. We need > extra effort to handle other cases. The first nontrivial > case is polynomials over finite field. If you are satisfied with random integers, then that must be stated in the category documentation. In fact, I more and more get the impression that you don't actually want "RandomChoice". What you want is a stream of elements of % that do not repeat. Am I wrong? > Main motivation for this category came from factorization > and gcd. Well. That somehow sounds like you want to easily throw away "unlucky primes". Ralf -- You received this message because you are subscribed to the Google Groups "FriCAS - computer algebra system" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at http://groups.google.com/group/fricas-devel. For more options, visit https://groups.google.com/d/optout.
