> @smichr : Did you pull the function you once mentioned in the pull request #
> 390 [1] for solving system of congruence relations where CRT fails? That
> function can be used to do the above task.
It's on the pull request page: search for 'solve_congruence' on page
https://github.com/sympy/sympy
Hi,
I have started working on the issue in the subject line.
( See http://code.google.com/p/sympy/issues/detail?id=1740 )
Things I noticed, questions:
I'm seeing parameters that select primes by index, and parameters that
select primes by magnitude. I'm assuming they should all be protected,
Hi,
I want to convert x**32 + x**15 + x**10 into x**2 + x**3 + x**4 i.e. to
convert power ``p`` into ``p % 6``.
How can I do it?
--
-Regards
Hector
Whenever you think you can or you can't, in either way you are right.
--
You received this message because you are subscribed to the Google Group
Le dimanche 23 octobre 2011 à 01:01 +0530, Hector a écrit :
> Hi,
>
> I want to convert x**32 + x**15 + x**10 into x**2 + x**3 + x**4 i.e.
> to convert power ``p`` into ``p % 6``.
> How can I do it?
You can take the remainder modulo x**6 - 1. That's probably not very
efficient algorithmically, b
On Oct 21, 10:35 pm, Hector wrote:
> I second Aaron's suggestions of making class FiniteRing and put more
> constrains on FintiteField. So, the output **would** be something like -
>
> >>> FF(4)
>
> Error - Z4 is not a filed
There is a finite field of order 4=2^2, so "FF(4)" should either
return
On Sat, Oct 22, 2011 at 4:27 PM, Mike Hansen wrote:
> On Oct 21, 10:35 pm, Hector wrote:
>> I second Aaron's suggestions of making class FiniteRing and put more
>> constrains on FintiteField. So, the output **would** be something like -
>>
>> >>> FF(4)
>>
>> Error - Z4 is not a filed
>
> There is
Le samedi 22 octobre 2011 à 11:05 +0530, Hector a écrit :
>
>
> On Fri, Oct 21, 2011 at 3:49 PM, Chris Smith wrote:
> I just noticed in Integer, too, the invert method which gives
> the
> multiplicative inverse mode n of a number:
>
> >>> invert(S(3),5)
>
> That's the Chinese remainder problem[1]. The solution isn't unique so I
> don't think this should be a classmethod of Integer.
Nearly so, but the routine will construct the number even if the
moduli are not prime. Perhaps it should return a number like '15 mod
17' (FF(17)(15)).
--
You received
