Screenshot instructions:
Windows
Mac
Red Hat Linux
Ubuntu
Click URL instructions:
Rightclick on ad, choose "Copy Link", then paste here →
(This may not be possible with some types of ads)
You can subscribe to this list here.
2008 
_{Jan}
(4) 
_{Feb}
(2) 
_{Mar}

_{Apr}

_{May}

_{Jun}

_{Jul}

_{Aug}
(2) 
_{Sep}

_{Oct}
(27) 
_{Nov}

_{Dec}
(6) 

2009 
_{Jan}
(3) 
_{Feb}

_{Mar}

_{Apr}
(1) 
_{May}

_{Jun}
(27) 
_{Jul}

_{Aug}

_{Sep}
(3) 
_{Oct}
(22) 
_{Nov}
(12) 
_{Dec}

2010 
_{Jan}
(11) 
_{Feb}
(3) 
_{Mar}
(2) 
_{Apr}
(11) 
_{May}
(29) 
_{Jun}
(59) 
_{Jul}

_{Aug}
(3) 
_{Sep}
(2) 
_{Oct}
(8) 
_{Nov}
(3) 
_{Dec}

2011 
_{Jan}
(5) 
_{Feb}

_{Mar}

_{Apr}
(6) 
_{May}

_{Jun}

_{Jul}
(13) 
_{Aug}
(4) 
_{Sep}
(4) 
_{Oct}
(19) 
_{Nov}

_{Dec}
(2) 
2012 
_{Jan}
(2) 
_{Feb}
(1) 
_{Mar}
(3) 
_{Apr}

_{May}

_{Jun}

_{Jul}
(1) 
_{Aug}

_{Sep}

_{Oct}

_{Nov}

_{Dec}

2013 
_{Jan}

_{Feb}

_{Mar}

_{Apr}

_{May}
(78) 
_{Jun}
(10) 
_{Jul}

_{Aug}

_{Sep}

_{Oct}

_{Nov}

_{Dec}
(2) 
2014 
_{Jan}
(2) 
_{Feb}

_{Mar}

_{Apr}

_{May}

_{Jun}

_{Jul}

_{Aug}

_{Sep}
(1) 
_{Oct}
(1) 
_{Nov}

_{Dec}

2017 
_{Jan}

_{Feb}
(1) 
_{Mar}

_{Apr}

_{May}

_{Jun}

_{Jul}

_{Aug}
(1) 
_{Sep}

_{Oct}

_{Nov}

_{Dec}

S  M  T  W  T  F  S 





1

2

3

4

5

6
(1) 
7
(1) 
8

9

10

11

12

13

14

15

16

17
(1) 
18

19

20

21

22

23

24

25

26

27

28

29

30

31

From: Gabriel Dos Reis <gdr@cs...>  20090117 03:04:45

OpenAxiom 1.3.0 and higher now supports literal numbers expressed in a radix other than 10 (both in the interpreter and in library). For decimal numbers, the syntax is as usual. For base other than 10, you have to specify the radix first (as a decimal number) followed by the letter 'r', then followed by digits expressing the number. E.g. (1) > 16rdeadbeef (1) 3735928559 Type: PositiveInteger (2) > 16rcafebabe (2) 3405691582 Type: PositiveInteger (3) > 2r111000101001 (3) 3625 Type: PositiveInteger  Gaby 
From: Gabriel Dos Reis <gdr@cs...>  20090107 08:05:50

From: olfa mraihi <olfa.mraihi@ya...>  20090106 15:09:40

Hello Open Axiom community, First wish you happy new year! 2)Could it also solve this system of equations: xP = 1 + a/yP and yPxP <= epsilon ? I want yP in terms of the other variables. 3) Could it solve symbolically system of equations and inequations that mixes :  "numeric" equations(like:t/c^(i/4)=tP/c^(iP/4)) where t,tP,i,iP are variables(integers,reals) and c is a constant.  inequalities (like:i<=iP)  equations with arrays where I want to express symbolically sum of the elements of an array (like:x+Sum[A[k],{k,i,N}]=xP+Sum[A[k], {k,iP,N}]) equations with composition of functions (like(Nest[f,v,j]=Nest[f,vP,jP] wich means f(f(f(..(v)) j times is = to f(f(f(..(vP)) jP times. =>without specifying a concrete value for j and jP equations with lists (like Join[l,m]=Join[lP,mP]which means that the concatenation of lists m and l is equal to the concatenation of lP and mP and where lists m,l,mP and lP are also symbolically expressed) Rq:By symbolically for arrays and lists I mean without specifying in advance the concrete content of them and their lengths. Here is a full example wrote in mathematica andI want to solve iP, jP, lP, mP, nP, tP, ttP, vP, vvP, wP, xP, yP in terms of i, j, l, m, n, t, tt, v, vv, w, x, y : Reduce[ { i<=iP, j>=jP, 1*j+1*i==1*jP+1*iP, mP==Nest[Rest,m,iPi], i+Length[m]==iP+Length[mP], 1*n4*i==1*nP4*iP, 4*i1*n==4*iP1*nP, tt/3^(i/1)==ttP/3^(iP/1), mP==Nest[Rest,m,jjP], jLength[m]==jPLength[mP], 4*j+1*n==4*jP+1*nP, Nest[f,v,j]==Nest[f,vP,jP], tt/3^(j/1)==ttP/3^(jP/1), Join[l,m]==Join[lP,mP], tc*n*(n4)/(2*4)==tPc*nP*(nP4)/(2*4), tt/3^(n/4)==ttP/3^(nP/4), vv+7*tt/(13)==vvP+7*ttP/(13), x+Sum[A[k],{k,i,N}]==xP+Sum[A[k],{k,iP,N}], y+Sum[B[k],{k,1,j}]==yP+Sum[B[k],{k,1,jP}], w+Sum[Nest[f,v,k],{k,1,j}]==wP+Sum[Nest[f,vP,k],{k,1,jP}], (iP==20+1)}, {iP, jP, lP, mP, nP, tP, ttP, vP, vvP, wP, xP, yP},Backsubstitution>True] here: arrays are A and B lists are l,m,lP and mP. and variables of type integer are :x,xP,y,yP,i,iP,j,jP,v,vP,w ,wP,n,nP,t,tP,tt,ttPare variables , c is a constant and f is a function Thank you very much. Yours faithfully, Olfa MRAIHI. 