Changeset 7540:900632af4ad1
- Timestamp:
- 12/03/07 21:40:16 (5 years ago)
- Branch:
- default
- Location:
- sage
- Files:
-
- 4 edited
-
calculus/wester.py (modified) (1 diff)
-
modular/modsym/subspace.py (modified) (2 diffs)
-
modular/ssmod/ssmod.py (modified) (1 diff)
-
rings/polynomial/polynomial_element.pyx (modified) (2 diffs)
Legend:
- Unmodified
- Added
- Removed
-
sage/calculus/wester.py
r7531 r7540 398 398 399 399 sage: print d.factor() 400 (-1) * ( -a + b) * (a - c) * (b - c) * (a - d) * (b - d) * (c - d)400 (-1) * (c - d) * (b - d) * (b - c) * (-a + b) * (a - d) * (a - c) 401 401 402 402 sage: # Find the eigenvalues of a 3x3 integer matrix. -
sage/modular/modsym/subspace.py
r5510 r7540 126 126 adjoin the star involution. 127 127 128 The factors are sorted by dimension -- don't depend on much more for now. 129 128 130 ASSUMPTION: self is a module over the anemic Hecke algebra. 129 131 … … 136 138 (Modular Symbols subspace of dimension 1 of Modular Symbols space of dimension 3 for Gamma_0(11) of weight 2 with sign 0 over Rational Field) 137 139 sage: [A.T(2).matrix() for A, _ in D] 138 [[-2], [ -2], [3]]140 [[-2], [3], [-2]] 139 141 sage: [A.star_eigenvalues() for A, _ in D] 140 [[ 1], [-1], [1]]142 [[-1], [1], [1]] 141 143 142 144 In this example there is one old factor squared. -
sage/modular/ssmod/ssmod.py
r3523 r7540 16 16 (Vector space of degree 33 and dimension 1 over Finite Field of size 97 17 17 Basis matrix: 18 [ 0 0 0 1 96 96 1 0 95 1 1 1 1 95 2 96 0 0 96 96 0 0 96 2 96 96 2 0 0 1 1 95 0], True),18 [ 0 0 0 1 96 96 1 96 96 0 2 96 96 0 1 0 1 2 95 0 1 1 0 1 0 95 0 96 95 1 96 0 2], True), 19 19 (Vector space of degree 33 and dimension 1 over Finite Field of size 97 20 20 Basis matrix: 21 [ 0 1 96 16 75 22 81 0 0 17 17 80 80 0 0 16 1 40 74 23 57 96 81 0 23 74 0 0 0 2473 0 0], True),21 [ 0 1 96 75 16 81 22 17 17 0 0 80 80 1 16 40 74 0 0 96 81 23 57 74 0 0 0 24 0 23 73 0 0], True), 22 22 (Vector space of degree 33 and dimension 1 over Finite Field of size 97 23 23 Basis matrix: 24 [ 0 1 96 90 90 7 7 0 0 6 91 6 91 0 0 7 13 0 91 6 0 84 90 0 91 6 0 0 0 907 0 0], True)24 [ 0 1 96 90 90 7 7 6 91 0 0 91 6 13 7 0 91 0 0 84 90 6 0 6 0 0 0 90 0 91 7 0 0], True) 25 25 ] 26 26 sage: len(D) -
sage/rings/polynomial/polynomial_element.pyx
r7532 r7540 1539 1539 sage: R.<x> = RealField(100)[] 1540 1540 sage: F = factor(x^2-3); F 1541 (1.0000000000000000000000000000*x + 1.7320508075688772935274463415) * (1.0000000000000000000000000000*x -1.7320508075688772935274463415)1541 (1.0000000000000000000000000000*x - 1.7320508075688772935274463415) * (1.0000000000000000000000000000*x + 1.7320508075688772935274463415) 1542 1542 sage: expand(F) 1543 1543 1.0000000000000000000000000000*x^2 - 3.0000000000000000000000000000 … … 2514 2514 [(1, 1), (-1, 1)] 2515 2515 sage: f.roots(ring=QQ) 2516 [( 1, 1), (-1, 1), (3/2, 1)]2516 [(3/2, 1), (1, 1), (-1, 1)] 2517 2517 2518 2518 An example involving large numbers:
Note: See TracChangeset
for help on using the changeset viewer.
