Physics Reference Electricity & Magnetism James Lamberg

Electric Charge q1 ⋅ q2 e − ≈ 1.6 ×10−19 C A shell of uniform charge

F=
4π ⋅ 0 ⋅ r q = n ⋅ e, n= ±1,±2 , . . .
2
Charges with the same electrical attracts or repels a charged
sign repel each other, and charges 1 N ⋅ m 2 Point Charge particle that is outside the
k= ≈ 9 ×10 9
with opposite electrical sign attract 4π ⋅ 0 C E=k q shell as if all the shell's charge
2
Electric Fields Electric field lines extend r were concentrated at its center
Torque
F away from positive charge Electric Dipole A shell of uniform charge
E= t = p ×E
q0 and toward negative charge p = Dipole Moment exerts no electrostatic force
Charged Ring Charged Disk 2p 3(p ⋅ rˆ) − p on a charged particle that is
E=k 3 ≈
q⋅z   z 4π ⋅ 0 ⋅ z3 located inside the shell.
E= 3 2 E = 1− z 
4π ⋅ 0 ( z2 + R 2 ) 2 0  
z2 + R 2  Conducting Surface Line Of Charge Sheet Of Charge

Potential Energy Gauss' Law : 0 ⋅ Φ =Qenclosed E = E= E=

2π ⋅ ⋅ r 20
Flux = Φ =∫ E⋅ dA =
0 0
Of A Dipole Qenclosed
Electric Potential Electric Potential Electric Diplole
U = −p ⋅ E 0
∆U = q⋅ ∆W f
p ⋅ cos( )
Spherical Shell Spherical Shell Electric Potential V f − Vi = −∫ E ⋅ ds = V V = k
W r2
Field At r ≥ R Field At r < R qi ∆V = V f − Vi = −
n
V = k = k⋅∑
q i
q
V = k⋅ ∫
E=0 r dq V
q i=1 ri ES = −
E= W∞ E = − ∇V
4π ⋅ 0 ⋅ r 2
Parallel Plate Cylindrical Vi = − r s
q q1 ⋅ q2 Isolated Sphere
Capacitance Capacitor Capacitor U = W = k
Spherical r C = 4π ⋅ 0 ⋅ R
0⋅ A
Q L
C= C= C = 2π ⋅ 0 Capacitor
V d ln(b a) Parallel Series Current
a ⋅ b n
C = 4π ⋅ 0
n
Ceff = ∑ Ci =∑
Potential Energy Energy Density 1 1 dq
b − a i=
Q 2
1 2 i=1 C eff i=1 C i dt
U= = C ⋅V 2 u = Q = 1 ⋅ E 2 Dielectric
2C 2 2C 2 0 Resistance E = ⋅ J J = n ⋅ e ⋅ v drift
Current Density Current Density C = ⋅ C air
V
0 ⋅ ∫ k ⋅ E⋅ dA = Qenclosed
R = , Ohm's Law Conductivity Resistivity
i = ∫ J ⋅ dA i i
J = , Constant Resistance is a property of an object 1 E
A L = =
R= J
− 0 = 0 ⋅ (T − T0 ) Resistivity is a property of a material A
Parallel
Power, Rate Of Transfer Resistive Dissapation Resistivity Of A Conductor EMF i =
R n
∑
dW 1 1
Of Electrical Energy V 2 (Such As Metal)
= =
P = i2 ⋅ R = m dq Reff i=1 Ri
P = i⋅V R = 2
e ⋅ n⋅ EMF Power Series
Kirchoff's Loop Rule
Kirchoff's Junction Rule dq Pemf = i ⋅ n
The sum of the changes in
The sum of the currents entering i( t) =
dt
R eff = ∑ Ri
potential in a loops of a i=1
any junction must equal the sum Discharging A Capacitor
circuit must be zero
of the currents leaving that junction q(t ) = q ⋅ e −t R ⋅C
Charging A Capacitor 0

q(t ) = C ⋅ (1− e )
−t R ⋅C Charging A Capacitor q
i( t) = − 0 ⋅ e− t R ⋅C
VC = (1− e − t R ⋅C
) R⋅C
i(t ) = ⋅ e − t R ⋅C
R Page 1
 Physics Reference Electricity & Magnetism James Lamberg
Magnetic Fields, B Opposite magnetic poles attract Circular Charged Path Mass Spectrometer
FB = q⋅ v × B Like magnetic poles repel m ⋅ v2 2⋅ q ⋅V
q⋅v⋅ B = v=
Right Hand Rule, Positive Charge Hall Effect r m
Thumb Up, Pointer Pointing V = E ⋅ d Resonance Condition B ⋅ q⋅ x 2
2
m=
and Middle Finger Perpendicular B⋅i f = f osc 8V
n=
Thumb =Magnetic Force Direction V ⋅l⋅e 1 q ⋅ B Force On A Current Parallel currents
f= = =
Pointer =Velocity Direction 2π T 2π ⋅ m dFB = i ⋅ dL × B
attract and
Middle =Magnetic Field Direction Magnetic Dipole Moment Magnetic Potential Energy AntiParallel
Biot -Savart Law = N ⋅ i ⋅ A, Moment U( ) = − ⋅ B currents repel
Like "Leo Bazaar" t= ×B
Right Hand Rule
i ⋅ ds × r −7 T ⋅ m Long Straight Wire Torid
dB = 0 0 = 4π ×10 Grasp the element with thumb
0⋅i 0 ⋅ i ⋅ N turns
4π r3 A
B= B= pointing in the direction of the
Center Of Circular Arc 2π ⋅r 2π ⋅r
⋅i⋅ Ideal Solenoid current, fingers curl in the
B= 0 Force Between Two
4π ⋅ R n = turns per unit length Parallel Wires direction of the magnetic field
Current Carrying Coil B = 0 ⋅ i ⋅ n Ampére's Law Magnetic Flux
0 ⋅ i1 ⋅ i2
F=
B(z) = 0 3
⋅ A changing magnetic field 2π ⋅d
L
∫ B⋅ ds = 0 ⋅ ienclosed Φ B = ∫ B⋅ dA
2π ⋅ z produces an electric field Faraday's Law Coil Of N Turns Faraday's Law
Current Loop + Magnetic Field ⇒ Torque
∫
dΦ dΦ B dΦ B
=− B = −N ⋅ E⋅ ds = =
Torque + Magnetic Field ⇒ Current? YES dt dt dt
Inductance Solenoid Self Induced emf Rise Of Current (Inductor) Decay Of Current (Inductor)
N ⋅ ΦB L = 0 ⋅ n 2 ⋅ A ⋅ l di L L
L=
i L = −L
dt i = (1− e− t L ), L = i = e− t L = i0 ⋅ e −t L , L =
R R R R
Magnetic Energy Magnetic Energy Density Mutual Inductance Gauss' Law, Magnetic Fields
2
1
= 1 = −M 2 Φ B = ∫ B⋅ dA = 0
B di di
UB = L ⋅ i uB =
2
2 = −M
1
2 2 0 dt dt
Maxwell's Equations Spin Magnetic Dipole Moment Bohr Magneton
Gauss' Law For Electricity e e⋅ h J
s = − ⋅S B = − ≈ 9.27 ×10−24
m 4π ⋅ m T Speed Of Light
∫ E⋅ dA = e qenc
Potential Energy Potential Energy 1
0 c=
0⋅ 0
Gauss' Law For Magnetism U = − s ⋅ B ext = − s,z ⋅ B U = − orb ⋅ B ext = − orb,z ⋅ Bext
∫ B⋅ dA = 0 Orbital Magnetic Inside A Circular Capacitor Outside A Circular Capacitor
Dipole Moment ⋅i ⋅i
Faraday's Law B = 0 d2 r B= 0 d
e 2π ⋅R 2π ⋅r
orb = −
∫ E⋅ ds = −dΦ dt
B
2m
Lorb
Potential Potential LC Circuit
Displacement Current
Ampére -Maxwell Law q2 L⋅i 1
dΦ E UE = UB = LC =
i = 0 L⋅C
∫ B⋅ ds = 0 ⋅ 0 dΦ 2C 2
E
+ 0 ⋅ ienc d dt
dt
i = id , Capacitor
Page 2
 Physics Reference Electricity & Magnetism James Lamberg
LC Circuit Q2 RLC Circuit
⋅ cos 2 ( ⋅ t +  1 2
UE = ) =
2
−  
d 2q q 2C di Q
+ =0 L + i⋅R + = 0  2 LR 
LC
L
dt 2 C Q2 dt C
UB = ⋅ sin 2 ( ⋅ t + )
q(t ) = Q ⋅ cos( ⋅ t + ) 2C q(t ) = A ⋅ e −t 2 LR
⋅ cos( ⋅t −
L ) Q2 −t LR
LC
U= LR e=
i( t) = − ⋅ Q ⋅ sin( ⋅ t + ) Capacitive Reactance Impedance
R 2C
Phase Constant
RLC Circuit w/ AC 1 Z = ( X L − XC ) + R 2
2
XC = X − XC
di Q d ⋅C tan( ) = L
L + i ⋅ R + = B ⋅ sin( d ⋅ t) Inductive Reactance R
dt C Current Amplitude
XL = d ⋅ L Resonance rms current
i( t) = iB ⋅ sin( d ⋅ t − )
i= B
1 i
iB = Z Z Average Power
d = = irms =
L⋅C
B
2
Pav = irms ⋅ R
2
rms potential Average Power
V P = rms ⋅ irms ⋅ cos( ) Not "rms Power" Resistance Load at Generator
Vrms = , rms = B av
2 2 Transformer Current Average Power relates  N 2
Req =  1st  ⋅ R
Transformer Voltage N to the heating effect  N 2nd 
i2nd = i1st 1st
N N 2nd RMS Power, while it
V2nd = V1st 2nd
N1st can be calculated is worthless

Maxwell's Equations (Integral) Maxwell's Equations (Derviative)

∫ E⋅ dA = qenc ∇ •E =
0 0

∫ B⋅ dA = 0 ∇ •B = 0
B
∫ E⋅ ds = −dtd ∫ B⋅ dA ∇ ×E = −
t
1 E
∫ B⋅ ds = ∫ E ⋅ dA
1 d ∇ ×B = ⋅ J+ ⋅
0 ⋅ ienc + 0
c 2 dt
c 2 dt

Page 3
Math Reference Sequences & Series James Lamberg
P and Q is P ∧Q ¬Q ⇒ ¬P is contrapositive of P ⇒ Q N = Set of positive int egers
P or Q is P ∨Q and these are equivalent Z = Set of all i n tegers
not P is ¬P Q ⇒ P is converse of P ⇒ Q Q = Set of rational numbers
if P then Q is P ⇒ Q and these may not be equivalent R = Set of real numbers
P if and only if Q is P ⇔ Q The set A is finite if A = ∅ or for some n ∈ N, Mathematical Induction :
Existential Quantifier : A has exactly n members. 1) ∀n ∈ N, P or ve Base Case that
∀x : for all/every x The set A is infinite if A is not finite. P(1) is true
Universal Quantifier : Well Ordering Property of N : 2)Assume P ( n) and ∀n ∈ N,
∃x : there exists x Every nonempty subset of N has show P ( n) ⇒ P ( n +1)
∈: element of a smallest memeber
Pr inciple of Mathematical Induction Strong Induction
Let P (n ) be a mathematical statement, if 1) P (1) is true, and
a) P (1) is true, and 2) for each n ∈ N, if [each P (1),...,P ( n) is true],
b) for every n ∈ N then P ( n +1) is true, then P ( n) is true ∀n ∈ N
P( n) ⇒ P (n +1) is true, P is a necessary condition for Q : Q ⇒ P
¬( P ∧ Q) is ¬P ∨¬Q
then P ( n) is true for every n ∈ N P is a sufficient condition for Q : P ⇒ Q
¬( P ∨ Q) is ¬P ∧¬Q
The least upper bound, r, of A is the supremum Archimedean Property of N : ¬( P ⇒ Q) is P ∧ ¬Q
of and is denoted sup A, that is r =sup A if: N is not bounded above
a) r is an upper bound of A, and Completeness Axiom :Every nonempty
b) r ≤ r' for every upper bound r' of A subset of R which is bounded above has
The greatest lower bound, r, of A is the infimum a least upper bound
of and is denoted inf A, that is r =inf A if: For every positive real number x, there is
a) r is a lower bound of A, and 1
some positive i n teger n such that 0 < < x
b) r ≥ r' for every upper bound r' of A n
sup A exists if A has a least upper bound and For all real numbers x and y such that x < y,
inf A exists if A has a greatest lower bound there is a rational number r such that x < r < y
Bounds: Suppose A is a set of real numbers For all real numbers x and y such that x < y,
1) r ∈ R is an upper bound of A if no member there is an irrational number ir such that x < ir < y
of A is bigger than r : ∀x ∈ A[ x ≤ r] There is no rational number r such that r 2 = 2
2) r ∈ R is a lower bound of A if no member There is a real number x such that x2 = 2
of A is smaller than r : ∀x ∈ A [r ≤ x ] Let n ∈ N. For every real number y > 0,
3) A is bounded above if ∃r ∈ R which is an there is a real number x > 0 such that x n = y
upper bound of A Completeness Axiom Corollary :Every
A is bounded below if ∃r ∈ R which is a nonempty subset of R which is bounded
lower bound of A below has a greatest lower bound
A is bounded if if is bounded above and below

Page 1
Math Reference Sequences & Series James Lamberg
A sequence is a function whose domain is a Definition of a Limit : lim sn = L is
set of the form {n ∈ Z : n ≥ k}, where k ∈ Z Let L be a real number. n→∞

limsn = L is
If s is a sequence, sn is the value of the lim sn = L iff
n→∞ sn → L
∀ > 0 ∃n0 ∀n ≥ n0 [ sn − L < ]
sequence at arg ument n.
Given { an } and {bn } with domain D :
The sequence s converges to L if lim sn = L .
{ an + bn } is sn = an + bn ∀n ∈ D n →∞

{ an − bn } is sn = an − bn ∀n ∈ D The sequence s is convergent if there is some

L such that s converges to L.
{ an ⋅ bn } is sn = an ⋅ bn ∀n ∈ D
The sequence s is divergent if is is not convergent
 an  a
  is sn = n ∀n ∈ D,bn ≠ 0 If lim sn = L0 and sn = L1 , then L0 = L1
 bn  bn
The sequence { sn } is bounded if
{ c ⋅ an } is sn = c ⋅ an ∀n ∈ D
there is some r ∈ R such that sn ≤ r
If a sequence is convergent,
for all n in the domain of { sn }.
then it is bounded
Suppose l i msn = L1 , and lim tn = L2 , and c ∈ R. Suppose that for all sufficiently large n,
an ≤ bn ≤ c n
( n + tn ) = L1 + L2
a) l i ms
If lim an = L and limcn = L then limbn = L
b) lim (c ⋅ sn ) = c ⋅ L1
c) lim (sn ⋅ tn ) = L1 ⋅ L2 If lim sn = 0 , then l i msn = 0
s  L Suppose : l i man = L, and f is a function which
d) lim n  = 1 , L2 ≠ 0 and ∀n[ tn ≠ 0] is continuous at L, and for each n, an is in the
 tn  L2
domain of f . Then lim f ( an ) = f ( L)
f is continuous at x if for any > 0 there exists The set of reals R is the completion of the set
some > 0 so that if z - x < , then f ( z) - f ( x ) < of i n tegers Q. Or R = {sup A | A ⊆ Q}

Let sn = f ( n). If lim f ( x) = L, then lim sn = L Let {sn } be a sequence. lim sn = ∞ if :

x →∞
 1 ∀M∃n0 ∀n ≥ n0 [sn ≥ M ]
Let sn = f   . If lim+ f ( x ) = L, then l i msn = L
 n x →0 limsn = − ∞if :
The sequence {sn } is: ∀M∃n0 ∀n ≥ n0 [sn ≤ M ]
increa sing if for all n, sn ≤ sn+1 Suppose {sn } is monotonic. Then Re cursively Defined Sequence is
strictly increasin g if for all n, sn < sn+1 {sn } converges iff it is bounded. defined in terms of sn for each n.
decreasin g if for all n, sn ≥ sn +1 The sequence {sn } is a Cauchy sequence f is continuous and x ≥ a
strictly decreasin g if for all n, sn > sn+1 if for every > 0, there is some n such ∞
0 If ∫ f ( x) dx converges
monotonic if any of the above are true
that sm - sn < for all m, n ≤ n 0 a
∞
Cauchy sequences are bounded and converge then ∫ f (x )dx converges
∞ n a

∫ f ( x )dx = limsn = lim ∫ f ( x )dx Geometric Series : a and r are real ∞

If lim a i ≠ 0, then∑ a i is divergent
n →∞ ∞

∑ a ⋅ r , with r being the ratio

a a
i
i=1
i =0
Page 2
Math Reference Sequences & Series James Lamberg
Comparison Test Given a sequence { An } we form {Sn } by :
0 ≤ f ( x ) ≤ g( x ), x ≥ a n

∞ ∞ Sn = ∑ ai
i)If ∫ f (x )dx converges, then ∫ g( x )dx converges i=1

a a i) If {Sn } converges, we say the i n finite series :

∞ ∞
∫ f ( x )dx ≤ ∫ g( x )dx n n
and
a a
∑ a converges to ∑ a = limS , the value of the series
i i n
i=1 i=1
∞ ∞
ii)If ∫ f ( x )dx diverges, then ∫ g( x )dx diverges ii) If {Sn } diverges, we say the i n finite series :
a a n

∞ ∑ a diverges also.
i
i) Suppose ∑ a is convergent, for c ∈ R,
i
i=1
n
∑a
i=1
iii) If l i mSn = ∞ we say : = ∞ and
∞ ∞  i

∑ i ∑ ai 
c ⋅ a = c i=1

i=1 i=1 the series diverges to inf inity.

∞ ∞ n
ii) If ∑a i is convergent, and ∑ bi is convergent iv) If lim Sn = ∞ we say : ∑ a = − ∞and
i
i=1 i=1 i=1
∞ the series diverges to min us i n finity.
then ∑( ai + bi ) is convergent a n d :
i=1 i) If r< 1 then the geometric series
∞ ∞ ∞
∑ (a + b ) = ∑ a + ∑ b
∞

∑a ⋅ r i a
i i i i converges to
i=1 i=1 i=1
i= 0 1-r
Integral Test ii) If r≥ 1 and a ≠ 0 then
f is continuous and decrea sing on the i n terval [1, ∞) ∞

and f ( x ) ≥ 0 for x ≥ 1 ∑a ⋅ r i
diverges
i= 0
∞ ∞
For all n, 0 < a n
∑ f (n ) converges iff ∫ f ( n) converges. Ratio Test
∞
= L < 1 then ∑a n converges
n =1 1 a n+1
∞ ∞
If lim
∑ an is absolutely convergent if ∫ x1 dx converges if p > 1 an n=1
p ∞
= L > 1 or → ∞then ∑ a n diverges
n=1 1 a n+1
If lim
∞ and diverges if p ≤ 1 an
∑a is convergent ∞
n=1

For all n, 0 < a n

n
n=1
∞
∑ x1 p
converges if p > 1
Root Test
∞
So ∑ an is convergent If lim(a n ) n = L < 1 then ∑ a n converges
n=1 1

n=1
and diverges if p ≤ 1 n=1
∞
Comparison Test 0 ≤ an ≤ bn If lim(a n ) = L > 1 or → ∞ then ∑ a n diverges
1
n
{an } and {bn } are sequences n=1

∞ ∞ n − th term test for divergence

If ∑ bn converges then ∑ an converges ∞
n =1 n =1 If l i man ≠ 0, then ∑ an is divergent
∞ ∞
If ∑ an diverges then ∑ bn diverges
n =1

n =1 n =1

Page 3
Math Reference Sequences & Series James Lamberg
Limit - Comparison Test Alternating - Series Test The int erval of convergence
For all n, 0< an and 0 < bn For all n, an > 0 ∞
of the power series ∑a x n

{an } is a strictly decreasin g sequence

n
a
If lim n = L > 0, L ∈ ℜ n= 0
bn an → 0 is the set
∞ ∞
 
∑a converges then ∑ bn converges Then ∑ (−1) n+1 a is convergent
∞ ∞
n  x : ∑ an x n is convergent at x
n =1 n =1
n  n =0 
n =1
a
If lim n = 0 ∞
bn The power series ∑a x n
n
converges at the Differentiation and
∞ ∞ n= 0

∑b n converges then ∑ an converges ∞

real number x1 if ∑ an x1 converges and
n
Integration of power
n =1 n =1 series can be done
n= 0
an term by term
If lim →∞ ∞
bn diverges at x1 if ∑ an x1 n diverges
∞ ∞ n= 0

∑b diverges then ∑ an diverges ∞

∑a x
n n
n =1 n =1 If the power series n is :
∞ n =0

For a given power series ∑a x n

n
convergent only at x = 0 ,then the
, one of
n =0
radius of convergence is 0
the following is true :
Absolutely convergent at all x, then the
The power series converges only at x = 0
radius of convergence is ∞
The power series absolutely converges at all x
Converges absolutely at all x such that
There is a number r > 0 such that the power
x < r and diverges at all x such that x > r,
series converges absolutely at all x such that
then the radius of convergence is r
x < r and diverges at all x such that x > r
Abel' s Theorem Suppose that r > 0, and If f ( x ) = a0 + a1 x + ...+ an x n + ... for x < r
∞ ∞ xn
Suppose f ( x ) = ∑ an x f ( x ) = ∑ an x for x < r f ( x ) = f (0) + f ' (0) x + f ( n ) (0) + ...
n n
n!
n= 0 n= 0
Taylor's Theorem
for x < 1 f ( n ) (0)
Then for all n ≥ 0, an = Assume that f has continous derivatives
∞ n!
If ∑ an converges, then of order n +1 on [0 , x], then
n= 0
x

∫ f ( ) (t)( x − t )
1
R n ( x) =
∞ n +1 n
lim f ( x ) = ∑ an
dt
x →-1
n! 0
n= 0

Page 4
 Math Reference SAT IIC James Lamberg
Repeated Percent Increase Percent Change log b ( xy) = log b ( x ) + log b ( y )
30-60-90 Triangle
Final Amount = Original ⋅ (1+ rate ) Change x  
# changes
= x
Original 100 log b  y  = log b ( x ) − log b ( y )
1: 3 : 2
Repeated Percent Decrease 45-45-90 Triangle
Final Amount = Original ⋅ (1− rate) #changes log b ( x ) = n logb ( x )
n
1:1: 2
distance = rate ⋅ time
ln n = x ( x + y )2 = x 2 + 2xy + y 2 y = ax 2 + bx + c
Area of Square
TotalDistan ce
log e n = x ( x − y ) 2 = x 2 − 2xy + y 2 AverageSpeed = d2
= =
2
−b ± b − 4ac A s or A
2
TotalTime
x= 2
ex = n ( x + y )( x − y ) = x 2 − y 2 2a Triagle Area Domain : x − values
TriangleInternalAngles = 180°
A = bh
1 Range : y − values
Freds Theorem 2 Roots : f ( x ) = 0
2 II lines intersected make only 2 unique angles Equilateral Triagle Area
log b n = x
3rd triangle side between sum and difference of other two s2 3
A= bx = n
a2 + b2 = c 2 4
Sum Internal Polygon w/ n Sides Rect Solid Surface Area i1 = i Parabola y = a( x − h) 2 + k
SumAngles = ( n − 2)180° i 2 = −1
SA = 2lw + 2wh + 2lh Circle r 2 = ( x − h) + ( y − k )
2 2

y = mx + b i 3 = −i
Long Diagonal ( x − h ) + (y − k )
2 2

y − y1 = m( x − x1 ) a2 + b2 + c 2 = d 2 i =1
4 Ellipse 1=
a2 b2
d = ( x2 − x1 ) 2 + ( y 2 − y1 )2 Area of Trapezoid deg rees radians
= Hyperbola 1 =
(x − h )2 − ( y − k ) 2
 b1 + b2  360 2π a2 b2
 x 2 + x1 y 2 + y1 
midpt =  ,  A =  h
 2 2  2  Work Done=rate of work ⋅ time Arithmetic Series
Polar x-axis symmetry
opp adj opp sin an = a1 + ( n − 1)d
sin = =
hyp
cos=
hyp
t a n=
adj cos x = r cos y = r sin ∃ f ( x ) and − f ( x) ∀x
Arithmetic Sum
1 1 1 r 2
= x 2
+ y 2
Infinite Geometric a +a 
csc = sec = cot = Sum = n 1 n 
sin cos cos x a1  2 
tan = Sum = ,−1< r < 1
sin x + cos x = 1
2 2
y 1− r
sin sin sin Even : f ( x ) = f (−x ), y − axis Contrapositive
= =
a b c Odd : − f ( x ) = f (−x ),origin A → B ∴ ~ B →~ A
c = a + b − 2abcos
2 2 2
Geometric Series
Probabilty of Multiple Events
an = a1 r( n−1)
∑ ( xi − )
2
P( x n ) = P ( x1 ) ⋅ P ( x 2 ) ⋅ P ( x 3 ) ⋅ P ( x 4 )...
Standard Deviation = = Geometric Sum
N Group Problem
Total = Group1 + Group2 + Neither − Both Sum = a1 (1− r )
n
Find the mean of the set
Find difference between each value and mean 1− r
M e a n : Average of set elements
Square differences Cube V = s SA = 6s23
Median : Middle Value
Average results M o d e : Most Often LongDiagonal = s 3
Square root the average Cylinder V = πr2 h
Range : Highest- Lowest
Number of outcomes that are x
Probability( x) = SA = 2πr 2 + 2πrh
Total possible outcomes Page 1