about ECON1202
1 · Cash-flow ClockCh 1 · final priority
Before calculating, name focal date, rate period and number of those periods. Positive rate + forward time raises value; discounting lowers it. For q nominal compounded k times yearly, r=q/k and n=yk.
single cash flowS=P(1+r)ⁿ · P=S(1+r)⁻ⁿ
continuous: S=Peʲᵗ · unknown n=ln(S/P)/ln(1+r)
effective annual comparisonEAR=(1+q/k)ᵏ−1. Compare offers only on a common horizon; multi-stage value = P × product of each stage factor.
| If asked | Move | Close with |
|---|---|---|
| Future value | multiply | S>P if r>0 |
| Present value | divide | P<S if r>0 |
| Target time | logs | test adjacent complete periods |
| Rate quote | one-year factor | rank EARs |
Translation audit
| Given phrase | Write before keys |
|---|---|
| nominal annual q, monthly | r=q/12; n=12×years |
| effective annual | one yearly factor 1+r |
| continuous annual j | time t stays in years |
| rate changes part-way | one factor per regime; multiply |
For unknown n, logs give the crossing time; if crediting uses complete periods, verify both neighbouring integers. Across rate changes, multiply separate stage factors rather than averaging rates.
2 · NPV & IRRCh 2 · decision
signed valuationNPV=F₀+F₁/(1+r)+⋯+Fₜ/(1+r)ᵀ
IRR is r solving NPV=0; required return is the external benchmark.
| Result | Decision / warning |
|---|---|
| NPV>0 | accept at stated required return |
| NPV<0 | reject at stated required return |
| unusual sign changes | IRR may have several or no meaningful roots |
Equation-of-value method
3 · Annuity RecognitionCh 3 · timing
ordinary annuityPV=R[1−(1+r)⁻ⁿ]/r
FV=R[(1+r)ⁿ−1]/r
timing variantsdue value=(1+r)×ordinary value
loan R=A·r/[1−(1+r)⁻ⁿ] · perpetuity PV=R/r
| Stream | Recognition | Check |
|---|---|---|
| ordinary | equal end payments | first at 1 |
| due | equal start payments | first at 0 |
| loan | principal now; instalments later | PV of payments=A |
| mixed | lump sum + stream | value separately, then join |
Never combine at different dates. Rate interval must match payment interval; n counts payments, not merely calendar labels.
Method: mark time 0, first and last payments and the valuation date; confirm equal amount, spacing and finite count; choose PV or FV from the requested date. Explain a due shift and decompose mixed streams.
| Direction check | Expected relation |
|---|---|
| saving, r>0 | final balance exceeds total contributions |
| loan, r>0 | total instalments exceed principal |
| due vs ordinary, same focal date | due value is larger by factor 1+r |
| present value of future payments | below their undiscounted total |
4 · Counting ChooserCh 4 · structure
core countsⁿPᵣ=n!/(n−r)! · ⁿCᵣ=n!/[r!(n−r)!]
non-negative x₁+⋯+xₖ=n: C(n+k−1,k−1)
circle with rotations identical: (n−1)!
5 · Conditional ProbabilityCh 5 · Bayes
denominator changesP(A|B)=P(A∩B)/P(B), P(B)>0
P(A∩B)=P(A)P(B|A)
independence: P(A∩B)=P(A)P(B)
Bayes reversalP(A|S)=P(A)P(S|A) / [P(A)P(S|A)+P(Aᶜ)P(S|Aᶜ)]
| Task | Visible working | Check |
|---|---|---|
| conditional | intersection / conditioned event | denominator is restricted set |
| tree | multiply path; add endpoints | siblings sum to 1 |
| Bayes | all evidence routes below | posterior direction fits evidence |
| independence | test equality numerically | not the same as disjoint |
Tree discipline: label events and complements; multiply down, add endpoints; for Bayes divide the target path by all evidence paths.
total probabilityP(S)=P(A)P(S|A)+P(Aᶜ)P(S|Aᶜ)
Disjoint positive-probability events are not independent. Compare a posterior with its prior: evidence more likely under A should raise P(A).
| Bound check | Requirement |
|---|---|
| branch split | children sum to 1 |
| terminal / posterior | between 0 and 1 |
| weighted mixture | between component rates |
| independence | conditional equals marginal |
6 · Matrix ProductsCh 6 · dimensions
7 · Eliminate, Then ClassifyCh 7 · systems
Legal row operations: swap rows; multiply a row by a non-zero constant; replace a row by itself plus a multiple of another. Apply each operation across the augmentation bar.
| Echelon evidence | Conclusion | Close |
|---|---|---|
| contradiction row | no solution | stop |
| consistent, rank=unknowns | unique | back-substitute |
| consistent, rank<unknowns | infinitely many | parameterise free variables |
Sequence: declare variable order; build [A|b]; choose a non-zero pivot or swap; clear below; move right and down to a staircase; then scan bottom-up for contradiction before counting pivots.
Echelon form: pivots move right, entries below them are zero, and zero rows sit last. Rank is the pivot count; free variables follow only after consistency.
Audit: operations reach the constant; zero pivots trigger a search; only [0…0|c≠0] contradicts; every free column receives a parameter.
For applied systems, add non-negativity, integrality or capacity restrictions after the algebraic family. Verify in every original equation.
8 · Determinant & InverseCh 8 · square only
2×2 inverseA=[a b; c d], det(A)=ad−bc
A⁻¹=(1/(ad−bc))[d −b; −c a], only if det(A)≠0
| Row action | Effect on det |
|---|---|
| replace Rᵢ by Rᵢ+kRⱼ | unchanged |
| swap two rows | sign flips |
| scale row by k | det scales by k |
| triangular form U | product of diagonal, after ledger |
Square A: rank n ⇔ det(A)≠0 ⇔ A⁻¹ exists ⇔ Ax=b has one solution for every b. A zero pivot calls for a swap; singularity requires a missing pivot.
Choose the cheapest route
9 · EigenpairsCh 9 · two stages
reasoning chainAv=λv, v≠0 ⇒ (A−λI)v=0
non-zero v requires det(A−λI)=0
Solve the scalar characteristic equation first. For each λ, solve the homogeneous system and choose a non-zero representative. Every non-zero scalar multiple is the same eigendirection.
| Shortcut / check | Use |
|---|---|
| triangular A | eigenvalues are diagonal entries |
| 2×2 roots | sum=trace(A); product=det(A) |
| candidate pair | compare Av with λv componentwise |
| repeated λ | solve null space; do not infer directions from multiplicity |
Workflow: form A−λI; solve det(A−λI)=0; for each root solve the homogeneous system; choose a non-zero representative; verify Av=λv. Preserve diagonal signs and keep roots separate.
| λ | Action along eigenline |
|---|---|
| λ>1 | stretch, same direction |
| 0<λ<1 | shrink, same direction |
| λ<0 | reverse direction and scale |
| λ=0 | map that non-zero vector to zero |
The zero vector is never an eigenvector; non-zero scalar multiples represent the same direction.
10 · Differentiate by StructureCh 10 · rule choice
rules to print(fg)′=f′g+fg′
(f/g)′=(f′g−g′f)/g², g≠0
d[f(g(x))]/dx=f′(g(x))g′(x)
basic derivativesd(xⁿ)/dx=nxⁿ⁻¹ · d(eᵍ)/dx=eᵍg′
d(ln g)/dx=g′/g, with g>0 in the real logarithm used here
point elasticityη=(p/q)(dq/dp). It is unit-free; sign gives direction, |η| gives local responsiveness at the stated point.
| Failure signal | Repair |
|---|---|
| product derivative has one term | differentiate each factor in turn |
Answer path
11 · Integrate & Model GrowthCh 11 · verify twice
antiderivatives∫xⁿdx=xⁿ⁺¹/(n+1)+C, n≠−1
∫1/x dx=ln|x|+C
∫eᵃˣdx=eᵃˣ / a + C, a≠0
∫ₐᵇf(x)dx=F(b)−F(a)
| Question | Must show | Check |
|---|---|---|
| indefinite | family + C | differentiate |
| definite | F(b)−F(a), bracket lower value | sign + accumulated units |
| total area | split at zeros if needed | add magnitudes |
differential equationsdy/dt=ky ⇒ y=y₀eᵏᵗ
dy/dt=k(M−y) ⇒ y=M−(M−y₀)e⁻ᵏᵗ
Verify twice: substitute t=0 to recover y₀; differentiate to recover the rate law. With k>0, limited growth approaches M rather than reaching it in finite time.
| Model cue | Constant / units | Behaviour |
|---|---|---|
| rate proportional to level | k has reciprocal-time units | percentage pattern |
| rate proportional to M−y | M−y₀ sets initial gap | slows near capacity |
| proposed solution | same time unit in kt | check initial + derivative |
12 · OptimisationCh 12 · classify
unconstrainedsolve fₓ=0 and fᵧ=0.
D₁=fₓₓ; D₂=fₓₓfᵧᵧ−fₓᵧ²
| D₂ | D₁ | Local class |
|---|---|---|
| >0 | <0 | maximum |
| >0 | >0 | minimum |
| <0 | any | saddle |
| =0 | any | test inconclusive |