Re: [sympy] Re: Irreducibility test

2010-03-10 Thread Kasun Samarasinghe
i figured out the way. I will send the patch for review. kasun On Tue, Mar 9, 2010 at 9:02 PM, Kasun Samarasinghe wrote: > but i need to check the gcd for all ni, where ni=n/pi. here pi are the > prime factors of n. So > i have to call gf_pow for all such numbers. what can i do in that case? >

[sympy] Re: New "subs" method

2010-03-10 Thread Mateusz Paprocki
Hi, On Wed, Mar 10, 2010 at 12:28:27PM +0100, Albert Hilbert wrote: > I need to perform some calculations within a ring R in which x**3 = x for > each x in R. > To make simplifications I would have like to do something like: > > >>> p = Wild('p') > >>> q = Wild('q', properties=(lambda w: w.is_Int

[sympy] New "subs" method

2010-03-10 Thread Albert Hilbert
I need to perform some calculations within a ring R in which x**3 = x for each x in R. To make simplifications I would have like to do something like: >>> p = Wild('p') >>> q = Wild('q', properties=(lambda w: w.is_Integer and w > 2,)) >>> (2*x**4 + y**2 - x**2 + y**3).subs(p**q, p**(q - 2*floor((q

[sympy] New "subs" method

2010-03-10 Thread Raffaele
I need to perform some calculations within a ring R in which x**3 = x for each x in R. To make simplifications I would have like to do something like: >>> p = Wild('p') >>> q = Wild('q', properties=(lambda w: w.is_Integer and w > 2,)) >>> (2*x**4 + y**2 - x**2 + y**3).subs(p**q, p**(q - 2*floor((q