CLASS 12 APPLIED MATHEMATICS – FORMULA SHEET
1. MATRICES
• A = [a_ij]; A + B = [a_ij + b_ij]
• Scalar multiplication: kA = [k·a_ij]
• Matrix multiplication: (AB)_ij = Σ a_ik b_kj
• Determinant (2×2): |a b; c d| = ad – bc
• Determinant (3×3): a(ei − fh) − b(di − fg) + c(dh − eg)
• Adjoint: adj(A) = transpose(cofactor matrix)
• Inverse: A■¹ = adj(A)/|A| (if |A| ≠ 0)
2. DIFFERENTIATION
• d/dx (x■) = n x■■¹
• d/dx (sin x) = cos x; d/dx (cos x) = –sin x
• d/dx (tan x) = sec² x
• Product rule: (uv)' = u'v + uv'
• Quotient rule: (u/v)' = (u'v − uv') / v²
• Chain rule: d/dx[f(g(x))] = f'(g(x))·g'(x)
• Log derivatives: (log x)' = 1/x; (e■)' = e■
3. INTEGRATION
• ∫ x■ dx = x■■¹/(n+1) + C
• ∫ 1/x dx = ln|x| + C
• ∫ e■ dx = e■ + C
• ∫ sin x dx = –cos x + C
• ∫ cos x dx = sin x + C
• ∫ 1/(1+x²) dx = arctan x + C
• Integration by parts: ∫u dv = uv – ∫v du
4. DIFFERENTIAL EQUATIONS
• dy/dx = f(x) → y = ∫ f(x) dx + C
• dy/dx + Py = Q → y·e^{∫P dx} = ∫ Q e^{∫P dx} dx + C
5. LINEAR PROGRAMMING
• Objective: Max/Min Z = ax + by
• Subject to linear constraints.
• Feasible region → corner point method.
6. PROBABILITY
• P(A) = n(A)/n(S)
• P(A ∪ B) = P(A) + P(B) − P(A ∩ B)
• P(A|B) = P(A ∩ B) / P(B)
• Independent events: P(A ∩ B) = P(A)P(B)
7. RANDOM VARIABLES & DISTRIBUTIONS
• Mean: E(X) = Σ x·P(x)
• Variance: Var(X) = E(X²) − (E(X))²
• Binomial: P(X=k)= C(n,k) p■ (1−p)^{n−k}
8. FINANCIAL MATHEMATICS
• Simple Interest: SI = PRT/100
• Compound Interest: A = P(1 + r/n)^{nt}
• EMI: EMI = [P·r·(1+r)■] / [(1+r)■ − 1]
9. NUMERICAL APPLICATIONS
• Depreciation (WDV): V = P(1 − r/100)■
• Inflation index: New value = Old value × (Index2/Index1)
10. LINEAR REGRESSION
• Slope (b) = Σ(x−x■)(y−■) / Σ(x−x■)²
• Intercept (a) = ■ − b·x■
• Regression line: y = a + bx