DOCSLIB.ORG

OVERVIEW Mathematica Basics

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
OVERVIEW Mathematica Basics �������� The Mathematics Companion for Finite Mathematics and Business Calculus is a dictionary-like refer- ence guide for learning and applying mathematical ideas, techniques, and formulas with the help of Mathematica, the leading computational software for students and users of mathematics in business, economics, and the life and social sciences. The material in the book is organized alphabetically for easy use and reference. It can be used as a tutorial introduction to the basics of Mathematica and touches briefly on the value of Wolfram Alpha as an extension of the material covered in the companion. Many examples illustrate the use of Mathemat- ica “Manipulations” for dynamic learning and exploration. The following excepts from selected chapters indicate the style and range of topics covered in the book. ������������������ This chapter illustrates some of the basic features of Mathematica useful for finite mathematics and business calculus. ◼ Example �����������ⅇ The symbol ⅇ denotes the base of the exponential function. The N function can be used to produce decimal approximations. N[ⅇ, 45] 2.71828182845904523536028747135266249775724709 Special symbols can be entered and formatting options can be invoked using special menus called “palettes.” ◼ Opening Mathematica Palettes ��������� �������������������������� See also: Maxima and minima Suppose that a function has several maxima or minima on sub-intervals of its domain. Then these maxima are referred to as “local maxima.” The absolute maximum of the function over the entire domain is the maximum the local minima, if it exists. The absolute minimum of the function on a domain is the minimum of the set of “local” minima. If the domain of a function is an interval including endpoints, then the values of the function at the endpoints are included in the set of potential absolute maxima and minima. Mathematica Illustration ������� ◼ Solution 1 f[x_]:= Sin[x] MaxValue[f[x], x∈ Reals] 1 Solve[f[x]⩵ 1, x] π x→ ConditionalExpression +2πC[1],C[1]∈ Integers 2 Plot[f[x],{x,-20π, 20π}] 1.0 0.5 -60 -40 -20 20 40 60 -0.5 -1.0 The graph shows that the sine function assumes its absolute maxima and minima at infinitely many points over its domain. The graph shows that the sine function assumes its absolute maxima and minima at infinitely many points over its domain. We can vary the interval {x, -20 π, 20 π} at will to view the graph of f[x] for other real number inputs and to stretch or shrink the display of the functional values. ◼ Solution 2 Plot[f[x],{x,-π,π}] 1.0 0.5 -3 -2 -1 1 2 3 -0.5 -1.0 This graph shows that if we restrict the domain of f to the interval -π ≤ x ≤ π, then the function has a unique global maximum and a unique global minimum on the specified domain. ��������� ���������� See also: Discrete plots, histograms, list plots, list line plots, pie charts, trees Mathematica has an extensive repertoire of tools for visualizing data. Among them are the bar charts. Mathematica Illustration ������� BarChart[Range[10], ChartStyle→ "DarkRainbow"] 10 8 6 4 2 0 ������� BarChart[{Range[4], Reverse[Range[4]]}] ������� BarChart[{{1, 2, 3, 4},{1, 4, 3, 2, 5}}, ChartLabels→{"a", "b", "c", "d", "e"}] a b c d a b c d e ��������� ��������� See also: Annuities The financing of a car loan is an example of the repayment of an ordinary annuity. Mathematica Illustration ������� Suppose we are planning to buy a new car worth $35,000 and we have two choices of paying for the car: 1. 0% financing over 60 months. 2. 4.5% financing, compounded monthly, together with a rebate of $5,000. Which option should we choose? ◼ 0% financing 35 000.00 pmt= 60 583.333 ◼ 4.5% financing and a $5,000 rebate We use the amortization formula Clear[pv, i, n, pmt] i pmt[pv_, i_, n_]:= pv 1-1+i -n If we choose the rebate option, we are borrowing only $22,200 at a monthly rate of i = 0.045/12 per cent for 48 months. pmt30 000, 0.045 12, 60 559.291 The calculations show that the 4.5% option is the way to go. The payment formula corresponds to the present value formula of an ordinary annuity. We can verify this by computing the present value of the annuity consisting of 60 monthly equal payments: 1-1+i -n pv[pmt_, i_, n_]:= pmt i pv559.291, 0.045 12, 60 30 000. ������������������������������ See also: Derivatives of composite functions The chain rule tells us how to differentiate functions constructed by “composing” two or more given functions. Wolfram Alpha Illustration ���������� ����� ��������������� ����� ���� (������������ �������) ���������� ���������������(�)��������������������������������������������������(�)�������������������������������� �(�)� ����������������������◦����������������������� �� �������������������(�(�))����� ��(�)� �����ⅆ�/ⅆ�ⅆ�/ⅆ�·ⅆ�/ⅆ�� �������� ������ ������ ���������� ��������� �� �� �� · �� �� �� �������� ������������ ����� | ������ ����������� �������� | ����������� �������� Mathematica Illustration ������� f[x_]:=3x 2 - 2; g[y_]:= Log[y]; h[x_]:= Composition[f, g][x] h[x] -2+ 3 Log[x] 2 h[x]⩵f[y]/. y -> Log[x] True D[h[x], x] 6 Log[x] x The function h is usually written with the composition symbol “∘” as (f∘g) and its values are denoted by f(g(x)). ������� Composition is not commutative. The function (f∘g) is rarely equal to the function (g∘f). k[x_]:= Composition[g, f][x] k[x] Log-2+3x 2 D[k[x], x] 6 x -2+3x 2 It is easy to verify that the function h[x] and k[x] are not equal. If we evaluate both functions at x = 1, for example, we get different results: h[x]/. x→1 -2 k[x]/. x→1 0 ��������� ��������������� A discontinuity is a point at which a function is discontinuous. There are various reason why a in one variable is discontinuous at a point x in its domain. 1.A function may be discontinuous at x if its value f[x] is different from the limit of f[x] at x. In this case, the discontinuity is said to be removable. All we need to do is to redefine f[x] to be equal to the limit of f[x] at x. 2.A function may be discontinuous at x if the limit of f[x] at x does not exist. For example, the left limit may be different from the right limit. 3.A function may be discontinuous at x if either the left limit or the right limit of f[x] at x does not exist. Mathematica Illustration ������� ◼ A removable discontinuity (x-1)x+2 f[x_]:= (x-1) f[1] � ������ �������� ���������� ������������ � ��������� ������������� ���������� � ��������������� ������������ Indeterminate g[x_]:= Piecewise[{{f[x],!(x⩵1)},{1, x ==1}}] g[1] 1 ������� ◼ The value f[x] is different from the limit of f[x] at x. h[x_]:= Piecewise[{{-1, x<0},{.5, x≥0}}] Plot[h[x],{x,-2, 2}] 0.5 -2 -1 1 2 -0.5 -1.0 {h[0], Limit[h[x], x→ 0, Direction→1], Limit[h[x], x→ 0, Direction→-1]} {0.5,-5,-5} ��������� ���������������������������������� See also: Derivative of the logarithmic functions Suppose that the price p and the demand x of a product are related by a price-demand equation f[p_]:=x Then the elasticity of demand at price p is the relative rate of change of demand x, divided by the relative rate of change of price p: D[Log[f[p], p] p f'[p] elasticity[p] = ⩵ D[Log[p], p] f[p] Mathematica Illustration ������� Suppose that x = f(p) = 1000 (40 - p), for example, then f[p_]:= 100040-p then DLog100040-p, p elasticity[p] = - D[Log[p], p] p 40-p p /.{p→1} 40-p 1 39 p Manipulate ,{p, 0, 30} 40-p � 0.518027 (p+a) Manipulate ,{p, 0, 30},{a, 0, 10} 40-(p+a) � � 0.95122 If 0 < E(p) < 1, the demand is said to be inelastic, if 1 < E(p), the demand is said to be elastic, and if E(p) = 1, a percentage change in the price of the commodity entails the same percentage change in demand. In the given example, the Manipulation shows that the demand is inelastic if the unit price of the commodity is less than $20 and is elastic if the price of the commodity exceeds $20. Furthermore, p elasticity[20] = /. p→ 20 40-p 1 Hence the percentage change in price of the commodity leads to the same percentage change in demand. ����� � ◼ Absolute equality of income, 17 ◼ See: Gini index, Lorenz curve ◼ Absolute maxima and minima, 17 ◼ Absolute value, 18 ◼ Absorbing Markov chains, 20 ◼ Absorbing states of a Markov chain, 21 ◼ Addition of matrices, 23 ◼ See: Matrix algebra ◼ Addition principle for counting, 23 ◼ Amortization, 24 ◼ And (∧, &&), 26 ◼ See: Boolean logic (conjunction) ◼ Angle, 26 ◼ Annuities, 27 ◼ Anti-derivative, 30 ◼ See: Anti-differentiation ◼ Anti-differentiation, 30 ◼ Area, 36 ◼ Arithmetic mean, 40 ◼ Arithmetic sequence, 41 ◼ Arrow representation of vectors, 42 ◼ See: Vectors ◼ Asymptotes, 42 ◼ Augmented matrix, 44 ◼ Average, 45 ◼ See: Mean, median, mode ◼ Average rate of change 45 � ◼ Bar charts, 47 ◼ Bayes' formula, 49 ◼ Bernoulli trial, 49 ◼ Binomial coefficients, 50 ◼ Binomial distribution, 51 ◼ Binomial probability experiments, 53 ◼ See: Bernoulli trials ◼ Binomial probability distribution, 53 ◼ Binomial theorem, 54 ◼ Boolean logic, 55 ◼ Break-even point, 58 ◼ See: Business functions ◼ Business functions, 58 ◼ Cost functions, 58 ◼ Demand functions, 60 ◼ Profit functions, 61 ◼ Revenue functions, 62 ◼ Break-even point, 63 � ◼ Car loans, 65 ◼ Chain rule for differentiation, 66 ◼ Characteristic polynomial, 68 ◼ Codomain of a function, 70 ◼ Column vectors, 71 ◼ Combinations, 72 ◼ Common logarithms, 73 ◼ Complement of a set, 74 ◼ Complex numbers, 76 ◼ Composite function, 77 ◼ See: Functions, chain rule ◼ Compound event, 77 ◼ Compound interest, 77 ◼ Concavity of the graph of a function, 78 ◼ Conditional, 79 ◼ See: Boolean logic, if-then ◼ Conditional probability, 79 ◼ Conjunction, 81 ◼ See: And, Boolean logic ◼ Consistent linear systems, 81 ◼ Constant functions,
Load more

Recommended publications
  • Plotting Direction Fields in Matlab and Maxima – a Short Tutorial
    Plotting direction fields in Matlab and Maxima – a short tutorial Luis Carvalho Introduction A first order differential equation can be expressed as dx x0(t) = = f(t; x) (1) dt where t is the independent variable and x is the dependent variable (on t). Note that the equation above is in normal form. The difficulty in solving equation (1) depends clearly on f(t; x). One way to gain geometric insight on how the solution might look like is to observe that any solution to (1) should be such that the slope at any point P (t0; x0) is f(t0; x0), since this is the value of the derivative at P . With this motivation in mind, if you select enough points and plot the slopes in each of these points, you will obtain a direction field for ODE (1). However, it is not easy to plot such a direction field for any function f(t; x), and so we must resort to some computational help. There are many computational packages to help us in this task. This is a short tutorial on how to plot direction fields for first order ODE’s in Matlab and Maxima. Matlab Matlab is a powerful “computing environment that combines numeric computation, advanced graphics and visualization” 1. A nice package for plotting direction field in Matlab (although resourceful, Matlab does not provide such facility natively) can be found at http://math.rice.edu/»dfield, contributed by John C. Polking from the Dept. of Mathematics at Rice University. To install this add-on, simply browse to the files for your version of Matlab and download them.
    [Show full text]
  • Basic Structures: Sets, Functions, Sequences, and Sums 2-2
    CHAPTER Basic Structures: Sets, Functions, 2 Sequences, and Sums 2.1 Sets uch of discrete mathematics is devoted to the study of discrete structures, used to represent discrete objects. Many important discrete structures are built using sets, which 2.2 Set Operations M are collections of objects. Among the discrete structures built from sets are combinations, 2.3 Functions unordered collections of objects used extensively in counting; relations, sets of ordered pairs that represent relationships between objects; graphs, sets of vertices and edges that connect 2.4 Sequences and vertices; and finite state machines, used to model computing machines. These are some of the Summations topics we will study in later chapters. The concept of a function is extremely important in discrete mathematics. A function assigns to each element of a set exactly one element of a set. Functions play important roles throughout discrete mathematics. They are used to represent the computational complexity of algorithms, to study the size of sets, to count objects, and in a myriad of other ways. Useful structures such as sequences and strings are special types of functions. In this chapter, we will introduce the notion of a sequence, which represents ordered lists of elements. We will introduce some important types of sequences, and we will address the problem of identifying a pattern for the terms of a sequence from its first few terms. Using the notion of a sequence, we will define what it means for a set to be countable, namely, that we can list all the elements of the set in a sequence.
    [Show full text]
  • CAS (Computer Algebra System) Mathematica
    CAS (Computer Algebra System) Mathematica- UML students can download a copy for free as part of the UML site license; see the course website for details From: Wikipedia 2/9/2014 A computer algebra system (CAS) is a software program that allows [one] to compute with mathematical expressions in a way which is similar to the traditional handwritten computations of the mathematicians and other scientists. The main ones are Axiom, Magma, Maple, Mathematica and Sage (the latter includes several computer algebras systems, such as Macsyma and SymPy). Computer algebra systems began to appear in the 1960s, and evolved out of two quite different sources—the requirements of theoretical physicists and research into artificial intelligence. A prime example for the first development was the pioneering work conducted by the later Nobel Prize laureate in physics Martin Veltman, who designed a program for symbolic mathematics, especially High Energy Physics, called Schoonschip (Dutch for "clean ship") in 1963. Using LISP as the programming basis, Carl Engelman created MATHLAB in 1964 at MITRE within an artificial intelligence research environment. Later MATHLAB was made available to users on PDP-6 and PDP-10 Systems running TOPS-10 or TENEX in universities. Today it can still be used on SIMH-Emulations of the PDP-10. MATHLAB ("mathematical laboratory") should not be confused with MATLAB ("matrix laboratory") which is a system for numerical computation built 15 years later at the University of New Mexico, accidentally named rather similarly. The first popular computer algebra systems were muMATH, Reduce, Derive (based on muMATH), and Macsyma; a popular copyleft version of Macsyma called Maxima is actively being maintained.
    [Show full text]
  • Domain and Range of a Function
    4.1 Domain and Range of a Function How can you fi nd the domain and range of STATES a function? STANDARDS MA.8.A.1.1 MA.8.A.1.5 1 ACTIVITY: The Domain and Range of a Function Work with a partner. The table shows the number of adult and child tickets sold for a school concert. Input Number of Adult Tickets, x 01234 Output Number of Child Tickets, y 86420 The variables x and y are related by the linear equation 4x + 2y = 16. a. Write the equation in function form by solving for y. b. The domain of a function is the set of all input values. Find the domain of the function. Domain = Why is x = 5 not in the domain of the function? 1 Why is x = — not in the domain of the function? 2 c. The range of a function is the set of all output values. Find the range of the function. Range = d. Functions can be described in many ways. ● by an equation ● by an input-output table y 9 ● in words 8 ● by a graph 7 6 ● as a set of ordered pairs 5 4 Use the graph to write the function 3 as a set of ordered pairs. 2 1 , , ( , ) ( , ) 0 09321 45 876 x ( , ) , ( , ) , ( , ) 148 Chapter 4 Functions 2 ACTIVITY: Finding Domains and Ranges Work with a partner. ● Copy and complete each input-output table. ● Find the domain and range of the function represented by the table. 1 a. y = −3x + 4 b. y = — x − 6 2 x −2 −10 1 2 x 01234 y y c.
    [Show full text]
  • Adaptive Lower Bound for Testing Monotonicity on the Line
    Adaptive Lower Bound for Testing Monotonicity on the Line Aleksandrs Belovs∗ Abstract In the property testing model, the task is to distinguish objects possessing some property from the objects that are far from it. One of such properties is monotonicity, when the objects are functions from one poset to another. This is an active area of research. In this paper we study query complexity of ε-testing monotonicity of a function f :[n] → [r]. All our lower bounds are for adaptive two-sided testers. log r • We prove a nearly tight lower bound for this problem in terms of r. TheboundisΩ log log r when ε =1/2. No previous satisfactory lower bound in terms of r was known. • We completely characterise query complexity of this problem in terms of n for smaller values of ε. The complexity is Θ ε−1 log(εn) . Apart from giving the lower bound, this improves on the best known upper bound. Finally, we give an alternative proof of the Ω(ε−1d log n−ε−1 log ε−1) lower bound for testing monotonicity on the hypergrid [n]d due to Chakrabarty and Seshadhri (RANDOM’13). 1 Introduction The framework of property testing was formulated by Rubinfeld and Sudan [19] and Goldreich et al. [16]. A property testing problem is specified by a property P, which is a class of functions mapping some finite set D into some finite set R, and proximity parameter ε, which is a real number between 0 and 1. An ε-tester is a bounded-error randomised query algorithm which, given oracle access to a function f : D → R, distinguishes between the case when f belongs to P and the case when f is ε-far from P.
    [Show full text]
  • Optimization and Gradient Descent INFO-4604, Applied Machine Learning University of Colorado Boulder
    Optimization and Gradient Descent INFO-4604, Applied Machine Learning University of Colorado Boulder September 11, 2018 Prof. Michael Paul Prediction Functions Remember: a prediction function is the function that predicts what the output should be, given the input. Prediction Functions Linear regression: f(x) = wTx + b Linear classification (perceptron): f(x) = 1, wTx + b ≥ 0 -1, wTx + b < 0 Need to learn what w should be! Learning Parameters Goal is to learn to minimize error • Ideally: true error • Instead: training error The loss function gives the training error when using parameters w, denoted L(w). • Also called cost function • More general: objective function (in general objective could be to minimize or maximize; with loss/cost functions, we want to minimize) Learning Parameters Goal is to minimize loss function. How do we minimize a function? Let’s review some math. Rate of Change The slope of a line is also called the rate of change of the line. y = ½x + 1 “rise” “run” Rate of Change For nonlinear functions, the “rise over run” formula gives you the average rate of change between two points Average slope from x=-1 to x=0 is: 2 f(x) = x -1 Rate of Change There is also a concept of rate of change at individual points (rather than two points) Slope at x=-1 is: f(x) = x2 -2 Rate of Change The slope at a point is called the derivative at that point Intuition: f(x) = x2 Measure the slope between two points that are really close together Rate of Change The slope at a point is called the derivative at that point Intuition: Measure the
    [Show full text]
  • Basic Concepts of Set Theory, Functions and Relations 1. Basic
    Ling 310, adapted from UMass Ling 409, Partee lecture notes March 1, 2006 p. 1 Basic Concepts of Set Theory, Functions and Relations 1. Basic Concepts of Set Theory........................................................................................................................1 1.1. Sets and elements ...................................................................................................................................1 1.2. Specification of sets ...............................................................................................................................2 1.3. Identity and cardinality ..........................................................................................................................3 1.4. Subsets ...................................................................................................................................................4 1.5. Power sets .............................................................................................................................................4 1.6. Operations on sets: union, intersection...................................................................................................4 1.7 More operations on sets: difference, complement...................................................................................5 1.8. Set-theoretic equalities ...........................................................................................................................5 Chapter 2. Relations and Functions ..................................................................................................................6
    [Show full text]
  • Module 1 Lecture Notes
    Module 1 Lecture Notes Contents 1.1 Identifying Functions.............................1 1.2 Algebraically Determining the Domain of a Function..........4 1.3 Evaluating Functions.............................6 1.4 Function Operations..............................7 1.5 The Difference Quotient...........................9 1.6 Applications of Function Operations.................... 10 1.7 Determining the Domain and Range of a Function Graphically.... 12 1.8 Reading the Graph of a Function...................... 14 1.1 Identifying Functions In previous classes, you should have studied a variety basic functions. For example, 1 p f(x) = 3x − 5; g(x) = 2x2 − 1; h(x) = ; j(x) = 5x + 2 x − 5 We will begin this course by studying functions and their properties. As the course progresses, we will study inverse, composite, exponential, logarithmic, polynomial and rational functions. Math 111 Module 1 Lecture Notes Definition 1: A relation is a correspondence between two variables. A relation can be ex- pressed through a set of ordered pairs, a graph, a table, or an equation. A set containing ordered pairs (x; y) defines y as a function of x if and only if no two ordered pairs in the set have the same x-coordinate. In other words, every input maps to exactly one output. We write y = f(x) and say \y is a function of x." For the function defined by y = f(x), • x is the independent variable (also known as the input) • y is the dependent variable (also known as the output) • f is the function name Example 1: Determine whether or not each of the following represents a function. Table 1.1 Chicken Name Egg Color Emma Turquoise Hazel Light Brown George(ia) Chocolate Brown Isabella White Yvonne Light Brown (a) The set of ordered pairs of the form (chicken name, egg color) shown in Table 1.1.
    [Show full text]
  • Maxima and Minima
    Basic Mathematics Maxima and Minima R Horan & M Lavelle The aim of this document is to provide a short, self assessment programme for students who wish to be able to use differentiation to find maxima and mininima of functions. Copyright c 2004 [email protected] , [email protected] Last Revision Date: May 5, 2005 Version 1.0 Table of Contents 1. Rules of Differentiation 2. Derivatives of order 2 (and higher) 3. Maxima and Minima 4. Quiz on Max and Min Solutions to Exercises Solutions to Quizzes Section 1: Rules of Differentiation 3 1. Rules of Differentiation Throughout this package the following rules of differentiation will be assumed. (In the table of derivatives below, a is an arbitrary, non-zero constant.) y axn sin(ax) cos(ax) eax ln(ax) dy 1 naxn−1 a cos(ax) −a sin(ax) aeax dx x If a is any constant and u, v are two functions of x, then d du dv (u + v) = + dx dx dx d du (au) = a dx dx Section 1: Rules of Differentiation 4 The stationary points of a function are those points where the gradient of the tangent (the derivative of the function) is zero. Example 1 Find the stationary points of the functions (a) f(x) = 3x2 + 2x − 9 , (b) f(x) = x3 − 6x2 + 9x − 2 . Solution dy (a) If y = 3x2 + 2x − 9 then = 3 × 2x2−1 + 2 = 6x + 2. dx The stationary points are found by solving the equation dy = 6x + 2 = 0 . dx In this case there is only one solution, x = −1/3.
    [Show full text]
  • A Denotational Semantics Approach to Functional and Logic Programming
    A Denotational Semantics Approach to Functional and Logic Programming TR89-030 August, 1989 Frank S.K. Silbermann The University of North Carolina at Chapel Hill Department of Computer Science CB#3175, Sitterson Hall Chapel Hill, NC 27599-3175 UNC is an Equal OpportunityjAfflrmative Action Institution. A Denotational Semantics Approach to Functional and Logic Programming by FrankS. K. Silbermann A dissertation submitted to the faculty of the University of North Carolina at Chapel Hill in par­ tial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science. Chapel Hill 1989 @1989 Frank S. K. Silbermann ALL RIGHTS RESERVED 11 FRANK STEVEN KENT SILBERMANN. A Denotational Semantics Approach to Functional and Logic Programming (Under the direction of Bharat Jayaraman.) ABSTRACT This dissertation addresses the problem of incorporating into lazy higher-order functional programming the relational programming capability of Horn logic. The language design is based on set abstraction, a feature whose denotational semantics has until now not been rigorously defined. A novel approach is taken in constructing an operational semantics directly from the denotational description. The main results of this dissertation are: (i) Relative set abstraction can combine lazy higher-order functional program­ ming with not only first-order Horn logic, but also with a useful subset of higher­ order Horn logic. Sets, as well as functions, can be treated as first-class objects. (ii) Angelic powerdomains provide the semantic foundation for relative set ab­ straction. (iii) The computation rule appropriate for this language is a modified parallel­ outermost, rather than the more familiar left-most rule. (iv) Optimizations incorporating ideas from narrowing and resolution greatly improve the efficiency of the interpreter, while maintaining correctness.
    [Show full text]
  • The Domain of Solutions to Differential Equations
    connect to college success™ The Domain of Solutions To Differential Equations Larry Riddle available on apcentral.collegeboard.com connect to college success™ www.collegeboard.com The College Board: Connecting Students to College Success The College Board is a not-for-profit membership association whose mission is to connect students to college success and opportunity. Founded in 1900, the association is composed of more than 4,700 schools, colleges, universities, and other educational organizations. Each year, the College Board serves over three and a half million students and their parents, 23,000 high schools, and 3,500 colleges through major programs and services in college admissions, guidance, assessment, financial aid, enrollment, and teaching and learning. Among its best-known programs are the SAT®, the PSAT/NMSQT®, and the Advanced Placement Program® (AP®). The College Board is committed to the principles of excellence and equity, and that commitment is embodied in all of its programs, services, activities, and concerns. Equity Policy Statement The College Board and the Advanced Placement Program encourage teachers, AP Coordinators, and school administrators to make equitable access a guiding principle for their AP programs. The College Board is committed to the principle that all students deserve an opportunity to participate in rigorous and academically challenging courses and programs. All students who are willing to accept the challenge of a rigorous academic curriculum should be considered for admission to AP courses. The Board encourages the elimination of barriers that restrict access to AP courses for students from ethnic, racial, and socioeconomic groups that have been traditionally underrepresented in the AP Program.
    [Show full text]
  • Sage Tutorial (Pdf)
    Sage Tutorial Release 9.4 The Sage Development Team Aug 24, 2021 CONTENTS 1 Introduction 3 1.1 Installation................................................4 1.2 Ways to Use Sage.............................................4 1.3 Longterm Goals for Sage.........................................5 2 A Guided Tour 7 2.1 Assignment, Equality, and Arithmetic..................................7 2.2 Getting Help...............................................9 2.3 Functions, Indentation, and Counting.................................. 10 2.4 Basic Algebra and Calculus....................................... 14 2.5 Plotting.................................................. 20 2.6 Some Common Issues with Functions.................................. 23 2.7 Basic Rings................................................ 26 2.8 Linear Algebra.............................................. 28 2.9 Polynomials............................................... 32 2.10 Parents, Conversion and Coercion.................................... 36 2.11 Finite Groups, Abelian Groups...................................... 42 2.12 Number Theory............................................. 43 2.13 Some More Advanced Mathematics................................... 46 3 The Interactive Shell 55 3.1 Your Sage Session............................................ 55 3.2 Logging Input and Output........................................ 57 3.3 Paste Ignores Prompts.......................................... 58 3.4 Timing Commands............................................ 58 3.5 Other IPython
    [Show full text]