arithmetic ops. The current Expression implementation relies on the use
of normalize for when you want to eliminate algebraically redundant
kernels (informally, subexpressions). There's still the question of why
does simplify not call normalize. I don't know the answer.
Themos Tsikas
On Wednesday 30 July 2008, Gerald Knizia wrote:
How does the function F need to be defined such that the result of F(A,B)
is equal to the one of
rule 'A == B
and the result of F(C,D) is equal to
rule 'C == D
(1) - F(x,y) == _rule(constant x, y)
(6) - )sh OrderedVariableList
OrderedVariableList VariableList: List Symbol is a domain constructor
Abbreviation for OrderedVariableList is OVAR
This constructor is not exposed in this frame.
--- Operations
?? : (%,%) - Boolean
I was using Fricas. In Axiom, can you try this:
(1) - f:= [subscript(a,[i]) for i in 0..1]
(1) [a ,a ]
0 1
Type: List Symbol
(2) - [index(i)$OVAR(f) for i in 1..size()$OVAR(f)::PI]
(2) [a ,a ]
0 1
On Thursday 10 July 2008, Соловьев Александр Александрович wrote:
[ eval(f, [x=i, y=j]) = 0 for i in 0..2 ] for j in 0..2
[[ eval(f, [x=i, y=j]) = 0 for i in 0..2 ] for j in 0..2]
concat %
The Numerical Algorithms Group
Hello
(1) - df :=D(exp(x) + 2*x,x)
x
(1) %e + 2
Type: Expression Integer
(2) - f1: TextFile := open(df.txt, output)
(2) df.txt
Type: TextFile
(3) - for i in
Is this any good?
(u::POLY F)+(f::POLY F)
The Numerical Algorithms Group Ltd is a company registered in England
and Wales with company number 1249803. The registered office is:
Wilkinson House, Jordan Hill Road, Oxford OX2
On Thursday 24 May 2007 08:46, Alasdair McAndrew wrote:
Currently u is 3%C^2 + 2%C + 4, but I want to turn it into 3x^2+2x+4 over
PF p.
Use the coordinates function to get the coefficients and then compose the
polynomial?
(90) - u
3
(90) 3%A + 4%A + 6
Type:
try (numeric %pi) instead of %pi
The Numerical Algorithms Group Ltd is a company registered in England
and Wales with company number 1249803. The registered office is:
Wilkinson House, Jordan Hill Road, Oxford OX2 8DR,
There should be an example input file called ffdemo.input
Here is my copy of it.
Themos Tsikas
--Copyright The Numerical Algorithms Group Limited 1994.
-- finite field demonstrations
-- prime field
-- get a prime
p:=4817
-- construct field
F:=PrimeField p
-- demonstration of common finite field
Hello
The Library domain is for putting AXIOM values from different domains into one
Keyed-Acess-File. It's a useful way for transmitting values from one AXIOM
session to another. Your first session should have created a directory called
data.KAF containing a file called index.KAF and in this
(1) - (a/b)^2 + (a/b)*y + 3*(a/b)*x
2
a b y + 3a b x + a
(1) ---
2
b
Type: Fraction Polynomial Integer
(2) - eval(%,[a=b*R])
2
(2) R y +
(1) - p:=(1+x)^5
5 4 3 2
(1) x + 5x + 10x + 10x + 5x + 1
Type: Polynomial Integer
(2) - VALUES(p)$Lisp
(2) (1 x (5 0 . 1) (4 0 . 5) (3 0 . 10) (2 0 . 10) (1 0 . 5) (0 0 . 1))
You can use upper case variables like (1+X)^5
___
Axiom-mail mailing list
Axiom-mail@nongnu.org
http://lists.nongnu.org/mailman/listinfo/axiom-mail
automatically.
Lots of software out there feature a built-in web server so that a browser can
act as the control. Axiom could do the same for the documentation, system
settings and other automation features.
Themos Tsikas
___
Axiom-mail mailing list
4.1.0 (SUSE Linux)
installed
Themos Tsikas
On Monday 23 October 2006 15:23, ming lu wrote:
Hi group,
I just started to learn axiom and is running it under linux. I got
following error when I tried to build a Fibonacci number. Anyone could
show me what I did wrong?
Thanks,
Ming
(1) - p(0
that your axiom.input definitions are in, issue )frame drop interactively.
What's happening is that AXIOMsys stays with the first initial frame but
axiom starts a client process (AXIOMsys + spadclient) for which
AXIOMsys makes a new frame.
Best Regards
Themos Tsikas
PS. All this applies to the NAG
17 matches
Mail list logo
