|
Size: 2857
Comment:
|
Size: 2737
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) [[attachment:Sage_as_a_Smart_Calculator_0.3.sws]] [[attachment:Sage_as_a_Smart_Calculator_0.4.sws]] |
<<TableOfContents>> |
| Line 8: | Line 5: |
| 2. SAGE Primers / Tutorials for | == Major Goals : Sage Primers == |
| Line 10: | Line 7: |
| (a) Quadratic Forms (target: Arizona Winter School Participants) [[attachment: quadratic_forms.sws]] | === Basics === |
| Line 12: | Line 9: |
| (b) Number Theory via Diophantine Equations (target: Elementary Number Theory students) | * Primer Guidelines [[attachment:primer_template\example.sws]] |
| Line 14: | Line 11: |
| (c) Number Theory via Primes (target: Elementary Number Theory students) | * Primer Design Principles [[attachment:primer_design_principles.rtf]] |
| Line 16: | Line 13: |
| (d) Group Theory (target: Undergraduate Math Majors) [http://abstract.ups.edu/sage-aata.html by Rob Beezer] | * SAGE as a Smart Calculator (target: Freshmen) [[attachment:Sage_as_a_Smart_Calculator_0.3.sws]] [[attachment:Sage_as_a_Smart_Calculator_0.4.sws]] |
| Line 18: | Line 15: |
| (e) Differential Calculus (target: Freshmen) [[attachment:Differential_Calculus_Primer_0.3.sws]] |
=== Calculus === |
| Line 21: | Line 17: |
| (f) Integral Calculus (target: Freshmen) [http://wdjoyner.com/teach/calc2-sage/hoffman-stein-calculus.pdf by Hoffman, Joyner & Stein] | * Differential Calculus (target: Freshmen) [[attachment:Differential_Calculus_Primer_0.3.sws]] |
| Line 23: | Line 19: |
| (g) Primer guidelines [[attachment:primer_template\example.sws]] | * Integral Calculus (target: Freshmen) |
| Line 25: | Line 21: |
| (3) Primer Design Principles [[attachment:primer_design_principles.rtf]] | === Number Theory === * Quadratic Forms (target: Arizona Winter School Participants) [[attachment: quadratic_forms.sws]] * Number Theory via Diophantine Equations (target: Elementary Number Theory students) * Number Theory via Primes (target: Elementary Number Theory students) [[attachment: number_theory.primes_0.1.sws]] === Abstract Algebra === * Group Theory (target: Undergraduate Math Majors) |
| Line 28: | Line 34: |
| ------------ Typesetting: reSTRUCTUREDtext [http://docutils.sourceforge.net/rst.html] ------------- Goals: |
== Target |
Sage for Newbies
Major Goals : Sage Primers
Basics
Primer Guidelines primer_template\example.sws
Primer Design Principles primer_design_principles.rtf
SAGE as a Smart Calculator (target: Freshmen) Sage_as_a_Smart_Calculator_0.3.sws Sage_as_a_Smart_Calculator_0.4.sws
Calculus
Differential Calculus (target: Freshmen) Differential_Calculus_Primer_0.3.sws
- Integral Calculus (target: Freshmen)
Number Theory
Quadratic Forms (target: Arizona Winter School Participants) quadratic_forms.sws
- Number Theory via Diophantine Equations (target: Elementary Number Theory students)
Number Theory via Primes (target: Elementary Number Theory students) number_theory.primes_0.1.sws
Abstract Algebra
- Group Theory (target: Undergraduate Math Majors)
== Target
1) Accessible to high school math teachers and undergraduate mathematics majors.
2) Anticipated user desires
a. Content specific modules
i. Quadratic Forms
ii. Group theory
iii. Abstract algebra
iv. Calculus
v. Number theory
vi. High school algebra / trigonometry / precalculus
vii. Probability
viii. Statistics
b. Plotting 2 and 3 dimensions
c. Sage math functions (sage as calculator), sage constants
d. Generate Classroom examples
i. show (), latex()
ii. matplotlab
3) Demonstrate SAGE functionality:
a. Primes
b. Random numbers
c. Plotting
d. Interact
e. Sage data types
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 (?)