Differences between revisions 13 and 32 (spanning 19 versions)
Revision 13 as of 2009-03-01 03:18:07
Size: 2639
Comment:
Revision 32 as of 2009-03-02 05:37:56
Size: 1741
Comment:
Deletions are marked like this. Additions are marked like this.
Line 1: Line 1:
------------
Major Goals:
= Sage for Newbies =
Line 4: Line 3:
1. SAGE as a Smart Calculator (target: Freshmen) <<TableOfContents>>
Line 6: Line 5:
2. SAGE Primers / Tutorials for == Done ==
Line 8: Line 7:
    (a) Quadratic Forms (target: Arizona Winter School Participants)[[BR]]
    (b) Number Theory via Diophantine Equations (target: Elementary Number Theory students)
    (c) Number Theory via Primes (target: Elementary Number Theory students)
    (d) Group Theory (target: Undergraduate Math Majors) [http://abstract.ups.edu/sage-aata.html by Rob Beezer]
    (e) Differential Calculus (target: Freshmen) [http://sage.math.washington.edu/home/wdj/teaching/calc1-sage/ by David Joyner]
    (f) Integral Calculus (target: Freshmen) [http://wdjoyner.com/teach/calc2-sage/hoffman-stein-calculus.pdf by Hoffman, Joyner & Stein]
    * 0. Front Matter

    * 1. Basics

          o 1.1. Primer Template: An Example [[attachment:primer_template\example.sws]] [[attachment:primer_design_principles.rtf]]

          o 1.2. Sage as a Smart Calculator [[attachment:sage_as_a_smart_calculator.sws]]

    * 2. Calculus

          o 2.1. Differential Calculus [[attachment:differential_calculus.sws]]

    * 4. Abstract Algebra

          o 4.1. Group Theory [[attachment:group_theory.sws]] (by Robert Beezer)

    * 5. Number Theory

          o 5.1. Elementary Number Theory I [[attachment: number_theory.primes_0.1.sws]]

          o 5.5. Quadratic Forms [[attachment: quadratic_forms.sws]]

    * 9. About this document ...
Line 17: Line 33:
------------
Typesetting:
== To Do ==
Line 20: Line 35:
    * 1. Basics
Line 21: Line 37:
reSTRUCTUREDtext [http://docutils.sourceforge.net/rst.html]           o 1.3. Programming in Sage
Line 23: Line 39:
          o 1.4. Sage Devel Basics
Line 24: Line 41:
    * 2. Calculus
Line 25: Line 43:
          o 2.2. Integral Calculus
Line 26: Line 45:
-------------           o 2.3. Multivariate Calculus
Line 28: Line 47:
Goals:           o 2.4. Taylor Series and Infinite Sums
Line 30: Line 49:
1) Accessible to high school math teachers and undergraduate mathematics majors.           o 2.5. Differential Equations
Line 32: Line 51:
2) Anticipated user desires     * 3. Linear Algebra
Line 34: Line 53:
a. Content specific modules           o 3.1. Matrix Algebra
Line 36: Line 55:
i. Quadratic Forms           o 3.2. Vector Spaces
Line 38: Line 57:
ii. Group theory     * 4. Abstract Algebra
Line 40: Line 59:
iii. Abstract algebra           o 4.2. Rings and Fields
Line 42: Line 61:
iv. Calculus     * 5. Number Theory
Line 44: Line 63:
v. Number theory           o 5.2. Elementary Number Theory II
Line 46: Line 65:
vi. High school algebra / trigonometry / precalculus           o 5.3. Cryptography
Line 48: Line 67:
vii. Probability           o 5.4. Elliptic Curves
Line 50: Line 69:
viii. Statistics           o 5.6. Automorphic Forms
Line 52: Line 71:
b. Plotting 2 and 3 dimensions           o 5.7. Quaternion Algebra
Line 54: Line 73:
c. Sage math functions (sage as calculator), sage constants           o 5.8. Modular Forms
Line 56: Line 75:
d. Generate Classroom examples     * 6. Combinatorics
Line 58: Line 77:
i. show (), latex()           o 6.1. Counting
Line 60: Line 79:
ii. matplotlab           o 6.2. Graph Theory
Line 62: Line 81:
3) Demonstrate SAGE functionality:     * 7. Geometry
Line 64: Line 83:
a. Primes     * 8. Statistics
Line 66: Line 85:
b. Random numbers           o 8.1. Statistical Methods
Line 68: Line 87:
c. Plotting           o 8.2. Probability
Line 70: Line 89:
d. Interact

e. Sage data types

f. Email(?)

4) Programming

a. Types, casting, relevant Sage data types

b. Lists, tuples

c. Control operators (if, then, else, logical operators, in, srange())

d. Loops

i. For, in, srange(), range()

e. Functions

f. Recursion

5) Topics

a. Primes and factorization

i. Given a random number, is it a prime?

1. Modular division

a. random()

b. Factor()

2. Euclidean algorithm

a. Recursion

b. gcd()

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 (?)
          o 8.3. Finance

Sage for Newbies

Done

To Do

  • 1. Basics
    • o 1.3. Programming in Sage o 1.4. Sage Devel Basics
  • 2. Calculus
    • o 2.2. Integral Calculus o 2.3. Multivariate Calculus o 2.4. Taylor Series and Infinite Sums o 2.5. Differential Equations
  • 3. Linear Algebra
    • o 3.1. Matrix Algebra o 3.2. Vector Spaces
  • 4. Abstract Algebra
    • o 4.2. Rings and Fields
  • 5. Number Theory
    • o 5.2. Elementary Number Theory II o 5.3. Cryptography o 5.4. Elliptic Curves o 5.6. Automorphic Forms o 5.7. Quaternion Algebra o 5.8. Modular Forms
  • 6. Combinatorics
    • o 6.1. Counting o 6.2. Graph Theory
  • 7. Geometry
  • 8. Statistics
    • o 8.1. Statistical Methods o 8.2. Probability o 8.3. Finance

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