Differences between revisions 3 and 36 (spanning 33 versions)
Revision 3 as of 2009-02-28 23:33:43
Size: 1886
Editor: ErikJacobson
Comment:
Revision 36 as of 2009-03-02 18:18:14
Size: 1865
Comment:
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:
LINKS: <<TableOfContents>>
Line 5: Line 5:
http://docutils.sourceforge.net/rst.html == Done / In Progress ==
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           * 1.4. Sage Devel Basics [Erik, Aly]
Line 17: Line 17:
i. Quadratic Forms     * 2. Calculus
Line 19: Line 19:
ii. Group theory           * 2.1. Differential Calculus [[attachment:differential_calculus.sws]]
Line 21: Line 21:
iii. Abstract algebra           * 2.2. Integral Calculus [Sourav]
Line 23: Line 23:
iv. Calculus     * 3. Linear Algebra
Line 25: Line 25:
v. Number theory           * 3.1. Matrix Algebra [Sourav]
Line 27: Line 27:
vi. High school algebra / trigonometry / precalculus     * 4. Abstract Algebra
Line 29: Line 29:
vii. Probability           * 4.1. Group Theory [[attachment:group_theory.txt]] (by Robert Beezer)
Line 31: Line 31:
viii. Statistics     * 5. Number Theory
Line 33: Line 33:
b. Plotting 2 and 3 dimensions           * 5.1. Elementary Number Theory I [[attachment: number_theory.primes_0.1.sws]]
Line 35: Line 35:
c. Sage math functions (sage as calculator), sage constants           * 5.2. Elementary Number Theory II [Erik]
Line 37: Line 37:
d. Generate Classroom examples           * 5.5. Quadratic Forms [[attachment: quadratic_forms.sws]]
Line 39: Line 39:
i. show (), latex()           * 5.7. Quaternion Algebra [Sourav]
Line 41: Line 41:
ii. matplotlab     * 9. About this document ...
Line 43: Line 43:
3) Demonstrate SAGE functionality:
Line 45: Line 44:
a. Primes
Line 47: Line 45:
b. Random numbers == To Do ==
Line 49: Line 47:
c. Plotting     * 1. Basics
Line 51: Line 49:
d. Interact           * 1.3. Programming in Sage
Line 53: Line 51:
e. Sage data types     * 2. Calculus
Line 55: Line 53:
f. Email(?)           * 2.3. Multivariate Calculus
Line 57: Line 55:
4) Programming           * 2.4. Taylor Series and Infinite Sums
Line 59: Line 57:
a. Types, casting, relevant Sage data types           * 2.5. Differential Equations
Line 61: Line 59:
b. Lists, tuples     * 3. Linear Algebra
Line 63: Line 61:
c. Control operators (if, then, else, logical operators, in, srange())           * 3.2. Vector Spaces [Sourav]
Line 65: Line 63:
d. Loops     * 4. Abstract Algebra
Line 67: Line 65:
i. For, in, srange(), range()           * 4.2. Rings and Fields [Erik]
Line 69: Line 67:
e. Functions     * 5. Number Theory
Line 71: Line 69:
f. Recursion           * 5.3. Cryptography [Dan]
Line 73: Line 71:
5) Topics           * 5.4. Elliptic Curves [Aly]
Line 75: Line 73:
a. Primes and factorization           * 5.6. Automorphic Forms
Line 77: Line 75:
i. Given a random number, is it a prime?           * 5.8. Modular Forms
Line 79: Line 77:
1. Modular division     * 6. Combinatorics
Line 81: Line 79:
a. random()           * 6.1. Counting
Line 83: Line 81:
b. Factor()           * 6.2. Graph Theory
Line 85: Line 83:
2. Euclidean algorithm     * 7. Geometry
Line 87: Line 85:
a. Recursion     * 8. Statistics
Line 89: Line 87:
b. gcd()           * 8.1. Statistical Methods [Erik]
Line 91: Line 89:
3. primality testing           * 8.2. Probability [Erik]
Line 93: Line 91:
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 Primers

Done / In Progress

To Do

  • 1. Basics
    • 1.3. Programming in Sage
  • 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

days13/projects/sagenewbie (last edited 2011-01-28 07:12:10 by Eviatar)