# Changeset 9d6f3a in git for Singular/LIB/modstd.lib

Ignore:
Timestamp:
Nov 4, 2009, 2:39:32 PM (14 years ago)
Branches:
(u'spielwiese', 'd0474371d8c5d8068ab70bfb42719c97936b18a6')
Children:
d4a2c308a86a41c2637ba8e3d31b5ed78b9f2ee7
Parents:
151f85d6b8f7459eb6a91452f5ce85020f49ae7a
Message:
```*hannes: use bigint instead of number

File:
1 edited

Unmodified
Removed
• ## Singular/LIB/modstd.lib

 r151f85 poly result; number n; number N=L[1]; bigint N=L[1]; for(i=size(L);i>1;i--) { while(h!=0) { n=Farey(N,leadcoef(h)); n=Farey(N,bigint(leadcoef(h))); result=result+n*p; h=h-lead(h); number n; number N=L[1]; bigint N=L[1]; for(i=2;i<=size(L);i++) { } n=chineseR(TT,L,N); n=Farey(N,n); n=Farey(N,bigint(n)); result=result+n*p; } int i,j; number n; number N=L[1]; bigint N=L[1]; for(i=2;i<=size(L);i++) { if (p==0) {break;} p=p-lead(p); n=Farey(N,leadcoef(p)); n=Farey(N,bigint(leadcoef(p))); result=result+n*leadmonom(p); } } /////////////////////////////////////////////////////////////////////////////// proc Farey (number P, number N) proc Farey (bigint P, bigint N) "USAGE:  Farey (P,N); P, N number; RETURN:  a rational number a/b such that a/b=N mod P if (P<0){P=-P;} if (N<0){N=N+P;} number A,B,C,D,E; bigint A,B,C,D,E; E=P; B=1; if (2*N^2
Note: See TracChangeset for help on using the changeset viewer.