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

_{Feb}

_{Mar}

_{Apr}

_{May}

_{Jun}

_{Jul}

_{Aug}

_{Sep}

_{Oct}

_{Nov}
(20) 
_{Dec}
(17) 

2002 
_{Jan}
(39) 
_{Feb}
(21) 
_{Mar}
(33) 
_{Apr}
(135) 
_{May}
(53) 
_{Jun}
(88) 
_{Jul}
(47) 
_{Aug}
(59) 
_{Sep}
(207) 
_{Oct}
(40) 
_{Nov}
(7) 
_{Dec}
(26) 
2003 
_{Jan}
(49) 
_{Feb}
(39) 
_{Mar}
(117) 
_{Apr}
(50) 
_{May}
(62) 
_{Jun}
(6) 
_{Jul}
(19) 
_{Aug}
(24) 
_{Sep}
(11) 
_{Oct}
(11) 
_{Nov}
(49) 
_{Dec}
(9) 
2004 
_{Jan}
(29) 
_{Feb}
(123) 
_{Mar}
(32) 
_{Apr}
(53) 
_{May}
(52) 
_{Jun}
(19) 
_{Jul}
(33) 
_{Aug}
(10) 
_{Sep}
(76) 
_{Oct}
(86) 
_{Nov}
(171) 
_{Dec}
(163) 
2005 
_{Jan}
(147) 
_{Feb}
(121) 
_{Mar}
(120) 
_{Apr}
(126) 
_{May}
(120) 
_{Jun}
(213) 
_{Jul}
(76) 
_{Aug}
(79) 
_{Sep}
(140) 
_{Oct}
(83) 
_{Nov}
(156) 
_{Dec}
(202) 
2006 
_{Jan}
(181) 
_{Feb}
(171) 
_{Mar}
(157) 
_{Apr}
(98) 
_{May}
(96) 
_{Jun}
(97) 
_{Jul}
(193) 
_{Aug}
(76) 
_{Sep}
(130) 
_{Oct}
(63) 
_{Nov}
(196) 
_{Dec}
(253) 
2007 
_{Jan}
(256) 
_{Feb}
(293) 
_{Mar}
(276) 
_{Apr}
(258) 
_{May}
(181) 
_{Jun}
(91) 
_{Jul}
(108) 
_{Aug}
(69) 
_{Sep}
(107) 
_{Oct}
(179) 
_{Nov}
(137) 
_{Dec}
(121) 
2008 
_{Jan}
(124) 
_{Feb}
(129) 
_{Mar}
(192) 
_{Apr}
(201) 
_{May}
(90) 
_{Jun}
(86) 
_{Jul}
(115) 
_{Aug}
(142) 
_{Sep}
(49) 
_{Oct}
(91) 
_{Nov}
(95) 
_{Dec}
(218) 
2009 
_{Jan}
(230) 
_{Feb}
(149) 
_{Mar}
(118) 
_{Apr}
(72) 
_{May}
(77) 
_{Jun}
(68) 
_{Jul}
(102) 
_{Aug}
(72) 
_{Sep}
(89) 
_{Oct}
(76) 
_{Nov}
(125) 
_{Dec}
(86) 
2010 
_{Jan}
(75) 
_{Feb}
(90) 
_{Mar}
(89) 
_{Apr}
(121) 
_{May}
(111) 
_{Jun}
(66) 
_{Jul}
(75) 
_{Aug}
(66) 
_{Sep}
(66) 
_{Oct}
(166) 
_{Nov}
(121) 
_{Dec}
(73) 
2011 
_{Jan}
(74) 
_{Feb}

_{Mar}

_{Apr}
(14) 
_{May}
(22) 
_{Jun}
(31) 
_{Jul}
(53) 
_{Aug}
(37) 
_{Sep}
(23) 
_{Oct}
(25) 
_{Nov}
(31) 
_{Dec}
(28) 
2012 
_{Jan}
(18) 
_{Feb}
(11) 
_{Mar}
(32) 
_{Apr}
(17) 
_{May}
(48) 
_{Jun}
(37) 
_{Jul}
(23) 
_{Aug}
(54) 
_{Sep}
(15) 
_{Oct}
(11) 
_{Nov}
(19) 
_{Dec}
(22) 
2013 
_{Jan}
(11) 
_{Feb}
(32) 
_{Mar}
(24) 
_{Apr}
(37) 
_{May}
(31) 
_{Jun}
(14) 
_{Jul}
(26) 
_{Aug}
(33) 
_{Sep}
(40) 
_{Oct}
(21) 
_{Nov}
(36) 
_{Dec}
(84) 
2014 
_{Jan}
(23) 
_{Feb}
(20) 
_{Mar}
(27) 
_{Apr}
(24) 
_{May}
(31) 
_{Jun}
(27) 
_{Jul}
(34) 
_{Aug}
(26) 
_{Sep}
(21) 
_{Oct}
(45) 
_{Nov}
(23) 
_{Dec}
(73) 
2015 
_{Jan}
(33) 
_{Feb}
(8) 
_{Mar}
(24) 
_{Apr}
(45) 
_{May}
(27) 
_{Jun}
(19) 
_{Jul}
(21) 
_{Aug}
(51) 
_{Sep}
(43) 
_{Oct}
(29) 
_{Nov}
(61) 
_{Dec}
(86) 
2016 
_{Jan}
(99) 
_{Feb}
(52) 
_{Mar}
(80) 
_{Apr}
(61) 
_{May}
(24) 
_{Jun}
(23) 
_{Jul}
(36) 
_{Aug}
(30) 
_{Sep}
(41) 
_{Oct}
(43) 
_{Nov}
(27) 
_{Dec}
(46) 
2017 
_{Jan}
(57) 
_{Feb}
(34) 
_{Mar}
(36) 
_{Apr}

_{May}

_{Jun}

_{Jul}

_{Aug}

_{Sep}

_{Oct}

_{Nov}

_{Dec}

S  M  T  W  T  F  S 


1
(4) 
2
(10) 
3
(3) 
4
(8) 
5
(1) 
6

7

8
(1) 
9

10

11

12

13

14
(3) 
15
(1) 
16

17

18
(1) 
19

20

21

22

23

24
(1) 
25
(2) 
26
(2) 
27

28

29

30





From: Robert Dodier <robert_dodier@us...>  20130426 07:06:37

This is an automated email from the git hooks/postreceive script. It was generated because a ref change was pushed to the repository containing the project "Maxima CAS". The branch, master has been updated via 1387024eb853404f1ea0deda0ddb3ce99aa5db0f (commit) via 1c06855a73f3d6b0125660408a659ce7642ed5ef (commit) from f9382869a8153ce3f721367b4b22a2fdfa670157 (commit) Those revisions listed above that are new to this repository have not appeared on any other notification email; so we list those revisions in full, below.  Log  commit 1387024eb853404f1ea0deda0ddb3ce99aa5db0f Merge: 1c06855 f938286 Author: robert_dodier <robert_dodier@...> Date: Fri Apr 26 00:06:13 2013 0700 Merge branch 'master' of ssh://git.code.sf.net/p/maxima/code commit 1c06855a73f3d6b0125660408a659ce7642ed5ef Author: robert_dodier <robert_dodier@...> Date: Fri Apr 26 00:05:20 2013 0700 Remove share/contrib/powers.lisp at the request of its author, Barton Willis. (Oops, take 2. I didnt actually remove it from Git on the first try.) diff git a/share/contrib/powers.lisp b/share/contrib/powers.lisp deleted file mode 100644 index a84b85f..0000000  a/share/contrib/powers.lisp +++ /dev/null @@ 1,297 +0,0 @@ ;; Maxima code for extracting powers, finding leading and trailing ;; coefficients, and finding the degree of polynomials.  ;; Author Barton Willis, University of Nebraska at Kearney (aka UNK) ;; December 2001, December 2002  ;; License: GPL ;; The user of this code assumes all risk for its use. It has no warranty. ;; If you don't know the meaning of "no warranty," don't use this code. :)  (inpackage :maxima) ($put '$powers 1 '$version)  ;; Acknowledgement: Dan Stanger helped find and correct bugs. He ;; also wrote user documentation and a test routine.  ;; posintp(x) returns true iff x is a positive integer or if x has been declared ;; to be an integer and has been assumed to be greater than zero. Thus  ;; (C1) declare(m, integer)$ ;; (C2) assume(m > 0)$ ;; (C3) posintp(m); ;; (D3) TRUE ;; posintp isn't used by any functions in powers; it could be expunged.  (defun $posintp (x)  (and (or ($integerp x) ($featurep x '$integer)) (mgrp x 0)))  ;; Set ratfac to nil, return rat(e,x), and reset ratfac to ;; its previous value.  (defun myrat (e &rest x)  (let ((saveratfac $ratfac))  (setq $ratfac nil)  (unwindprotect  (apply '$rat `(,e ,@x))  (setq $ratfac saveratfac))))  ;; If x list a Maxima list of symbols, return true iff the expression p ;; doesn't depend on any member of x. If x is a symbol, return true ;; iff p doesn't depend on x. This function is similar to $freeof, but ;; it maybe somewhat more efficient when p is a CRE expression. Finally, ;; if x (any member of x when x is a Maxima list) isn't a symbol signal ;; an error.  (defun $ratfreeof (x p)  (setq x (requirelistofsymbols x "$ratfreeof" 2))  (let ((pvars (cdr ($showratvars p))))  (cond ((every #'(lambda (z) (or ($symbolp z) ($subvarp z))) pvars)  (every #'(lambda (z) (null (member z pvars :test #'like))) x))  (t  (setq p ($totaldisrep p))  (every #'(lambda(z) ($freeof ($totaldisrep z) p)) x)))))  ;; variablep(e) evaluates to true if and only if e is a nonconstant symbol ;; or a subscripted symbol. Because symbolp(pi) evaluates to true, we need to ;; check whether cd mae is constant.  (defun $variablep (e)  (and (or ($symbolp e) ($subvarp e)) (not ($constantp e))))  ;; ordinal_string(i) returns the ordinal name of the integer i. When ;; i > 10, i < 1, or i isn't an integer, give up and return ith.  (defun $ordinal_string (i)  (case i  (1 "first")  (2 "second")  (3 "third")  (4 "fourth")  (5 "fifth")  (6 "sixth")  (7 "seventh")  (8 "eighth")  (9 "ninth")  (10 "tenth")  (otherwise  (format nil "~Ath" (mfuncall '$string i)))))  ;; If variablep(v) evaluates to false, signal an error saying that ;; the ith argument of the function f requires a symbol; otherwise, ;; return true.  (defun requiresymbol (v f i)  (if (not ($variablep v))  (merror "The ~A argument of ~:M must be a symbol, instead found ~:M"  ($ordinal_string i) f v) t))  ;; If v is a Maxima list and each element of v is a symbol, return the ;; cdr of v. When v isn't a list, but is a symbol, return the Lisp list ;; (list v). Otherwise signal an error saying that the ith argument of the ;; function f requires a symbol or a list of symbols.  (defun requirelistofsymbols (v f i)  (let ((x))  (if ($listp v) (setq x (cdr v)) (setq x (list v)))  (if (every #'$variablep x) x  (merror "The ~A argument of ~:M must be a symbol or a list of symbols, instead found ~:M" ($ordinal_string i) f v))))  (defun requirepoly (p v f i)  (setq p (myrat p v))  (if ($polynomialp p v) p  (merror "The ~A argument of ~:M requires a polynomial, instead found ~:M" ($ordinal_string i) f p)))  (defun requirenonlist (e f i)  (if ($listp e)  (merror "The ~A argument of ~:M requires a nonlist, instead found ~:M"  ($ordinal_string i) f e)))  ;; Return a Maxima list of the nonconstant rat variables in e.  (defun nonconstantratvars (e)  (let ((v (cdr ($showratvars e)))  (acc))  (dolist (vi v `((mlist simp) ,@acc))  (if (not ($constantp vi)) (push vi acc)))))  ;; If e is a list, map $powers over the list. If e is a sum of powers ;; of powers of x, return a list of the exponents.  (defun $powers (e x)  (requiresymbol x "$powers" 2)  (cond (($listp e)  (cons '(mlist simp) (mapcar #'(lambda (p) ($powers p x)) (cdr e))))  (t  (setq e (requirepoly (myrat e x) x "$powers" 1))  (cond (($ratfreeof x e)  `((mlist simp) 0))  (t  (cons '(mlist simp) (odds (cadr e) 0)))))))  ;; odds is defined in mactex.lisp. Here is its definition.  (defun odds (n c)  ;; if c = 1, get the odd terms (first, third...)  (cond ((null n) nil)  ((= c 1) (cons (car n) (odds (cdr n) 0)))  ((= c 0) (odds (cdr n) 1))))  ;; Return the highest power of the polynomial e in the variable x.  (defun $hipower (e x)  (requiresymbol x "$hipower" 2)  (setq e (requirepoly (myrat e x) x "$hipower" 1))  (if (or ($constantp e) ($ratfreeof x e)) 0 (cadadr e)))  ;; Return the lowest power of the polynomial e in the variable x.  (defun $lowpower (e x)  (requiresymbol x "$lowpower" 2)  (setq e (requirepoly (myrat e x) x "$lowpower" 1))  (if (or ($constantp e) ($ratfreeof x e)) 0 (nth 1 (reverse (cadr e)))))  ;; Flatten a Maxima list.  (defun flattenlist (e)  (cond (($listp e)  (let ((acc))  (dolist (ei (cdr e) (cons '(mlist simp) (nreverse acc)))  (setq acc (if ($listp ei) (nconc (cdr (flattenlist ei)) acc)  (cons ei acc))))))  (t e)))  ;; If e is a sum of powers of x, return a list of the coefficients ;; of powers of x. When e isn't a sum of powers, return false. This ;; function is based on a Macsyma function written by A.D. Kennedy and ;; referenced in "Mathematics and System Reference Manual," 16th edition, ;; 1996.  (defun $allcoeffs (e x)  (flattenlist (allcoeffs e x)))  (defun allcoeffs (e x)  (cond (($listp e)  (cons '(mlist simp) (mapcar #'(lambda (s) (allcoeffs s x)) (cdr e))))  (($listp x)  (cond ((= 0 ($length x)) e)  (t (allcoeffs (allcoeffs e ($first x)) ($rest x)))))  (t  (requiresymbol x "$allcoeffs" 2)  (setq e (myrat e x))  (let ((p ($powers e x)))  (cons '(mlist simp)  (mapcar #'(lambda (n) ($ratcoef e x n)) (cdr p)))))))  ;; Return the coefficient of the term of the polynomial e that ;; contains the highest power of x. When x = [x1,x2,...,xn], return ;; lcoeff(lcoeff( ... (lcoeff(e,x1),x2),...,xn)...)  (defun $lcoeff (e &optional v)  (requirenonlist e "$lcoeff" 1)  (if (null v) (setq v (nonconstantratvars e)))  (lcoeff (requirepoly (myrat e) v "$lcoeff" 1)  (requirelistofsymbols v "$lcoeff" 2)))  (defun lcoeff (e x)  (if (null x) e (lcoeff ($ratcoef e (car x) ($hipower e (car x))) (cdr x))))  ;; Return the coefficient of the term of the polynomial e that ;; contains the least power of x. When x = [x1,x2,...,xn], return ;; lcoeff(lcoeff( ... (lcoeff(e,x1),x2),...,xn)...)  (defun $tcoeff (e &optional v)  (requirenonlist e "$tcoeff" 1)  (if (null v) (setq v (nonconstantratvars e)))  (tcoeff (requirepoly (myrat e) v "$tcoeff" 1)  (requirelistofsymbols v "$tcoeff" 2)))  (defun tcoeff (e x)  (if (null x) e (tcoeff ($ratcoef e (car x) ($lowpower e (car x))) (cdr x))))  ;; Return the degree of the symbol x in the polynomial p. When ;; x is a list, degree(p, [x1,x2,...,xn]) returns ;; degree(p,x1) + degree(lcoeff(p, x1),[x2,...xn]). ;; Finally, degree(p,[]) returns 0.  (defun $degree (p x)  (degree (requirepoly (myrat p) x "$degree" 1)  (requirelistofsymbols x "$degree" 2)))  (defun degree (p x)  (if (null x) 0  (add ($hipower p (car x)) (degree (lcoeff p `(,(car x))) (cdr x)))))  ;; Return the total degree of the polynomial. Four cases: ;; (a) total_degree(p) returns the total degree of the polynomial ;; in the variables listofvars(p). ;; (b) total_degree(p,x), where x isn't a list returns the ;; total_degree of p in the variable x. ;; (c) total_degree(p,[x1,x2,...,xn]), where x = [x1,x2,...,xn] ;; returns the total_degree of p in the variables x1 thru xn. ;; (d) total_degree(p,x1,x2,...xn), where the x's are symbols ;; returns the total_degree of p in the variables x1 thru xn.  (defun $total_degree (p &optional v)  (if (null v) (setq v (nonconstantratvars p)))  (setq v (requirelistofsymbols v "$total_degree" 2))  (totaldegree (cadr (apply 'myrat `(,p ,@v)))))  (defun totaldegree (e)  (cond ((consp (nth 2 e))  (+ (nth 1 e) (totaldegree (nth 2 e))))  (t  (nth 1 e))))  (defun $lcm (p q)  (nth 1 ($divide (mul p q) ($gcd p q))))  ;; Compute the spolynomial of f and g. For a definition of the ;; spolynomial, see Davenport, Siret, and Tournier, "Computer Algebra," ;; 1988, page 100.  (defun $spoly (f g v)  (setq v (cons '(mlist simp) (requirelistofsymbols v "$spoly" 3)))  (setq f (myrat f))  (setq g (myrat g))  (let ((fp ($lterm f v))  (gp ($lterm g v)))  (mul ($lcm fp gp) (add (div f fp) (mul 1 (div g gp))))))  (defun $lterm (p &optional v)  (if (null v) (setq v (nonconstantratvars p)))  (lterm (requirepoly (myrat p) v "$lterm" 1)  (requirelistofsymbols v "$lterm" 2)))  (defun lterm (p v)  (cond ((null v) p)  (t  (let* ((vo (car v))  (n ($hipower p vo)))  (lterm (mult ($ratcoef p vo n) (power vo n)) (cdr v))))))  (defun $get_exponents (p x)  (setq x (requirelistofsymbols x "$get_exponents" 2))  (let ((acc))  (setq p (myrat p))  (requirepoly p (cons '(mlist simp) x) "$get_exponents" 1)  (dolist (xi x (cons '(mlist simp) (nreverse acc)))  (push ($hipower p xi) acc)  (setq p ($lcoeff p xi)))))  ;; Return true iff and only if e is a polynomial in the variables var.  (defun $polynomialp (e &optional vars cp ep)  (declare (ignore cp ep))  (if (null vars) (setq vars (nonconstantratvars e)))  (setq vars (requirelistofsymbols vars "$polynomialp" 2))  (setq vars `((mlist simp) ,@vars))  (and (every #'(lambda (x) (or ($variablep x) ($ratfreeof vars x)  ($constantp x)))  (cdr ($showratvars e)))  (not ($taylorp e)) ($ratfreeof vars ($ratdenom e))))       Summary of changes: share/contrib/powers.lisp  297  1 files changed, 0 insertions(+), 297 deletions() delete mode 100644 share/contrib/powers.lisp hooks/postreceive  Maxima CAS 
From: Rupert Swarbrick <rswarbrick@us...>  20130426 00:00:34

This is an automated email from the git hooks/postreceive script. It was generated because a ref change was pushed to the repository containing the project "Maxima CAS". The branch, master has been updated via f9382869a8153ce3f721367b4b22a2fdfa670157 (commit) from c02df674838dda1352387cbb9322414a67fa3f18 (commit) Those revisions listed above that are new to this repository have not appeared on any other notification email; so we list those revisions in full, below.  Log  commit f9382869a8153ce3f721367b4b22a2fdfa670157 Author: Rupert Swarbrick <rswarbrick@...> Date: Thu Apr 25 14:48:18 2013 +0100 Write the var > mvar change into includemaxima.texi.in I locally edited includemaxima.texi by accident, which of course doesn't get pushed to the main repository. Oops. diff git a/doc/info/includemaxima.texi.in b/doc/info/includemaxima.texi.in index 7505167..9769ced 100644  a/doc/info/includemaxima.texi.in +++ b/doc/info/includemaxima.texi.in @@ 30,7 +30,7 @@ ENDINFODIRENTRY @end ifinfo @ifinfo @... var {expr} +@macro mvar {expr} <\expr\> @end macro @end ifinfo  Summary of changes: doc/info/includemaxima.texi.in  2 + 1 files changed, 1 insertions(+), 1 deletions() hooks/postreceive  Maxima CAS 