1834
Comment:
|
2036
|
Deletions are marked like this. | Additions are marked like this. |
Line 1: | Line 1: |
Describe days13/projects/sagenewbiew here. | = Sage Primers = |
Line 3: | Line 3: |
Sage Tutorial | <<TableOfContents>> |
Line 5: | Line 5: |
Goals: | |
Line 7: | Line 6: |
1) Accessible to high school math teachers and undergraduate mathematics majors. | == Done / In Progress == |
Line 9: | Line 8: |
2) Anticipated user desires | * 0. Sage Primer Design Principles [[attachment:Sage Primer Design Principles.pdf]] [[attachment:primer_design_principles.rtf]] |
Line 11: | Line 10: |
a. Content specific modules | * 1. Basics |
Line 13: | Line 12: |
i. Quadratic Forms | * 1.1. Primer Template: An Example [[attachment:primer_template_example.sws]] |
Line 15: | Line 14: |
ii. Group theory | * 1.2. Sage as a Smart Calculator [[attachment:basics.smart_calculator_0.4.sws]] |
Line 17: | Line 16: |
iii. Abstract algebra | * 1.4. Sage Devel Basics [Erik, Aly] |
Line 19: | Line 18: |
iv. Calculus | * 2. Calculus |
Line 21: | Line 20: |
v. Number theory | * 2.1. Differential Calculus [[attachment:calculus.differential_calculus_1.0.sws]] |
Line 23: | Line 22: |
vi. High school algebra / trigonometry / precalculus | * 2.2. Integral Calculus [Sourav] |
Line 25: | Line 24: |
vii. Probability | * 3. Linear Algebra |
Line 27: | Line 26: |
viii. Statistics | * 3.1. Matrix Algebra [Sourav] |
Line 29: | Line 28: |
b. Plotting 2 and 3 dimensions | * 4. Abstract Algebra |
Line 31: | Line 30: |
c. Sage math functions (sage as calculator), sage constants | * 4.1. Group Theory [[attachment:group_theory.sws]] (by Robert Beezer) |
Line 33: | Line 32: |
d. Generate Classroom examples | * 5. Number Theory |
Line 35: | Line 34: |
i. show (), latex() | * 5.1. Elementary Number Theory I [[attachment:number_theory.primes_0.5.sws]] |
Line 37: | Line 36: |
ii. matplotlab | * 5.2. Elementary Number Theory II [Erik] |
Line 39: | Line 38: |
3) Demonstrate SAGE functionality: | * 5.5. Quadratic Forms [[attachment:quadratic_forms.sws]] |
Line 41: | Line 40: |
a. Primes | * 5.7. Quaternion Algebra [Sourav] |
Line 43: | Line 42: |
b. Random numbers | * 9. About this document ... |
Line 45: | Line 44: |
c. Plotting | |
Line 47: | Line 45: |
d. Interact | |
Line 49: | Line 46: |
e. Sage data types | == To Do == |
Line 51: | Line 48: |
f. Email(?) | * 1. Basics |
Line 53: | Line 50: |
4) Programming | * 1.3. Programming in Sage |
Line 55: | Line 52: |
a. Types, casting, relevant Sage data types | * 1.5. 2D and 3D Plotting in Sage |
Line 57: | Line 54: |
b. Lists, tuples | * 1.6. Interact in Sage [Erik] |
Line 59: | Line 56: |
c. Control operators (if, then, else, logical operators, in, srange()) | * 2. Calculus |
Line 61: | Line 58: |
d. Loops | * 2.3. Multivariate Calculus |
Line 63: | Line 60: |
i. For, in, srange(), range() | * 2.4. Taylor Series and Infinite Sums |
Line 65: | Line 62: |
e. Functions | * 2.5. Differential Equations |
Line 67: | Line 64: |
f. Recursion | * 3. Linear Algebra |
Line 69: | Line 66: |
5) Topics | * 3.2. Vector Spaces [Sourav] |
Line 71: | Line 68: |
a. Primes and factorization | * 4. Abstract Algebra |
Line 73: | Line 70: |
i. Given a random number, is it a prime? | * 4.2. Rings and Fields [Erik] |
Line 75: | Line 72: |
1. Modular division | * 5. Number Theory |
Line 77: | Line 74: |
a. random() | * 5.3. Cryptography [Dan] |
Line 79: | Line 76: |
b. Factor() | * 5.4. Elliptic Curves [Aly] |
Line 81: | Line 78: |
2. Euclidean algorithm | * 5.6. Automorphic Forms |
Line 83: | Line 80: |
a. Recursion | * 5.8. Modular Forms |
Line 85: | Line 82: |
b. gcd() | * 6. Combinatorics |
Line 87: | Line 84: |
3. primality testing | * 6.1. Counting |
Line 89: | Line 86: |
a. for loops | * 6.2. Graph Theory |
Line 91: | Line 88: |
b. range() | * 7. Geometry |
Line 93: | Line 90: |
c. is_prime() | * 8. Statistics |
Line 95: | Line 92: |
ii. How many primes are there? | * 8.1. Statistical Methods [Erik] |
Line 97: | Line 94: |
1. prime_pi() | * 8.2. Probability [Erik] |
Line 99: | Line 96: |
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 Primers
Contents
Done / In Progress
0. Sage Primer Design Principles Sage Primer Design Principles.pdf primer_design_principles.rtf
- 1. Basics
1.1. Primer Template: An Example primer_template_example.sws
1.2. Sage as a Smart Calculator basics.smart_calculator_0.4.sws
- 1.4. Sage Devel Basics [Erik, Aly]
- 2. Calculus
2.1. Differential Calculus calculus.differential_calculus_1.0.sws
- 2.2. Integral Calculus [Sourav]
- 3. Linear Algebra
- 3.1. Matrix Algebra [Sourav]
- 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.5.sws
- 5.2. Elementary Number Theory II [Erik]
5.5. Quadratic Forms quadratic_forms.sws
- 5.7. Quaternion Algebra [Sourav]
- 9. About this document ...
To Do
- 1. Basics
- 1.3. Programming in Sage
- 1.5. 2D and 3D Plotting in Sage
- 1.6. Interact in Sage [Erik]
- 2. Calculus
- 2.3. Multivariate Calculus
- 2.4. Taylor Series and Infinite Sums
- 2.5. Differential Equations
- 3. Linear Algebra
- 3.2. Vector Spaces [Sourav]
- 4. Abstract Algebra
- 4.2. Rings and Fields [Erik]
- 5. Number Theory
- 5.3. Cryptography [Dan]
- 5.4. Elliptic Curves [Aly]
- 5.6. Automorphic Forms
- 5.8. Modular Forms
- 6. Combinatorics
- 6.1. Counting
- 6.2. Graph Theory
- 7. Geometry
- 8. Statistics
- 8.1. Statistical Methods [Erik]
- 8.2. Probability [Erik]
- 8.3. Finance