/usr/share/axiom-20170501/input/lindep.input is in axiom-test 20170501-3.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 | )set break resume
)spool lindep.output
)set message test on
)set message auto off
)clear all
--S 1 of 10
v(i:INT):DIRPROD(5, FRAC INT) ==
directProduct vector [i / (i + j) for j in 0..4]
--R
--R Function declaration v : Integer -> DirectProduct(5,Fraction(Integer
--R )) has been added to workspace.
--R Type: Void
--E 1
--S 2 of 10
V := vector [v i for i in 1..6]
--R
--R Compiling function v with type Integer -> DirectProduct(5,Fraction(
--R Integer))
--R
--R (2)
--R 1 1 1 1 2 1 2 1 3 3 1 3 4 2 4 1 5 5 5 5 6 3 2 3
--R [[1,-,-,-,-],[1,-,-,-,-],[1,-,-,-,-],[1,-,-,-,-],[1,-,-,-,-],[1,-,-,-,-]]
--R 2 3 4 5 3 2 5 3 4 5 2 7 5 3 7 2 6 7 8 9 7 4 3 5
--R Type: Vector(DirectProduct(5,Fraction(Integer)))
--E 2
--S 3 of 10
linearlyDependentOverZ? V
--R
--R
--R (3) true
--R Type: Boolean
--E 3
--S 4 of 10
linearDependenceOverZ V
--R
--R
--R (4) [- 1,15,- 70,140,- 126,42]
--R Type: Union(Vector(Integer),...)
--E 4
--S 5 of 10
solveLinearlyOverQ(delete(V, 2), V.2)
--R
--R
--R 1 14 28 42 14
--R (5) [--,--,- --,--,- --]
--R 15 3 3 5 5
--R Type: Union(Vector(Fraction(Integer)),...)
--E 5
--S 6 of 10
w(i:INT):SQMATRIX(2, INT) ==
squareMatrix matrix [[i, i + 1], [i - 1, -i]]
--R
--R Function declaration w : Integer -> SquareMatrix(2,Integer) has been
--R added to workspace.
--R Type: Void
--E 6
--S 7 of 10
W := vector [w i for i in 1..3]
--R
--R Compiling function w with type Integer -> SquareMatrix(2,Integer)
--R
--R +1 2 + +2 3 + +3 4 +
--R (7) [| |,| |,| |]
--R +0 - 1+ +1 - 2+ +2 - 3+
--R Type: Vector(SquareMatrix(2,Integer))
--E 7
--S 8 of 10
linearlyDependentOverZ? W
--R
--R
--R (8) true
--R Type: Boolean
--E 8
--S 9 of 10
linearDependenceOverZ W
--R
--R
--R (9) [1,- 2,1]
--R Type: Union(Vector(Integer),...)
--E 9
--S 10 of 10
solveLinearlyOverQ(delete(W, 2), W.2)
--R
--R
--R 1 1
--R (10) [-,-]
--R 2 2
--R Type: Union(Vector(Fraction(Integer)),...)
--E 10
)spool
)lisp (bye)
|