Differences between revisions 1 and 52 (spanning 51 versions)
Revision 1 as of 2009-02-28 23:31:57
Size: 1834
Editor: ErikJacobson
Comment:
Revision 52 as of 2009-05-25 06:51:10
Size: 2309
Editor: JoseGuzman
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:
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.5.sws]]
Line 17: Line 16:
iii. Abstract algebra           * 1.3. Basic 2D plotting with Sage [[attachment:Plotting_with_Sage.sws]] by Jose Guzman
Line 19: Line 18:
iv. Calculus           * 1.4. Sage Devel Basics [Erik, Aly] [[attachment:dev_for_newbies.html]]-this needs to be restified., [[attachment: development_for_newbies.sws]]
Line 21: Line 20:
v. Number theory     * 2. Calculus
Line 23: Line 22:
vi. High school algebra / trigonometry / precalculus           * 2.1. Limits Calculus [Jose Guzman]
Line 25: Line 24:
vii. Probability           * 2.2. Differential Calculus [[attachment:calculus.differential_calculus_1.0.sws]]
Line 27: Line 26:
viii. Statistics           * 2.3. Integral Calculus [Sourav]
Line 29: Line 28:
b. Plotting 2 and 3 dimensions     * 3. Linear Algebra
Line 31: Line 30:
c. Sage math functions (sage as calculator), sage constants           * 3.1. Matrix Algebra [Sourav]
Line 33: Line 32:
d. Generate Classroom examples     * 4. Abstract Algebra
Line 35: Line 34:
i. show (), latex()           * 4.1. Group Theory [[attachment:group_theory.sws]] (by Robert Beezer)
Line 37: Line 36:
ii. matplotlab     * 5. Number Theory
Line 39: Line 38:
3) Demonstrate SAGE functionality:           * 5.1. Elementary Number Theory I [[attachment:number_theory.primes_0.5.sws]]
Line 41: Line 40:
a. Primes           * 5.2. Elementary Number Theory II [Erik]
Line 43: Line 42:
b. Random numbers           * 5.5. Quadratic Forms [[attachment:quadratic_forms.sws]]
Line 45: Line 44:
c. Plotting           * 5.7. Quaternion Algebra [Sourav]
Line 47: Line 46:
d. Interact     * 9. About this document ...
Line 49: Line 48:
e. Sage data types
Line 51: Line 49:
f. Email(?)
Line 53: Line 50:
4) Programming == To Do ==
Line 55: Line 52:
a. Types, casting, relevant Sage data types     * 1. Basics
Line 57: Line 54:
b. Lists, tuples           * 1.3. Programming in Sage
Line 59: Line 56:
c. Control operators (if, then, else, logical operators, in, srange())           * 1.5. 2D and 3D Plotting in Sage [JoseGuzman]
Line 61: Line 58:
d. Loops           * 1.6. Interact in Sage [Erik]
Line 63: Line 60:
i. For, in, srange(), range()     * 2. Calculus
Line 65: Line 62:
e. Functions           * 2.3. Multivariate Calculus
Line 67: Line 64:
f. Recursion           * 2.4. Taylor Series and Infinite Sums
Line 69: Line 66:
5) Topics           * 2.5. Differential Equations
Line 71: Line 68:
a. Primes and factorization     * 3. Linear Algebra
Line 73: Line 70:
i. Given a random number, is it a prime?           * 3.2. Vector Spaces [Sourav]
Line 75: Line 72:
1. Modular division     * 4. Abstract Algebra
Line 77: Line 74:
a. random()           * 4.2. Rings and Fields [Erik]
Line 79: Line 76:
b. Factor()     * 5. Number Theory
Line 81: Line 78:
2. Euclidean algorithm           * 5.3. Cryptography [Dan]
Line 83: Line 80:
a. Recursion           * 5.4. Elliptic Curves [Aly]
Line 85: Line 82:
b. gcd()           * 5.6. Automorphic Forms
Line 87: Line 84:
3. primality testing           * 5.8. Modular Forms
Line 89: Line 86:
a. for loops     * 6. Combinatorics
Line 91: Line 88:
b. range()           * 6.1. Counting
Line 93: Line 90:
c. is_prime()           * 6.2. Graph Theory
Line 95: Line 92:
ii. How many primes are there?     * 7. Geometry
Line 97: Line 94:
1. prime_pi()     * 8. Statistics
Line 99: Line 96:
2. plotting example           * 8.1. Statistical Methods [Erik]
Line 101: Line 98:
iii. Where are the primes?           * 8.2. Probability [Erik]
Line 103: Line 100:
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
    • 1.5. 2D and 3D Plotting in Sage [JoseGuzman]

    • 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

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