|
Size: 1886
Comment:
|
Size: 1741
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 1: | Line 1: |
| Describe days13/projects/sagenewbiew here. | = Sage for Newbies = |
| Line 3: | Line 3: |
| LINKS: | <<TableOfContents>> |
| Line 5: | Line 5: |
| http://docutils.sourceforge.net/rst.html | == Done == |
| Line 7: | Line 7: |
| Sage Tutorial | * 0. Front Matter |
| Line 9: | Line 9: |
| Goals: | * 1. Basics |
| Line 11: | Line 11: |
| 1) Accessible to high school math teachers and undergraduate mathematics majors. | * 1.1. Primer Template: An Example [[attachment:primer_template\example.sws]] [[attachment:primer_design_principles.rtf]] |
| Line 13: | Line 13: |
| 2) Anticipated user desires | * 1.2. Sage as a Smart Calculator [[attachment:sage_as_a_smart_calculator.sws]] |
| Line 15: | Line 15: |
| a. Content specific modules | * 2. Calculus |
| Line 17: | Line 17: |
| i. Quadratic Forms | * 2.1. Differential Calculus [[attachment:differential_calculus.sws]] |
| Line 19: | Line 19: |
| ii. Group theory | * 4. Abstract Algebra |
| Line 21: | Line 21: |
| iii. Abstract algebra | * 4.1. Group Theory [[attachment:group_theory.sws]] (by Robert Beezer) |
| Line 23: | Line 23: |
| iv. Calculus | * 5. Number Theory |
| Line 25: | Line 25: |
| v. Number theory | * 5.1. Elementary Number Theory I [[attachment: number_theory.primes_0.1.sws]] |
| Line 27: | Line 27: |
| vi. High school algebra / trigonometry / precalculus | * 5.5. Quadratic Forms [[attachment: quadratic_forms.sws]] |
| Line 29: | Line 29: |
| vii. Probability | * 9. About this document ... |
| Line 31: | Line 31: |
| viii. Statistics | |
| Line 33: | Line 32: |
| b. Plotting 2 and 3 dimensions | |
| Line 35: | Line 33: |
| c. Sage math functions (sage as calculator), sage constants | == To Do == |
| Line 37: | Line 35: |
| d. Generate Classroom examples | * 1. Basics |
| Line 39: | Line 37: |
| i. show (), latex() | * 1.3. Programming in Sage |
| Line 41: | Line 39: |
| ii. matplotlab | * 1.4. Sage Devel Basics |
| Line 43: | Line 41: |
| 3) Demonstrate SAGE functionality: | * 2. Calculus |
| Line 45: | Line 43: |
| a. Primes | * 2.2. Integral Calculus |
| Line 47: | Line 45: |
| b. Random numbers | * 2.3. Multivariate Calculus |
| Line 49: | Line 47: |
| c. Plotting | * 2.4. Taylor Series and Infinite Sums |
| Line 51: | Line 49: |
| d. Interact | * 2.5. Differential Equations |
| Line 53: | Line 51: |
| e. Sage data types | * 3. Linear Algebra |
| Line 55: | Line 53: |
| f. Email(?) | * 3.1. Matrix Algebra |
| Line 57: | Line 55: |
| 4) Programming | * 3.2. Vector Spaces |
| Line 59: | Line 57: |
| a. Types, casting, relevant Sage data types | * 4. Abstract Algebra |
| Line 61: | Line 59: |
| b. Lists, tuples | * 4.2. Rings and Fields |
| Line 63: | Line 61: |
| c. Control operators (if, then, else, logical operators, in, srange()) | * 5. Number Theory |
| Line 65: | Line 63: |
| d. Loops | * 5.2. Elementary Number Theory II |
| Line 67: | Line 65: |
| i. For, in, srange(), range() | * 5.3. Cryptography |
| Line 69: | Line 67: |
| e. Functions | * 5.4. Elliptic Curves |
| Line 71: | Line 69: |
| f. Recursion | * 5.6. Automorphic Forms |
| Line 73: | Line 71: |
| 5) Topics | * 5.7. Quaternion Algebra |
| Line 75: | Line 73: |
| a. Primes and factorization | * 5.8. Modular Forms |
| Line 77: | Line 75: |
| i. Given a random number, is it a prime? | * 6. Combinatorics |
| Line 79: | Line 77: |
| 1. Modular division | * 6.1. Counting |
| Line 81: | Line 79: |
| a. random() | * 6.2. Graph Theory |
| Line 83: | Line 81: |
| b. Factor() | * 7. Geometry |
| Line 85: | Line 83: |
| 2. Euclidean algorithm | * 8. Statistics |
| Line 87: | Line 85: |
| a. Recursion | * 8.1. Statistical Methods |
| Line 89: | Line 87: |
| b. gcd() | * 8.2. Probability |
| Line 91: | Line 89: |
| 3. primality testing a. for loops b. range() c. is_prime() ii. How many primes are there? 1. prime_pi() 2. plotting example iii. Where are the primes? 1. Density of primes 2. primes() 3. Arithemtic sequences of primes b. Diophantine equations i. Linear Diophantine equation 1. extended euclidean algorithm 2. recursion vs iteration ii. diagonal quadratic forms; sums of squares (ENT p. 25) 1. Pythagorean triples and generating them 2. Graphing the Pythagorean triples 3. Enumerating all triples using linear intersections 4. Elliptic curves and congruent numbers (chapter 6, stein) iii. Pell’s Equation (?) |
* 8.3. Finance |
Sage for Newbies
Contents
Done
- 0. Front Matter
- 1. Basics
1.1. Primer Template: An Example primer_template\example.sws primer_design_principles.rtf
1.2. Sage as a Smart Calculator sage_as_a_smart_calculator.sws
- 2. Calculus
2.1. Differential Calculus differential_calculus.sws
- 4. Abstract Algebra
4.1. Group Theory group_theory.sws (by Robert Beezer)
- 5. Number Theory
5.1. Elementary Number Theory I number_theory.primes_0.1.sws
5.5. Quadratic Forms quadratic_forms.sws
- 9. About this document ...
To Do
- 1. Basics
- 1.3. Programming in Sage
- 1.4. Sage Devel Basics
- 2. Calculus
- 2.2. Integral Calculus
- 2.3. Multivariate Calculus
- 2.4. Taylor Series and Infinite Sums
- 2.5. Differential Equations
- 3. Linear Algebra
- 3.1. Matrix Algebra
- 3.2. Vector Spaces
- 4. Abstract Algebra
- 4.2. Rings and Fields
- 5. Number Theory
- 5.2. Elementary Number Theory II
- 5.3. Cryptography
- 5.4. Elliptic Curves
- 5.6. Automorphic Forms
- 5.7. Quaternion Algebra
- 5.8. Modular Forms
- 6. Combinatorics
- 6.1. Counting
- 6.2. Graph Theory
- 7. Geometry
- 8. Statistics
- 8.1. Statistical Methods
- 8.2. Probability
- 8.3. Finance
