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}
(30) 
_{Sep}

_{Oct}

_{Nov}

_{Dec}

S  M  T  W  T  F  S 




1
(8) 
2
(3) 
3

4
(4) 
5

6

7

8
(2) 
9
(3) 
10
(3) 
11

12
(2) 
13
(1) 
14
(1) 
15

16

17
(2) 
18

19

20
(5) 
21

22

23

24

25

26

27
(7) 
28

29

30

31


From: SourceForge.net <noreply@so...>  20031027 23:47:36

Bugs item #831445, was opened at 20031027 18:44 Message generated for change (Comment added) made by macrakis You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=104933&aid=831445&group_id=4933 Category: None Group: None Status: Open Resolution: None Priority: 5 Submitted By: Stavros Macrakis (macrakis) Assigned to: Nobody/Anonymous (nobody) Summary: gcd/subres  another case Initial Comment: ratsimp of ((SQRT(3)*%I/21/2)*(SQRT(84541)*%I/(6*SQRT(3)) 11/2)^(1/3)+28*(SQRT(3)*%I/21/2)/(3*(SQRT(84541) *%I/(6*SQRT(3))11/2)^(1/3))+4)^312*((SQRT(3)*% I/21/2)*(SQRT(84541)*%I/(6*SQRT(3))11/2)^(1/3) +28*(SQRT(3)*%I/21/2)/(3*(SQRT(84541)*%I/ (6*SQRT(3))11/2)^(1/3))+4)^2+20*((SQRT(3)*%I/2 1/2)*(SQRT(84541)*%I/(6*SQRT(3))11/2)^(1/3)+28* (SQRT(3)*%I/21/2)/(3*(SQRT(84541)*%I/(6*SQRT (3))11/2)^(1/3))+4)+59 gives "quotient by zero" for gcd = subres, red, or algebraic; and an infinite loop (or at least is taking a very long time) for mod. spmod and ez work. Maxima 5.9.0 gcl 2.5.0  >Comment By: Stavros Macrakis (macrakis) Date: 20031027 18:46 Message: Logged In: YES user_id=588346 By the way, all the gcd algorithms work correctly with algebraic:true (not the default).  You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=104933&aid=831445&group_id=4933 
From: SourceForge.net <noreply@so...>  20031027 23:44:51

Bugs item #831445, was opened at 20031027 18:44 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=831445&group_id=4933 Category: None Group: None Status: Open Resolution: None Priority: 5 Submitted By: Stavros Macrakis (macrakis) Assigned to: Nobody/Anonymous (nobody) Summary: gcd/subres  another case Initial Comment: ratsimp of ((SQRT(3)*%I/21/2)*(SQRT(84541)*%I/(6*SQRT(3)) 11/2)^(1/3)+28*(SQRT(3)*%I/21/2)/(3*(SQRT(84541) *%I/(6*SQRT(3))11/2)^(1/3))+4)^312*((SQRT(3)*% I/21/2)*(SQRT(84541)*%I/(6*SQRT(3))11/2)^(1/3) +28*(SQRT(3)*%I/21/2)/(3*(SQRT(84541)*%I/ (6*SQRT(3))11/2)^(1/3))+4)^2+20*((SQRT(3)*%I/2 1/2)*(SQRT(84541)*%I/(6*SQRT(3))11/2)^(1/3)+28* (SQRT(3)*%I/21/2)/(3*(SQRT(84541)*%I/(6*SQRT (3))11/2)^(1/3))+4)+59 gives "quotient by zero" for gcd = subres, red, or algebraic; and an infinite loop (or at least is taking a very long time) for mod. spmod and ez work. Maxima 5.9.0 gcl 2.5.0  You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=104933&aid=831445&group_id=4933 
From: SourceForge.net <noreply@so...>  20031027 23:37:53

Bugs item #711871, was opened at 20030329 12:46 Message generated for change (Comment added) made by macrakis You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=104933&aid=711871&group_id=4933 Category: None Group: None Status: Open Resolution: None Priority: 5 Submitted By: Stavros Macrakis (macrakis) Assigned to: Nobody/Anonymous (nobody) Summary: EZGCD: ratsimp((%i+2)/(%i+1)),gcd:ez inf loop Initial Comment: ratsimp((%i+2)/(%i+1)),gcd:ez; gets into an infinite loop inside ezgcd2. Maxima 5.9.0 GCL 2.5.0 Windows 2000  >Comment By: Stavros Macrakis (macrakis) Date: 20031027 18:37 Message: Logged In: YES user_id=588346 but ratsimp((%i+2)/(%i+1)),gcd:mod,algebraic does not  Comment By: Stavros Macrakis (macrakis) Date: 20031027 17:33 Message: Logged In: YES user_id=588346 ratsimp((%i+2)/(%i+1)),gcd:mod; also gets into an infinite loop.  You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=104933&aid=711871&group_id=4933 
From: SourceForge.net <noreply@so...>  20031027 23:12:00

Bugs item #696818, was opened at 20030303 15:15 Message generated for change (Comment added) made by macrakis You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=104933&aid=696818&group_id=4933 Category: None Group: None Status: Open Resolution: None Priority: 6 Submitted By: Stavros Macrakis (macrakis) Assigned to: Nobody/Anonymous (nobody) Summary: Taylor internal error (rat problem?) Initial Comment: taylor(asin(sin(x)+e),x,0,2) => Quotient by a polynomial of higher degree taylor(log(sqrt(e*%e^x+1)+e),x,0,2) => Quotient by a polynomial of higher degree Maxima version: 5.9.0 Maxima build date: 19:10 2/9/2003 host type: i686pcmingw32 lispimplementationtype: Kyoto Common Lisp lispimplementationversion: GCL25.0  >Comment By: Stavros Macrakis (macrakis) Date: 20031027 18:11 Message: Logged In: YES user_id=588346 gcd:'algebraic (which calls subres internally) also fails.  Comment By: Stavros Macrakis (macrakis) Date: 20030303 16:51 Message: Logged In: YES user_id=588346 Fateman suggested: > Sometimes changing the GCD algorithm to one without > a bug in it helps. gcd:subres for example. Thanks for the tip. Here are results with the different GCD algorithms. Subres/oldgcd is the default in 5.9.0, though the documentation says the default is Spmod/zgcd. The doc also claims that subres is the "new algorithm", though internally, confusingly, the Subres option calls oldgcd; has the mapping between names and functions changed?  taylor(asin(sin(x)+e),x,0,2),gcd:XXX; EZ OK =ezgcd2 SPMOD OK =zgcd FALSE OK MOD OK =newgcd (MOD option in code, not documented) SUBRES error =oldgcd RED error =oldgcd EEZ "EEZGCD is invalid as a function" SPHEN "SPHGCD is invalid as a function" (SPHEN option in code, not documented)  You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=104933&aid=696818&group_id=4933 
From: SourceForge.net <noreply@so...>  20031027 22:34:32

Bugs item #711871, was opened at 20030329 12:46 Message generated for change (Comment added) made by macrakis You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=104933&aid=711871&group_id=4933 Category: None Group: None Status: Open Resolution: None Priority: 5 Submitted By: Stavros Macrakis (macrakis) Assigned to: Nobody/Anonymous (nobody) Summary: EZGCD: ratsimp((%i+2)/(%i+1)),gcd:ez inf loop Initial Comment: ratsimp((%i+2)/(%i+1)),gcd:ez; gets into an infinite loop inside ezgcd2. Maxima 5.9.0 GCL 2.5.0 Windows 2000  >Comment By: Stavros Macrakis (macrakis) Date: 20031027 17:33 Message: Logged In: YES user_id=588346 ratsimp((%i+2)/(%i+1)),gcd:mod; also gets into an infinite loop.  You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=104933&aid=711871&group_id=4933 
From: SourceForge.net <noreply@so...>  20031027 21:46:45

Bugs item #831354, was opened at 20031027 16:45 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=831354&group_id=4933 Category: None Group: None Status: Open Resolution: None Priority: 5 Submitted By: Stavros Macrakis (macrakis) Assigned to: Nobody/Anonymous (nobody) Summary: beta(2,1) inconsistent Initial Comment: beta(2, 1) => 1/2 beta(2.0, 1) => 0.5 BUT beta(2.0, 1.0) => 0.25 The fundamental problem is that beta(x,y) is undefined as a continuous real function of both x and y at (2,1), but that beta(x,1) can be extended to be a well behaved continuous function of x, namely 1/x. This is essentially the same case as x^y at (0,0). Right now, Maxima simplifies x^0=>1 and 0^x=>0 (just like beta(x,1)). The difference is that Maxima gives an error for 0^0, 0.0^0, etc. Longerterm, it would be nice if 0^x kept as a side condition (x # 0) of the simplification, but for now....  You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=104933&aid=831354&group_id=4933 
From: SourceForge.net <noreply@so...>  20031027 17:25:16

Bugs item #831163, was opened at 20031027 12:25 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=831163&group_id=4933 Category: None Group: None Status: Open Resolution: None Priority: 5 Submitted By: Stavros Macrakis (macrakis) Assigned to: Nobody/Anonymous (nobody) Summary: part(x) should give warning Initial Comment: part(x) returns x. This is of course perfectly consistent (the null case), but it is certainly an error if actually input this way. True, it might be useful in the case apply(part,cons (expression,specifier)), where specifier is an argument, possibly the empty list, but using apply this way is somewhat unclean. I would prefer that there be an explicit form of part where the specifier is a list. The problem with that solution, of course, is that we'd then need corresponding versionf of substpart, inpart, substinpart. Yecch. For now, I would recommend giving a warning message for this case. It would be nice if there could, however, be only one such warning per interaction. I don't think we do anything like that right now.  You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=104933&aid=831163&group_id=4933 