You can subscribe to this list here.
2002 
_{Jan}

_{Feb}

_{Mar}

_{Apr}

_{May}

_{Jun}
(67) 
_{Jul}
(61) 
_{Aug}
(49) 
_{Sep}
(43) 
_{Oct}
(59) 
_{Nov}
(24) 
_{Dec}
(18) 

2003 
_{Jan}
(34) 
_{Feb}
(35) 
_{Mar}
(72) 
_{Apr}
(42) 
_{May}
(46) 
_{Jun}
(15) 
_{Jul}
(64) 
_{Aug}
(62) 
_{Sep}
(22) 
_{Oct}
(41) 
_{Nov}
(57) 
_{Dec}
(56) 
2004 
_{Jan}
(48) 
_{Feb}
(47) 
_{Mar}
(33) 
_{Apr}
(39) 
_{May}
(6) 
_{Jun}
(17) 
_{Jul}
(19) 
_{Aug}
(10) 
_{Sep}
(14) 
_{Oct}
(74) 
_{Nov}
(80) 
_{Dec}
(22) 
2005 
_{Jan}
(43) 
_{Feb}
(33) 
_{Mar}
(52) 
_{Apr}
(74) 
_{May}
(32) 
_{Jun}
(58) 
_{Jul}
(18) 
_{Aug}
(41) 
_{Sep}
(71) 
_{Oct}
(28) 
_{Nov}
(65) 
_{Dec}
(68) 
2006 
_{Jan}
(54) 
_{Feb}
(37) 
_{Mar}
(82) 
_{Apr}
(211) 
_{May}
(69) 
_{Jun}
(75) 
_{Jul}
(279) 
_{Aug}
(139) 
_{Sep}
(135) 
_{Oct}
(58) 
_{Nov}
(81) 
_{Dec}
(78) 
2007 
_{Jan}
(141) 
_{Feb}
(134) 
_{Mar}
(65) 
_{Apr}
(49) 
_{May}
(61) 
_{Jun}
(90) 
_{Jul}
(72) 
_{Aug}
(53) 
_{Sep}
(86) 
_{Oct}
(61) 
_{Nov}
(62) 
_{Dec}
(101) 
2008 
_{Jan}
(100) 
_{Feb}
(66) 
_{Mar}
(76) 
_{Apr}
(95) 
_{May}
(77) 
_{Jun}
(93) 
_{Jul}
(103) 
_{Aug}
(76) 
_{Sep}
(42) 
_{Oct}
(55) 
_{Nov}
(44) 
_{Dec}
(75) 
2009 
_{Jan}
(103) 
_{Feb}
(105) 
_{Mar}
(121) 
_{Apr}
(59) 
_{May}
(103) 
_{Jun}
(82) 
_{Jul}
(67) 
_{Aug}
(76) 
_{Sep}
(85) 
_{Oct}
(75) 
_{Nov}
(181) 
_{Dec}
(133) 
2010 
_{Jan}
(107) 
_{Feb}
(116) 
_{Mar}
(145) 
_{Apr}
(89) 
_{May}
(138) 
_{Jun}
(85) 
_{Jul}
(82) 
_{Aug}
(111) 
_{Sep}
(70) 
_{Oct}
(83) 
_{Nov}
(60) 
_{Dec}
(16) 
2011 
_{Jan}
(61) 
_{Feb}
(16) 
_{Mar}
(52) 
_{Apr}
(41) 
_{May}
(34) 
_{Jun}
(41) 
_{Jul}
(57) 
_{Aug}
(73) 
_{Sep}
(21) 
_{Oct}
(45) 
_{Nov}
(50) 
_{Dec}
(28) 
2012 
_{Jan}
(70) 
_{Feb}
(36) 
_{Mar}
(71) 
_{Apr}
(29) 
_{May}
(48) 
_{Jun}
(61) 
_{Jul}
(44) 
_{Aug}
(54) 
_{Sep}
(20) 
_{Oct}
(28) 
_{Nov}
(41) 
_{Dec}
(137) 
2013 
_{Jan}
(62) 
_{Feb}
(55) 
_{Mar}
(31) 
_{Apr}
(23) 
_{May}
(54) 
_{Jun}
(54) 
_{Jul}
(90) 
_{Aug}
(46) 
_{Sep}
(38) 
_{Oct}
(60) 
_{Nov}
(92) 
_{Dec}
(17) 
2014 
_{Jan}
(62) 
_{Feb}
(35) 
_{Mar}
(72) 
_{Apr}
(30) 
_{May}
(97) 
_{Jun}
(81) 
_{Jul}
(63) 
_{Aug}
(64) 
_{Sep}
(28) 
_{Oct}
(45) 
_{Nov}
(48) 
_{Dec}
(109) 
2015 
_{Jan}
(106) 
_{Feb}
(36) 
_{Mar}
(65) 
_{Apr}
(63) 
_{May}
(95) 
_{Jun}
(56) 
_{Jul}
(48) 
_{Aug}
(55) 
_{Sep}
(100) 
_{Oct}
(57) 
_{Nov}
(33) 
_{Dec}
(46) 
2016 
_{Jan}
(76) 
_{Feb}
(53) 
_{Mar}
(88) 
_{Apr}
(79) 
_{May}
(62) 
_{Jun}
(65) 
_{Jul}
(37) 
_{Aug}
(23) 
_{Sep}
(108) 
_{Oct}
(53) 
_{Nov}

_{Dec}

S  M  T  W  T  F  S 


1

2
(1) 
3

4
(2) 
5
(6) 
6
(11) 
7
(1) 
8
(3) 
9
(4) 
10
(9) 
11

12

13

14
(4) 
15

16

17
(8) 
18

19
(1) 
20

21
(2) 
22

23

24

25

26
(1) 
27

28
(2) 
29
(1) 
30

31




From: SourceForge.net <noreply@so...>  20031205 16:54:28

Bugs item #854869, was opened at 20031205 11:54 Message generated for change (Tracker Item Submitted) made by Item Submitter You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=104933&aid=854869&group_id=4933 Category: None Group: None Status: Open Resolution: None Priority: 5 Submitted By: Stavros Macrakis (macrakis) Assigned to: Nobody/Anonymous (nobody) Summary: nounify("!") incorrect Initial Comment: nounify("!") => %factorial But "!" is already declared as a noun: properties("!") => [RULE, GRADEF, OPERATOR, NOUN] so it should return "!"  You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=104933&aid=854869&group_id=4933 
From: SourceForge.net <noreply@so...>  20031205 16:41:36

Bugs item #854861, was opened at 20031205 11:41 Message generated for change (Tracker Item Submitted) made by Item Submitter You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=104933&aid=854861&group_id=4933 Category: None Group: None Status: Open Resolution: None Priority: 5 Submitted By: Stavros Macrakis (macrakis) Assigned to: Nobody/Anonymous (nobody) Summary: concat doesn't do alias lookup/FIX Initial Comment: declare(foo,noun)$ is(foo=concat(f,oo)) => false Solution is simple. Wrap (getalias ...) around the return value (implode...).  You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=104933&aid=854861&group_id=4933 
From: SourceForge.net <noreply@so...>  20031205 16:03:49

Bugs item #854825, was opened at 20031205 11:03 Message generated for change (Tracker Item Submitted) made by Item Submitter You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=104933&aid=854825&group_id=4933 Category: None Group: None Status: Open Resolution: None Priority: 5 Submitted By: Stavros Macrakis (macrakis) Assigned to: Nobody/Anonymous (nobody) Summary: is(feat(sym)) internal error Initial Comment: (C1) declare(feat,feature); (D1) DONE (C2) declare(sym,feat); (D2) DONE (C3) is(feat(sym)); Error: 2147483647 is not of type LIST. Error signalled by QUEUE+P. Maxima 5.9.0 on gcl 2.5.0 mingw32 W2k Athlon  You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=104933&aid=854825&group_id=4933 
From: SourceForge.net <noreply@so...>  20031204 05:08:30

Bugs item #853830, was opened at 20031204 00:08 Message generated for change (Tracker Item Submitted) made by Item Submitter You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=104933&aid=853830&group_id=4933 Category: None Group: None Status: Open Resolution: None Priority: 4 Submitted By: Stavros Macrakis (macrakis) Assigned to: Nobody/Anonymous (nobody) Summary: sum doesn't terminate sometimes/FIX Initial Comment: tellsimpafter(ba,1); sum(1,i,a,b) => infinite loop simp:false; sum(1,i,1,2) => infinite loop The reason is that dosum checks whether low+i=high instead of counting exactly highlow summands. The fix is simple. Instead of: (IF (EQUAL *I HI) (RETURN U)) use (IF (= *HL 0) (RETURN U)) (setq *HL (1 *HL)) Remember that *HL is always a fixnum here.  You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=104933&aid=853830&group_id=4933 
From: SourceForge.net <noreply@so...>  20031204 00:42:23

Bugs item #853720, was opened at 20031203 17:42 Message generated for change (Tracker Item Submitted) made by Item Submitter You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=104933&aid=853720&group_id=4933 Category: Lisp Core Group: None Status: Open Resolution: None Priority: 5 Submitted By: Robert Dodier (robert_dodier) Assigned to: Nobody/Anonymous (nobody) Summary: chain rule applied with commutative multiplication Initial Comment: It appears the chain rule is applied by diff() with commutative multiplication to form "f'(g(x))*g'(x)" as the derivative of "f(g(x))". That is OK if the functions and variables involved are scalars, so that they always commute. However, I've constructed an example for which diff() returns the wrong result. I have a patch which makes it return the correct result. Here is the example problem. We want to compute the derivative of A.x^2 w.r.t. x, where A is a matrix and x is a vector. The derivative of x^2 is 2 transpose(x). The derivative of transpose(x) is the identity matrix. Applying the chain rule, the derivative is 2 transpose(A.x) . A. (C1) declare(A,nonscalar)$ (C2) declare(x,nonscalar)$ (C3) norm2(x):=transpose(x).x$ (C4) gradef('norm2(x),2 .transpose(x))$ (C5) gradef('transpose(x),1)$ (C6) display2d:FALSE$ (C7) diff('norm2(A.x),x); (D7) 2*A*'TRANSPOSE(A . x) < OOPS. The multiplication operator for A times transpose(A.x) should be the noncommutative multiplication, and it should be transpose(A.x) times A. This particular problem can be fixed by changing line 401 of comm.lisp from "#'MUL2" to "#'NCMUL2". Then the return value from diff() is correct. However making that change would introduce noncommutative multiplications into expressions where they don't belong. I guess that there should be some kind of test to see if commutative is OK. What is the right test, and how is it implemented? Note 1. gradef('norm2(x),2 .transpose(x))$ shouldn't be needed, except that diff('norm2(x),x); returns transpose(x)+x, which is wrong, without that gradef(). Note 2. It appears the reason the gradef('norm2(x),...) is needed is because the derivative of transpose(x).A w.r.t. x is transpose(A), but Maxima thinks it is A.  You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=104933&aid=853720&group_id=4933 
From: SourceForge.net <noreply@so...>  20031202 06:33:34

Bugs item #852413, was opened at 20031202 01:33 Message generated for change (Tracker Item Submitted) made by Item Submitter You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=104933&aid=852413&group_id=4933 Category: None Group: None Status: Open Resolution: None Priority: 5 Submitted By: Stavros Macrakis (macrakis) Assigned to: Nobody/Anonymous (nobody) Summary: factor(2^31i) extremely slow/FIX Initial Comment: Number to factor Time 2^311 44 secs 2^3119 20 secs 2^3161 3.6 secs 2^31325 3.3 secs These are absurd numbers, considering how much time it takes for other primes near 2^31: 2^312275 0.1 secs (dominated by overhead) 2^3121757 0.2 secs Surprisingly, numbers > 2^31 (bignums) are also fast: 2^31+11 0.1 secs It turns out that there is a bug in fixnumcfactor, which can be seen by running it interpreted: load("rat3d.lisp")$ factor(2^3161); Error: 2147673649 is not of type FIXNUM. The problem is that (f* divisor divisor) can be greater than maxfixnum. The solution is simple  calculate the maximum divisor using isqrt whenever the factorand is changed. This also has the benefit of making the calculation a little faster for all integers. (defmfun fixnumcfactor (x) (declare (fixnum x)) (prog ((divisor 2) ; current trial divisor (tt 0) ; exponent of divisor (k 2) ; increment of divisor (ans nil) ; result list (maxdivisor 0) ; max divisor to try (intfaclim (if (and $intfaclim (typep $intfaclim 'fixnum)) $intfaclim mostpositivefixnum))) (declare (fixnum divisor tt k maxdivisor intfaclim)) (setq maxdivisor (min (isqrt x) intfaclim)) sett (setq tt 0) loop (cond ((f= 0 (fixnumremainder x divisor)) (setq tt (f+ 1 tt)) (setq x (the fixnum (quot x divisor))) (go loop))) (cond ((> tt 0) (setq ans (cons divisor (cons tt ans)) maxdivisor (min (the fixnum (isqrt x)) intfaclim)))) (cond ((f= divisor 2) (setq divisor 3)) ((f= divisor 3) (setq divisor 5)) (t (setq divisor (f+ divisor k)) (cond ((f= k 2) (setq k 4)) (t (setq k 2))))) (cond ((f> divisor maxdivisor) (return (cond ((f> x 1) (list* x 1 ans)) (t ans))))) (go sett))) With the new code, all numbers < 2^31 factor fast. In fact, we can factor all 2^311000 < i < 2^311 in 4.2 seconds. Maxima 5.9.0 gcl 2.5.0 W2k  You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=104933&aid=852413&group_id=4933 