This chapter introduces the basic ideas of limits and derivatives, which form the foundation of Calculus. It begins with a physical example of a body falling from a height, where the displacement is given by $s = 4.9t^{2}$, and uses average velocity over time intervals to motivate the need for instantaneous velocity at a specific time. This leads naturally to the concept of a limit, interpreted as the expected value of a function $f(x)$ as $x$ approaches a point, regardless of the actual value of $f$ at that point. The chapter then develops the notion of limits more systematically through numerical tables and graphs. It distinguishes left hand and right hand limits, explaining that a limit at $x = a$ exists only if both one-sided limits exist and are equal. Algebra of limits is presented for sums, differences, products, quotients, and constant multiples, and is applied to evaluate limits of polynomial and rational functions, including resolving $\tfrac{0}{0}$ forms by factorisation. The Sandwich Theorem is introduced and used, along with geometric arguments in the unit circle, to prove the key inequality $\sin x < x < \tan x$ for $0 < x < \tfrac{\pi}{2}$, and hence to derive the standard trigonometric limits $\lim_{x \to 0} \tfrac{\sin x}{x} = 1$ and $\lim_{x \to 0} \tfrac{1 - \cos x}{x} = 0$. Using these limit ideas, the chapter defines the derivative of a function at a point $a$ as the limit of the difference quotient $\dfrac{f(a + h) - f(a)}{h}$ as $h \to 0$. It highlights two important interpretations: geometrically, the derivative equals the slope of the tangent to the curve $y = f(x)$ at that point; physically, it represents an instantaneous rate of change, such as velocity. The derivative function $f'(x)$ is then defined for all points where this limit exists. Finally, the chapter derives the differentiation rules: the power rule for $x^{n}$, derivatives of constant and linear functions, as well as sum, difference, product, and quotient rules. Using these, standard derivatives of elementary trigonometric functions $\sin x, \cos x, \tan x, \cot x, \sec x, \csc x$ and simple combinations like $\sin^{2} x$ are obtained, providing a toolkit that will be used throughout calculus.23:Tcf4,This chapter extends the study of statistics from central tendency to dispersion. Earlier, measures like arithmetic mean, median and mode were used to locate the central value of a data set. However, these measures alone do not describe how the data are spread. Two series may have the same mean and median but very different variability. The example of the scores of two batsmen with the same mean of $ 53 $ but different spreads illustrates this clearly. To quantify dispersion, several measures are introduced. The simplest is the range, defined as $ \text{Range} = \text{Maximum value} - \text{Minimum value} $. While range gives a quick idea of variability, it depends only on the extreme observations and ignores all intermediate values, so it is not reliable for deeper analysis. The chapter then introduces mean deviation, which is the mean of the absolute deviations of observations from a central value. For ungrouped data, mean deviation about a value $ a $ is given by $ \text{M.D.}(a) = \dfrac{1}{n} \sum \lvert x_i - a \rvert $. For discrete and continuous grouped data, frequencies are included. Mean deviation may be computed about mean or median. For continuous series, median is obtained through the median class using $ M = l + \dfrac{(\dfrac{N}{2} - C)}{f} h $, and then mean deviation about median is calculated using class midpoints. Limitations of mean deviation are discussed. Since mean deviation is based on absolute values, it cannot be used conveniently in algebraic derivations. Its value may also be unsatisfactory in series where median is not a good representative central tendency. Thus, a measure that uses squared deviations and allows algebraic treatment is needed. Variance and standard deviation fulfil this requirement. Variance is defined as the mean of the squares of deviations from the arithmetic mean: $ \sigma^{2} = \dfrac{1}{n} \sum (x_i - \bar{x})^{2} $ for ungrouped data, and $ \sigma^{2} = \dfrac{1}{N} \sum f_i (x_i - \bar{x})^{2} $ for grouped data. Standard deviation is the positive square root of variance, $ \sigma = \sqrt{\sigma^{2}} $. Another useful formula, $ \sigma^{2} = \dfrac{1}{N} \sum f_i x_i^{2} - \bar{x}^{2} $, often simplifies computations. For large values and grouped data, the step-deviation method is introduced. An assumed mean $ A $ and common factor $ h $ are chosen, and a new variable $ y_i = \dfrac{x_i - A}{h} $ is used. Then $ \bar{x} = A + h \times \dfrac{1}{N} \sum f_i y_i $ and $ \sigma^{2} = h^{2} \left[ \dfrac{1}{N} \sum f_i y_i^{2} - \left( \dfrac{1}{N} \sum f_i y_i \right)^{2} \right] $. This reduces arithmetic effort significantly. The chapter also examines how variance and standard deviation behave when data are transformed. Adding a constant $ a $ to each observation increases the mean by $ a $ but leaves variance and standard deviation unchanged. Multiplying each observation by a constant $ k $ multiplies the mean by $ k $, variance by $ k^{2} $ and standard deviation by $ \lvert k \rvert $. These properties are useful when correcting data or rescaling measurements. Overall, the chapter equips the learner with key tools to measure and interpret variability in data, emphasising that meaningful statistical conclusions require both central tendency and dispersion.24:Tebd,This chapter introduces mathematical reasoning in probability through the concept of events and the axiomatic approach. A random experiment has an associated sample space $S$, which collects all possible outcomes. Any subset of $S$ is called an event. For example, in tossing a coin twice, the sample space is $S = \{HH, HT, TH, TT\}$, and the event 'exactly one head' is $E = \{HT, TH\}$. The empty set $\varnothing$ represents an impossible event, while the entire sample space $S$ represents a sure event. Events are classified as simple or compound. A simple (elementary) event contains exactly one outcome of $S$. Any event with more than one outcome is a compound event. The occurrence of an event depends on the actual outcome $\omega$ of the experiment; event $E$ occurs if $\omega \in E$ and does not occur if $\omega \notin E$. The chapter then develops the algebra of events using set operations. The complement of an event $A$ is $A' = S - A$, representing 'not A'. The union $A \cup B$ represents 'A or B or both', while the intersection $A \cap B$ represents 'A and B'. The set difference $A - B$ denotes 'A but not B' and equals $A \cap B'$. Two events are mutually exclusive if $A \cap B = \varnothing$; they cannot occur simultaneously. A family of events is exhaustive if their union equals the whole sample space. When events are pairwise disjoint and exhaustive, they form a partition of $S$. The chapter explains axiomatic probability, where probability $P$ is a function from the power set of $S$ into the interval $[0, 1]$. It satisfies three basic axioms: (i) $P(E) \geq 0$ for every event $E$, (ii) $P(S) = 1$, and (iii) for mutually exclusive events $E$ and $F$, $P(E \cup F) = P(E) + P(F)$. From these axioms, important consequences follow, such as $P(\varnothing) = 0$. For a finite sample space $S = \{\omega_1, \omega_2, \dots, \omega_n\}$, each outcome has a probability $P(\omega_i)$ with $0 \leq P(\omega_i) \leq 1$ and $\sum_{i=1}^n P(\omega_i) = 1$. For any event $A$, the probability is $P(A) = \sum_{\omega_i \in A} P(\omega_i)$. The classical case of equally likely outcomes occurs when all sample points have the same probability. If $n(S) = n$ and $n(A) = m$, then $P(A) = \dfrac{m}{n}$. This idea is applied to situations like cards, dice, coins, and combinatorial selections (e.g., committees, hands of cards, and arrangements of cities visited). A central result derived in the chapter is the addition theorem for two events: $P(A \cup B) = P(A) + P(B) - P(A \cap B)$. This formula comes from the fact that when adding $P(A)$ and $P(B)$, the probability of $A \cap B$ is counted twice and must be subtracted once. For mutually exclusive events, $P(A \cap B) = 0$, so $P(A \cup B) = P(A) + P(B)$. The complement rule $P(A') = 1 - P(A)$ is obtained from the fact that $A$ and $A'$ are mutually exclusive and exhaustive. Further derived relations include $P(A' \cap B') = 1 - P(A \cup B)$, $P(A \cap B') = P(A) - P(A \cap B)$, and $P(A' \cap B) = P(B) - P(A \cap B)$. Throughout the chapter, numerous examples and exercises illustrate how to model events with sets and compute probabilities: drawing cards from a deck, selecting coloured discs from a bag, forming committees from men and women, distributing prizes in a lottery, and working with real-life situations involving exam results or subject choices. The chapter also shows that different probability assignments can be valid for the same experiment, as long as the axioms are satisfied. Finally, the historical note highlights key contributors to probability theory, from Cardan and Pascal to Kolmogorov, who formalised the axiomatic foundations used in this chapter.25:T5b9,This Appendix explains the idea of mathematical modelling as a systematic way of translating real-life situations into mathematical language, solving the resulting model, and then interpreting the solution back in the original context. It starts with a simple trigonometric example (height of a tower) to show how identifying variables, relating them using known formulae like $ h = d \tan \theta $, and substituting numerical values gives a practical answer. It then discusses the famous Konigsberg bridge problem and shows how Euler converted a real city map into a network (graph) of vertices and arcs, launching graph theory. The chapter formally defines mathematical modelling as expressing physical situations in mathematical terms under suitable assumptions, and it lays out the main stages: understanding the problem, formulation (identifying parameters and writing equations/inequalities), solution (using appropriate mathematics), and interpretation/validation by comparing with observed data. Through detailed examples involving a simple pendulum, a minimum-cost diet mix using linear inequalities, and a population growth model $ P(t) = P(0) r^t $, it highlights how assumptions, approximations and validation are central to judging whether a model is useful. The modelling cycle is shown as an iterative process: if the model is not accurate enough, refine assumptions, reformulate and re-evaluate until the model gives reasonably reliable answers.20:["$","main",null,{"className":"page_layout__qILkH","children":[["$","aside",null,{"className":"page_desktopSidebar__TyKQu","aria-label":"Browse NCERT books","children":["$","$L1f",null,{"links":"$16:props:children:2:props:children:1:props:children:props:links","expandable":true,"numeralsPrefix":false,"defaultExpandedUrls":["/ncert-books/class-11"],"heading":"NCERT Books"}]}],["$","div",null,{"className":"page_content__FV6xc","children":[["$","div",null,{"className":"MobileBrowseButton_menu__w25FD","children":["$","button",null,{"className":"MobileBrowseButton_button__GzolI","type":"button","data-bs-toggle":"offcanvas","data-bs-target":"#leftsidebar","aria-controls":"leftsidebar","children":[["$","span",null,{"aria-hidden":"true","children":"☰"}],"Browse NCERT Books"]}]}],["$","section",null,{"className":"page_hero__9p7js","aria-labelledby":"book-title","children":[["$","div",null,{"className":"page_coverWrap__kN7mw","children":["$","$L8",null,{"src":"/images/ncert-books/covers/kemh1cc.jpg","alt":"Mathematics NCERT book cover","className":"page_cover__MmIuN","width":360,"height":480,"sizes":"(max-width: 767px) 145px, 190px","priority":true}]}],["$","div",null,{"className":"page_heroContent__Jf7cE","children":[["$","span",null,{"className":"page_eyebrow__5qvuL","children":["NCERT textbook • ","Class 11"]}],["$","h1",null,{"id":"book-title","children":"Mathematics"}],null,["$","p",null,{"className":"page_intro__i_9Un","children":"Browse the chapters in Mathematics for Class 11 and open the available NCERT PDFs."}],["$","dl",null,{"className":"page_meta__TcO5C","children":[["$","div",null,{"children":[["$","dt",null,{"children":"Subject"}],["$","dd",null,{"children":"Mathematics"}]]}],["$","div",null,{"children":[["$","dt",null,{"children":"Language"}],["$","dd",null,{"children":"English"}]]}],["$","div",null,{"children":[["$","dt",null,{"children":"Chapters"}],["$","dd",null,{"children":17}]]}],["$","div",null,{"children":[["$","dt",null,{"children":"Pages"}],["$","dd",null,{"children":338}]]}]]}]]}]]}],["$","section",null,{"className":"page_chapterSection__2NdlS","aria-labelledby":"chapters-heading","children":[["$","div",null,{"className":"page_sectionHeading__IyHGb","children":[["$","div",null,{"children":[["$","span",null,{"className":"page_eyebrow__5qvuL","children":"Chapter-wise PDFs"}],["$","h2",null,{"id":"chapters-heading","children":["Mathematics"," chapters"]}]]}],["$","p",null,{"children":"Open a chapter online, share its PDF, or download it for later."}]]}],["$","$L21",null,{"chapters":[{"name":"Prelims","internal_name":"","previous_heading":"$undefined","url":"https://ncert.nic.in/textbook.php?kemh1=ps-14","pdf":"https://ncert.nic.in/textbook/pdf/kemh1ps.pdf","formulas":"$undefined","points_to_remember":"$undefined","summary":"$undefined","revision_notes":"$undefined","pages_n":12},{"name":"Chapter 1","internal_name":"Sets","previous_heading":"$undefined","url":"https://ncert.nic.in/textbook.php?kemh1=1-14","pdf":"https://ncert.nic.in/textbook/pdf/kemh101.pdf","formulas":"$undefined","points_to_remember":"$undefined","summary":"$undefined","revision_notes":"$undefined","pages_n":23},{"name":"Chapter 2","internal_name":"Relations and Functions","previous_heading":"$undefined","url":"https://ncert.nic.in/textbook.php?kemh1=2-14","pdf":"https://ncert.nic.in/textbook/pdf/kemh102.pdf","formulas":"$undefined","points_to_remember":"$undefined","summary":"$undefined","revision_notes":"$undefined","pages_n":19},{"name":"Chapter 3","internal_name":"Trigonometric Functions","previous_heading":"$undefined","url":"https://ncert.nic.in/textbook.php?kemh1=3-14","pdf":"https://ncert.nic.in/textbook/pdf/kemh103.pdf","formulas":"$undefined","points_to_remember":"$undefined","summary":"$undefined","revision_notes":"$undefined","pages_n":33},{"name":"Chapter 4","internal_name":"Complex Numbers and Quadratic Equations","previous_heading":"$undefined","url":"https://ncert.nic.in/textbook.php?kemh1=4-14","pdf":"https://ncert.nic.in/textbook/pdf/kemh104.pdf","formulas":"$undefined","points_to_remember":"$undefined","summary":"$undefined","revision_notes":"$undefined","pages_n":13},{"name":"Chapter 5","internal_name":"Linear Inequalities","previous_heading":"$undefined","url":"https://ncert.nic.in/textbook.php?kemh1=5-14","pdf":"https://ncert.nic.in/textbook/pdf/kemh105.pdf","formulas":"$undefined","points_to_remember":"$undefined","summary":"$undefined","revision_notes":"$undefined","pages_n":11},{"name":"Chapter 6","internal_name":"Permutations and Combinations","previous_heading":"$undefined","url":"https://ncert.nic.in/textbook.php?kemh1=6-14","pdf":"https://ncert.nic.in/textbook/pdf/kemh106.pdf","formulas":"$undefined","points_to_remember":"$undefined","summary":"$undefined","revision_notes":"$undefined","pages_n":26},{"name":"Chapter 7","internal_name":"Binomial Theorem","previous_heading":"$undefined","url":"https://ncert.nic.in/textbook.php?kemh1=7-14","pdf":"https://ncert.nic.in/textbook/pdf/kemh107.pdf","formulas":"$undefined","points_to_remember":"$undefined","summary":"$undefined","revision_notes":"$undefined","pages_n":9},{"name":"Chapter 8","internal_name":"Sequences and Series","previous_heading":"$undefined","url":"https://ncert.nic.in/textbook.php?kemh1=8-14","pdf":"https://ncert.nic.in/textbook/pdf/kemh108.pdf","formulas":"$undefined","points_to_remember":"$undefined","summary":"$undefined","revision_notes":"$undefined","pages_n":16},{"name":"Chapter 9","internal_name":"Straight Lines","previous_heading":"$undefined","url":"https://ncert.nic.in/textbook.php?kemh1=9-14","pdf":"https://ncert.nic.in/textbook/pdf/kemh109.pdf","formulas":"$undefined","points_to_remember":"$undefined","summary":"$undefined","revision_notes":"$undefined","pages_n":25},{"name":"Chapter 10","internal_name":"Conic Sections","previous_heading":"$undefined","url":"https://ncert.nic.in/textbook.php?kemh1=10-14","pdf":"https://ncert.nic.in/textbook/pdf/kemh110.pdf","formulas":"$undefined","points_to_remember":"$undefined","summary":"$undefined","revision_notes":"$undefined","pages_n":32},{"name":"Chapter 11","internal_name":"Introduction to Three Dimensional Geometry","previous_heading":"$undefined","url":"https://ncert.nic.in/textbook.php?kemh1=11-14","pdf":"https://ncert.nic.in/textbook/pdf/kemh111.pdf","formulas":"$undefined","points_to_remember":"$undefined","summary":"$undefined","revision_notes":"$undefined","pages_n":9},{"name":"Chapter 12","internal_name":"Limits and Derivatives","previous_heading":"$undefined","url":"https://ncert.nic.in/textbook.php?kemh1=12-14","pdf":"https://ncert.nic.in/textbook/pdf/kemh112.pdf","formulas":"$undefined","points_to_remember":["Calculus studies the change in the value of a function when the variable changes; derivative is the main tool to measure this change.","Average velocity over an interval equals \$\\dfrac{\\text{displacement}}{\\text{time interval}}\$; instantaneous velocity at a time is obtained as a limit of average velocities over smaller and smaller intervals.","Limit of \$f(x)\$ as \$x\$ tends to \$a\$ represents the expected value of \$f(x)\$ near \$x = a\$, irrespective of the actual value \$f(a)\$.","Left hand limit \$\\lim_{x \\to a^-} f(x)\$ uses values of \$x\$ less than \$a\$; right hand limit \$\\lim_{x \\to a^+} f(x)\$ uses values of \$x\$ greater than \$a\$.","A finite limit \$\\lim_{x \\to a} f(x)\$ exists only when left and right hand limits both exist and are equal.","The value of a function at a point and the limit of the function at that point may be different or only one of them may exist.","Limits of polynomials are easy to evaluate using direct substitution: \$\\lim_{x \\to a} p(x) = p(a)\$.","For rational functions, first substitute \$x = a\$; if the result is of the form \$\\dfrac{0}{0}\$, factor the numerator and denominator, cancel common factors, and then apply the limit.","The important standard limit \$\\lim_{x \\to 0} \\dfrac{\\sin x}{x} = 1\$ is proved using the inequality \$\\sin x < x < \\tan x\$ and the Sandwich (Squeeze) Theorem.","Another basic trigonometric limit \$\\lim_{x \\to 0} \\dfrac{1 - \\cos x}{x} = 0\$ comes from the identity \$1 - \\cos x = 2 \\sin^{2} \\dfrac{x}{2}\$.","The Sandwich (Squeeze) Theorem helps to evaluate limits when a function lies between two other functions whose limits are known and equal.","The derivative of a function at \$x = a\$ is defined as \$f'(a) = \\lim_{h \\to 0} \\dfrac{f(a + h) - f(a)}{h}\$, provided the limit exists.","Geometrically, the derivative at a point equals the slope of the tangent to the curve \$y = f(x)\$ at that point.","Physically, derivative represents the instantaneous rate of change of one quantity with respect to another (for example, velocity as rate of change of displacement).","The derivative of a function at every point (where it exists) defines a new function called the derivative function \$f'(x)\$.","Standard notations for derivatives are \$f'(x)\$, \$\\dfrac{df}{dx}\$, \$\\dfrac{dy}{dx}\$ when \$y = f(x)\$, and \$D(f(x))\$.","The power rule \$\\dfrac{d}{dx} (x^{n}) = n x^{n-1}\$ is fundamental for differentiating polynomial functions.","Derivative of a constant function is zero; derivative of a linear function \$ax + b\$ is the constant \$a\$.","The sum, difference, product, and quotient rules allow differentiation of combinations of functions without going back to first principles every time.","Standard derivatives of trigonometric functions \$\\sin x, \\cos x, \\tan x, \\cot x, \\sec x, \\csc x\$ are used repeatedly in later calculus.","Derivative may fail to exist at points where the function is not defined or where the graph has a sharp corner, jump, or vertical tangent.","While using quotient rule, always ensure the denominator function is non-zero at the point under consideration.","The first principle (limit definition) of derivative provides theoretical justification for all shortcut differentiation rules."],"summary":"$22","revision_notes":["Calculus focuses on how a function changes when its input changes; limits and derivatives are central tools for measuring this change.","In the falling body example, displacement is given by \$s = 4.9t^{2}\$, and average velocity over an interval \$[t_{1}, t_{2}]\$ is \$\\dfrac{s(t_{2}) - s(t_{1})}{t_{2} - t_{1}}\$.","Instantaneous velocity at a specific time is obtained by computing average velocities over smaller and smaller time intervals and finding their limiting value.","The concept of limit formalises this idea of approaching a value: \$\\lim_{x \\to a} f(x) = l\$ means values of \$f(x)\$ get arbitrarily close to \$l\$ when \$x\$ is sufficiently close to \$a\$ (but not necessarily equal to \$a\$).","Left hand limit \$\\lim_{x \\to a^-} f(x)\$ uses values of \$x\$ less than \$a\$; right hand limit \$\\lim_{x \\to a^+} f(x)\$ uses values of \$x\$ greater than \$a\$.","A limit \$\\lim_{x \\to a} f(x)\$ exists only if both left and right hand limits exist and are equal; if they differ, the two-sided limit does not exist.","The actual function value \$f(a)\$ can be equal to the limit, different from the limit, or not defined even when the limit exists.","Piecewise-defined functions provide examples where the function is defined at a point but the limit does not exist, or where the limit exists but the function value is different (creating a removable discontinuity).","Algebra of limits allows addition, subtraction, multiplication, division, and constant multiples to move inside the limit symbol, provided the individual limits exist and denominators are non-zero.","For polynomial functions \$p(x)\$, limit evaluation is straightforward: \$\\lim_{x \\to a} p(x) = p(a)\$, so substitution gives the limit directly.","For rational functions \$\\dfrac{g(x)}{h(x)}\$, first substitute \$x = a\$; if \$h(a) \\neq 0\$, the limit is \$\\dfrac{g(a)}{h(a)}\$.","If substitution in a rational function produces \$\\tfrac{0}{0}\$, factorise numerator and denominator, cancel common \$(x - a)\$ factors, and then re-evaluate the limit on the simplified expression.","The important general result \$\\lim_{x \\to a} \\dfrac{x^{n} - a^{n}}{x - a} = n a^{n-1}\$ holds for positive integer \$n\$ and is proved using polynomial division or factorisation.","The inequality \$\\sin x < x < \\tan x\$ for \$0 < x < \\tfrac{\\pi}{2}\$ is established using the unit circle and comparisons of areas of a triangle, a sector, and another triangle.","Dividing this inequality by \$\\sin x\$ or \$x\$ gives \$\\dfrac{\\sin x}{x} < 1 < \\dfrac{\\tan x}{x}\$ and \$\\cos x < \\dfrac{\\sin x}{x} < 1\$, which show that \$\\dfrac{\\sin x}{x}\$ is squeezed between \$\\cos x\$ and 1.","Since \$\\lim_{x \\to 0} \\cos x = 1\$, the Sandwich Theorem implies \$\\lim_{x \\to 0} \\dfrac{\\sin x}{x} = 1\$.","Using \$1 - \\cos x = 2 \\sin^{2} \\dfrac{x}{2}\$ and the basic limit of \$\\dfrac{\\sin x}{x}\$, limits like \$\\lim_{x \\to 0} \\dfrac{1 - \\cos x}{x}\$ and \$\\lim_{x \\to 0} \\dfrac{1 - \\cos x}{x^{2}}\$ are obtained.","By combining algebra of limits and trigonometric identities, limits of functions like \$\\dfrac{\\sin ax}{bx}\$, \$\\dfrac{\\tan x}{x}\$ and others are evaluated.","The Sandwich (Squeeze) Theorem states that if \$f(x) \\le g(x) \\le h(x)\$ near \$a\$ and \$\\lim_{x \\to a} f(x) = \\lim_{x \\to a} h(x) = L\$, then \$\\lim_{x \\to a} g(x) = L\$.","The derivative of a function at a point \$a\$ is defined by the limit \$f'(a) = \\lim_{h \\to 0} \\dfrac{f(a + h) - f(a)}{h}\$, assuming this limit exists.","The difference quotient \$\\dfrac{f(a + h) - f(a)}{h}\$ represents the slope of the chord joining two nearby points on the graph; its limit as \$h \\to 0\$ gives the slope of the tangent at \$x = a\$.","If the derivative exists at each point in an interval, the collection of these values forms the derivative function \$f'(x)\$.","Geometrically, \$f'(x)\$ gives the slope of the tangent line to the curve \$y = f(x)\$ at the point \$(x, f(x))\$.","In physical contexts, the derivative often represents an instantaneous rate of change, such as velocity (rate of change of displacement) or acceleration (rate of change of velocity).","Using first principles, derivatives of basic functions like \$f(x) = 3x\$, \$f(x) = x^{2}\$, and \$f(x) = \\dfrac{1}{x}\$ are computed to illustrate the method.","From repeated use of first principles and limit rules, the power rule \$\\dfrac{d}{dx} (x^{n}) = n x^{n-1}\$ is established for positive integers \$n\$, and extended more generally.","Derivative of a constant function \$f(x) = k\$ is zero because the function does not change with \$x\$.","Derivative of a linear function \$f(x) = ax + b\$ is \$a\$, which matches the constant slope of the line.","The sum rule states that \$\\dfrac{d}{dx} [f(x) + g(x)] = f'(x) + g'(x)\$; the difference rule is similar with a minus sign.","The product rule \$\\dfrac{d}{dx} [u(x) v(x)] = u'(x) v(x) + u(x) v'(x)\$ is proved using the first principle and is essential for differentiating products of functions.","The quotient rule \$\\dfrac{d}{dx} \\left( \\dfrac{u(x)}{v(x)} \\right) = \\dfrac{v(x) u'(x) - u(x) v'(x)}{[v(x)]^{2}}\$ applies when the denominator is non-zero and allows differentiation of rational expressions.","For polynomial functions \$f(x) = a_{0} + a_{1} x + a_{2} x^{2} + \\dots + a_{n} x^{n}\$, combining the power rule with the sum rule gives \$f'(x) = a_{1} + 2a_{2} x + 3a_{3} x^{2} + \\dots + n a_{n} x^{n-1}\$.","Using these rules, derivatives of high-degree polynomials and combinations like \$6x^{100} - x^{55} + x\$ are computed quickly by applying the power rule to each term.","The derivative of \$\\sin x\$ from first principles is obtained by expressing \$\\sin(x + h) - \\sin x\$ using the identity for \$\\sin(A + B)\$ and then using \$\\lim_{h \\to 0} \\dfrac{\\sin h}{h} = 1\$ and \$\\lim_{h \\to 0} \\cos h = 1\$.","The computation shows \$\\dfrac{d}{dx} (\\sin x) = \\cos x\$.","Similarly, \$\\dfrac{d}{dx} (\\cos x) = -\\sin x\$ is obtained using \$\\cos(x + h) - \\cos x\$ and trigonometric identities.","Using \$\\tan x = \\dfrac{\\sin x}{\\cos x}\$ and the quotient rule, \$\\dfrac{d}{dx} (\\tan x) = \\sec^{2} x\$ is derived.","From \$\\cot x = \\dfrac{\\cos x}{\\sin x}\$, application of the quotient rule yields \$\\dfrac{d}{dx} (\\cot x) = -\\csc^{2} x\$.","Derivatives of \$\\sec x\$ and \$\\csc x\$ are obtained using quotient forms and product identities, giving \$\\dfrac{d}{dx} (\\sec x) = \\sec x \\tan x\$ and \$\\dfrac{d}{dx} (\\csc x) = -\\csc x \\cot x\$.","The derivative of \$\\sin^{2} x\$ is found by treating it as a product \$\\sin x \\cdot \\sin x\$, leading to \$2 \\sin x \\cos x = \\sin 2x\$.","The chapter stresses that all shortcut rules (power, sum, product, quotient, trigonometric derivatives) are consistent with the limit definition of derivative.","Careful attention to domains is necessary: a derivative at \$x = a\$ cannot exist if the function itself is not defined at \$a\$, or if the limit in the definition fails to exist.","Overall, the chapter builds the conceptual bridge from average rate of change to instantaneous rate of change, from secant lines to tangents, and from numerical approximations to exact derivative formulas using limits."],"pages_n":40},{"name":"Chapter 13","internal_name":"Statistics","previous_heading":"$undefined","url":"https://ncert.nic.in/textbook.php?kemh1=13-14","pdf":"https://ncert.nic.in/textbook/pdf/kemh113.pdf","formulas":"$undefined","points_to_remember":["Measures of central tendency such as \$ \\bar{x} \$, median and mode describe the centre of data, but they do not show how widely the data values are spread.","Dispersion describes the scatter or spread of observations around a central value; in this chapter the focus is on range, mean deviation, variance and standard deviation.","Range is the simplest measure of dispersion and is defined as maximum value minus minimum value of the data; it is easy to compute but depends only on extreme values.","Mean deviation measures the average of absolute deviations of observations from a central value (mean or median) and ignores the signs of deviations.","For ungrouped data, mean deviation about a value \$ a \$ is \$ \\text{M.D.}(a) = \\dfrac{1}{n} \\sum \\lvert x_i - a \\rvert \$; for grouped data, frequencies are used with \$ \\text{M.D.}(a) = \\dfrac{1}{N} \\sum f_i \\lvert x_i - a \\rvert \$.","Mean deviation can be calculated about any measure of central tendency, but in practice mean deviation about mean and mean deviation about median are commonly used.","Variance is the mean of squares of deviations from the arithmetic mean and is always non-negative.","Standard deviation is the positive square root of variance; it is the most important and widely used measure of dispersion in statistics.","For a discrete or continuous frequency distribution, variance and standard deviation are computed by incorporating frequencies into the summations.","The alternative formula \$ \\sigma^{2} = \\dfrac{1}{N} \\sum f_i x_i^{2} - \\bar{x}^{2} \$ often simplifies calculations when \$ x_i \$ and \$ f_i x_i^{2} \$ are easier to handle.","In step-deviation method, deviations are taken from an assumed mean and divided by a common factor, which simplifies computation for large numbers or large class marks.","Adding or subtracting a constant to every observation changes the mean but does not change the variance or standard deviation.","Multiplying every observation by a constant \$ a \$ multiplies the mean by \$ a \$ and multiplies the variance by \$ a^{2} \$ and standard deviation by \$ \\lvert a \\rvert \$.","Mean deviation uses absolute values of deviations, so it cannot be used conveniently for algebraic manipulation and deeper theoretical work.","Standard deviation is preferred in advanced statistics because it is algebraically tractable and directly connected with variance and squared deviations.","Median for grouped data is found using the median class and formula \$ M = l + \\dfrac{(\\dfrac{N}{2} - C)}{f} h \$, which is required while computing mean deviation about median for continuous distributions.","For a fixed mean, a smaller standard deviation indicates that the data values are clustered closely around the mean, whereas a larger standard deviation indicates more scatter.","In practical examples (like scores of two batsmen), equal means can still correspond to very different dispersions, so conclusions must include a measure of dispersion along with central tendency."],"summary":"$23","revision_notes":["Statistics deals not only with collecting, organising and representing data but also with drawing meaningful conclusions by studying both central tendency and dispersion.","Central tendency through mean, median and mode gives a representative value of the data, but identical central values can correspond to very different patterns of spread.","The example of runs scored by two batsmen shows that equal mean and median do not imply similar performance; the range and clustering of values must also be compared.","Dispersion or scatter describes how far the observations lie from a central value; it is essential for comparing variability between two or more data sets.","The main measures of dispersion discussed in this chapter are range, quartile deviation (mentioned but not developed), mean deviation, variance and standard deviation.","Range is defined as the difference between maximum and minimum values in the data; it is quick to compute but depends only on extreme observations and is sensitive to outliers.","Mean deviation is based on the absolute deviations of observations from a chosen central value; this avoids cancellation of positive and negative deviations and gives an average spread.","For ungrouped data, mean deviation about a number \$ a \$ is \$ \\text{M.D.}(a) = \\dfrac{1}{n} \\sum_{i=1}^{n} \\lvert x_i - a \\rvert \$, where \$ a \$ can be mean, median or mode.","For discrete frequency distributions, mean deviation about \$ a \$ uses \$ \\text{M.D.}(a) = \\dfrac{1}{N} \\sum f_i \\lvert x_i - a \\rvert \$ with \$ N = \\sum f_i \$.","For continuous frequency distributions, each class is represented by its midpoint \$ x_i \$, and mean deviation about \$ a \$ is again \$ \\text{M.D.}(a) = \\dfrac{1}{N} \\sum f_i \\lvert x_i - a \\rvert \$.","To compute mean deviation about mean for grouped data, first calculate \$ \\bar{x} \$ (using midpoints for continuous classes), then find absolute deviations \$ \\lvert x_i - \\bar{x} \\rvert \$, multiply by \$ f_i \$, add and divide by \$ N \$.","To compute mean deviation about median for discrete grouped data, arrange observations in ascending order, find \$ N \$, locate the median position using \$ \\dfrac{N}{2} \$ or \$ \\dfrac{N+1}{2} \$, get median, then proceed with absolute deviations from the median.","For continuous grouped data, find median using the median class formula \$ M = l + \\dfrac{(\\dfrac{N}{2} - C)}{f} h \$, then take midpoints of each class, compute \$ \\lvert x_i - M \\rvert \$, multiply by \$ f_i \$, sum and divide by \$ N \$ to obtain mean deviation about median.","Mean deviation has limitations: it uses absolute values and hence cannot be easily used in further algebraic manipulations or theoretical derivations; also mean deviation about median can be unreliable if median itself is not a good central value.","To address these limitations, the chapter introduces variance, defined as the mean of squared deviations from the mean; squaring avoids cancellation and allows algebraic treatment.","For ungrouped data, variance is \$ \\sigma^{2} = \\dfrac{1}{n} \\sum (x_i - \\bar{x})^{2} \$, and standard deviation is \$ \\sigma = \\sqrt{\\sigma^{2}} \$.","For discrete grouped data, variance is \$ \\sigma^{2} = \\dfrac{1}{N} \\sum f_i (x_i - \\bar{x})^{2} \$ and standard deviation is \$ \\sigma = \\sqrt{ \\dfrac{1}{N} \\sum f_i (x_i - \\bar{x})^{2} } \$.","For continuous grouped data, midpoints of each class are used as \$ x_i \$, and the same formulas for variance and standard deviation are applied with class frequencies.","An important alternative formula is \$ \\sigma^{2} = \\dfrac{1}{N} \\sum f_i x_i^{2} - \\bar{x}^{2} \$, which is often computationally simpler when \$ x_i \$ and \$ x_i^{2} \$ along with frequencies are tabulated.","Examples in the chapter show that this alternative formula gives the same variance as the direct deviation formula and helps reduce arithmetic, especially for large data sets.","When midpoints or observations are large, the step-deviation method is recommended. An assumed mean \$ A \$ is chosen, a common factor \$ h \$ is taken, and \$ y_i = \\dfrac{x_i - A}{h} \$ is defined to simplify deviations.","In step-deviation method, mean is given by \$ \\bar{x} = A + h \\times \\dfrac{1}{N} \\sum f_i y_i \$, and variance is \$ \\sigma^{2} = h^{2} \\left[ \\dfrac{1}{N} \\sum f_i y_i^{2} - \\left( \\dfrac{1}{N} \\sum f_i y_i \\right)^{2} \\right] \$.","Standard deviation in step-deviation method becomes \$ \\sigma = h \\sqrt{ \\dfrac{1}{N} \\sum f_i y_i^{2} - \\left( \\dfrac{1}{N} \\sum f_i y_i \\right)^{2} } \$.","The chapter also studies the effect of linear transformations. If each observation is increased by a constant \$ a \$, the new mean becomes \$ \\bar{x} + a \$, but variance and standard deviation remain unchanged.","If each observation is multiplied by a constant \$ k \$, the new mean becomes \$ k \\bar{x} \$, the new variance becomes \$ k^{2} \\sigma^{2} \$, and the new standard deviation becomes \$ \\lvert k \\rvert \\sigma \$.","Worked examples illustrate correction of mean and standard deviation when one or more observations are wrongly recorded and later corrected or omitted, by adjusting the sums of \$ x_i \$ and \$ x_i^{2} \$.","The chapter concludes with a summary of all formulas for mean deviation, variance and standard deviation for ungrouped, discrete and continuous data, and emphasises that standard deviation is the most powerful and widely used measure of dispersion.","Overall, the key idea is that any meaningful statistical analysis must combine measures of central tendency with appropriate measures of dispersion, so that comparisons between data sets are based on both location and spread."],"pages_n":32},{"name":"Chapter 14","internal_name":"Probability","previous_heading":"$undefined","url":"https://ncert.nic.in/textbook.php?kemh1=14-14","pdf":"https://ncert.nic.in/textbook/pdf/kemh114.pdf","formulas":"$undefined","points_to_remember":["An event is any subset of the sample space \$S\$.","The sample space \$S\$ acts as the universal set for all events in a random experiment.","An impossible event corresponds to the empty set \$\\varnothing\$; a sure event corresponds to the whole sample space \$S\$.","A simple (elementary) event contains exactly one sample point; a compound event contains more than one sample point.","The complementary event of \$A\$, denoted by \$A'\$ or \$\\text{not } A\$, is \$S - A\$.","The event \$A \\cup B\$ represents \$A \\text{ or } B\$ (A occurs, or B occurs, or both occur).","The event \$A \\cap B\$ represents \$A \\text{ and } B\$ (A and B occur simultaneously).","The event \$A - B\$ represents \$A \\text{ but not } B\$ and equals \$A \\cap B'\$.","Events A and B are mutually exclusive if \$A \\cap B = \\varnothing\$; they cannot occur together.","Events \$E_1, E_2, \\dots, E_n\$ are exhaustive if \$E_1 \\cup E_2 \\cup \\dots \\cup E_n = S\$.","Events that are mutually exclusive and whose union is \$S\$ are called mutually exclusive and exhaustive events.","In the axiomatic approach, probability is a real-valued function \$P\$ on the power set of \$S\$ with range in \$[0, 1]\$.","Axioms of probability: (i) \$P(E) \\geq 0\$; (ii) \$P(S) = 1\$; (iii) for mutually exclusive events E and F, \$P(E \\cup F) = P(E) + P(F)\$.","The probability of the empty set is zero: \$P(\\varnothing) = 0\$.","For a finite sample space \$S = \\{\\omega_1, \\omega_2, \\dots, \\omega_n\\}\$, each outcome satisfies \$0 \\leq P(\\omega_i) \\leq 1\$ and \$\\sum P(\\omega_i) = 1\$.","For any event \$A\$, \$P(A) = \\sum_{\\omega_i \\in A} P(\\omega_i)\$.","When all outcomes are equally likely, \$P(E) = \\dfrac{n(E)}{n(S)}\$.","Formula for probability of union of two events: \$P(A \\cup B) = P(A) + P(B) - P(A \\cap B)\$.","If events A and B are mutually exclusive, then \$P(A \\cup B) = P(A) + P(B)\$ because \$P(A \\cap B) = 0\$.","Complement rule: \$P(A') = 1 - P(A)\$.","For any events A and B, \$P(A' \\cap B') = 1 - P(A \\cup B)\$.","For any events A and B, \$P(A \\cap B') = P(A) - P(A \\cap B)\$ and \$P(A' \\cap B) = P(B) - P(A \\cap B)\$.","Simple events in a sample space are always mutually exclusive.","Mutually exclusive and exhaustive families of events partition the sample space into disjoint blocks.","The axiomatic approach allows multiple valid assignments of probabilities to outcomes, as long as axioms are satisfied.","Classical (equally likely) probability is a special case of the axiomatic approach."],"summary":"$24","revision_notes":["Define a random experiment as a process with well-defined possible outcomes, and collect all outcomes in a sample space \$S\$.","Treat the sample space \$S\$ as the universal set for all probability questions related to the experiment.","Define an event as any subset of the sample space \$S\$; model events using set notation.","Recognise an impossible event as the empty set \$\\varnothing\$, which can never occur in the experiment.","Recognise a sure event as the entire sample space \$S\$, which always occurs whenever the experiment is performed.","Identify simple (elementary) events as those containing exactly one sample point of \$S\$.","Identify compound events as those containing more than one sample point of \$S\$.","Describe the occurrence of an event \$E\$ in terms of the outcome \$\\omega\$: event \$E\$ occurs when \$\\omega \\in E\$ and does not occur when \$\\omega \\notin E\$.","Use the complement of an event \$A\$, written \$A'\$ or 'not A', to represent all outcomes where A does not occur: \$A' = S - A\$.","Understand that \$A\$ and \$A'\$ are mutually exclusive and exhaustive: \$A \\cap A' = \\varnothing\$ and \$A \\cup A' = S\$.","Interpret \$A \\cup B\$ as the event 'A or B or both', meaning at least one of A or B occurs.","Interpret \$A \\cap B\$ as the event 'A and B', meaning A and B occur simultaneously.","Interpret \$A - B\$ (or \$A \\setminus B\$) as the event 'A but not B', and use \$A - B = A \\cap B'\$.","Classify events A and B as mutually exclusive if \$A \\cap B = \\varnothing\$; such events cannot occur at the same time.","Know that simple events in one sample space are mutually exclusive, because no outcome can belong to two different simple events at the same time.","Define a collection of events \$E_1, E_2, \\dots, E_n\$ as exhaustive if \$E_1 \\cup E_2 \\cup \\dots \\cup E_n = S\$, ensuring that at least one event occurs whenever the experiment is performed.","Recognise mutually exclusive and exhaustive events when they are pairwise disjoint and their union equals the whole sample space; they form a partition of \$S\$.","Shift to the axiomatic approach by defining probability as a function \$P\$ from the power set of \$S\$ into the interval \$[0, 1]\$.","Apply Axiom 1: For any event \$E\$, \$P(E) \\geq 0\$, so probabilities are never negative.","Apply Axiom 2: \$P(S) = 1\$, meaning the probability that some outcome from \$S\$ occurs is certain.","Apply Axiom 3: For mutually exclusive events \$E\$ and \$F\$, \$P(E \\cup F) = P(E) + P(F)\$.","Deduce that \$P(\\varnothing) = 0\$ by taking the union of an event with the empty event and applying Axiom 3.","For a finite sample space \$S = \\{\\omega_1, \\omega_2, \\dots, \\omega_n\\}\$, assign probabilities \$P(\\omega_i)\$ such that \$0 \\leq P(\\omega_i) \\leq 1\$ and \$\\sum_{i=1}^{n} P(\\omega_i) = 1\$.","Evaluate the probability of an event \$A\$ as \$P(A) = \\sum_{\\omega_i \\in A} P(\\omega_i)\$.","Understand that there can be many valid assignments of probabilities to the outcomes of the same experiment, as long as the axioms are satisfied.","In the special case of equally likely outcomes, assign \$P(\\omega_i) = \\dfrac{1}{n}\$ to each of the \$n\$ outcomes of \$S\$.","For equally likely outcomes, use the classical formula \$P(E) = \\dfrac{n(E)}{n(S)}\$, where \$n(E)\$ is the number of favourable outcomes and \$n(S)\$ is the total number of outcomes.","Apply combinatorial counting (\$^{n}C_r\$ and \$^{n}P_r\$) to calculate \$n(E)\$ and \$n(S)\$ in card problems, committee selections, arrangements, and draws from a bag.","Derive the addition theorem for two events: \$P(A \\cup B) = P(A) + P(B) - P(A \\cap B)\$, by noting that \$P(A) + P(B)\$ counts \$A \\cap B\$ twice.","Use Venn diagrams and set identities (\$A \\cup B = (A - B) \\cup (A \\cap B) \\cup (B - A)\$) to understand and justify the addition rule.","Simplify the addition theorem for mutually exclusive events using \$A \\cap B = \\varnothing\$, giving \$P(A \\cup B) = P(A) + P(B)\$.","Use the complement rule \$P(A') = 1 - P(A)\$ in problems involving 'not A', such as 'not a diamond', 'not an ace', or 'not blue'.","Compute \$P(A' \\cap B')\$ as \$1 - P(A \\cup B)\$ by recognising that \$A' \\cap B' = (A \\cup B)'\$.","Compute \$P(A \\cap B') = P(A) - P(A \\cap B)\$ and \$P(A' \\cap B) = P(B) - P(A \\cap B)\$, derived from partitioning events.","Work with real-life examples such as examination results: represent events like 'qualify English', 'qualify Hindi', 'qualify at least one', and use the addition and complement rules.","Analyse membership problems (such as students taking NCC and NSS) by treating each activity as an event and using \$P(A \\cup B) = P(A) + P(B) - P(A \\cap B)\$.","Represent outcomes in multi-step experiments (tossing three coins, rolling two dice, drawing multiple cards) as ordered tuples or strings in the sample space.","Identify mutually exclusive pairs of events by checking whether their corresponding subsets have an empty intersection.","Check whether given probability assignments are valid by verifying both conditions: each probability lies between 0 and 1, and the total sum is 1.","Use the axiomatic approach to check the consistency of given values of \$P(A)\$, \$P(B)\$, \$P(A \\cap B)\$, and \$P(A \\cup B)\$.","Interpret 'at least one' events as complements of 'none' events, for example \$P(\\text{at least one tail}) = 1 - P(\\text{no tail})\$.","Interpret 'at most k' events as complements of 'more than k' events, for example \$P(\\text{at most two heads}) = 1 - P(\\text{three heads})\$ in three coin tosses.","Handle lottery-type questions by viewing each ticket as an equally likely outcome and using the classical probability formula.","Understand that probability theory is built on rigorous axioms and set-theoretic language, which allow precise reasoning in a wide range of situations.","Connect the axiomatic approach with the historical development of probability, from early work on games of chance to Kolmogorov's formal foundations."],"pages_n":25},{"name":"Appendix I","internal_name":"Infinite Series","previous_heading":"$undefined","url":"https://ncert.nic.in/textbook.php?kemh1=a1-14","pdf":"https://ncert.nic.in/textbook/pdf/kemh1a1.pdf","formulas":"$undefined","points_to_remember":"$undefined","summary":"$undefined","revision_notes":"$undefined","pages_n":8},{"name":"Appendix II","internal_name":"Mathematical Modelling","previous_heading":"$undefined","url":"https://ncert.nic.in/textbook.php?kemh1=a2-14","pdf":"https://ncert.nic.in/textbook/pdf/kemh1a2.pdf","formulas":"$undefined","points_to_remember":["Mathematical modelling means expressing a real-life situation in mathematical terms under suitable assumptions, solving the mathematical problem, and interpreting the solution back in the real context.","The basic stages of mathematical modelling are: understanding the problem, formulation (identifying variables/parameters and writing equations or inequalities), solution, and interpretation/validation.","In the height-of-tower example, the key step is recognising that height, horizontal distance and angle of elevation are related by \$ \\tan \\theta = \\dfrac{h}{d} \$, leading to \$ h = d \\tan \\theta \$.","A mathematical model is only as good as its assumptions; we often idealise by ignoring factors that have small effect (for example, air resistance or string mass in the simple pendulum).","In the simple pendulum model, experimentation shows that period \$ T \$ depends on effective length \$ l \$ and acceleration due to gravity \$ g \$, but not significantly on the mass of the bob.","The simple pendulum model leads to \$ T^2 = k l \$ with \$ k = \\dfrac{4\\pi^2}{g} \$, so \$ T = 2\\pi \\sqrt{\\dfrac{l}{g}} \$; this is a classic example of a formula emerging from modelling plus experimental data.","Validation means comparing model predictions with experimental or observed data; small differences (errors) may be acceptable, but large discrepancies indicate that the model or its assumptions need improvement.","The Konigsberg bridge problem is an early example of modelling: Euler replaced the physical map with a network (graph) of vertices and arcs to analyse the possibility of a walk using each bridge exactly once.","Euler’s argument shows that in such a network, a trail that uses every edge exactly once (an Euler trail) can exist only if there are either zero or exactly two vertices of odd degree.","The food-mix (diet) problem is modelled by defining decision variables (amounts of corn and soyabean), writing a cost function, and translating nutritional requirements into linear inequalities.","In the diet model, the objective is to minimise cost \$ z = 10x + 20y \$ subject to quantity, protein and fibre constraints; the feasible solutions form a region in the \$ xy \$-plane and the optimum lies at a corner point.","Graphical solution of a two-variable optimisation problem uses intersection points of constraint lines and checks the objective function at feasible corner points.","The population-growth model assumes constant birth rate \$ b \$ and death rate \$ d \$, and no migration; under these assumptions the population satisfies \$ P(t+1) = (1 + b - d) P(t) \$.","The population formula \$ P(t) = P(0)(1 + b - d)^t \$ is an exponential model; growth or decay depends on whether \$ 1 + b - d \$ is greater than 1, equal to 1 or less than 1.","Real population never follows the model exactly because birth and death rates change over time and migration occurs, but the model still gives useful approximate predictions.","Every mathematical model is a simplification of reality; modelling is an iterative cycle: formulate, solve, interpret, validate and, if necessary, refine the model and repeat.","Modelling connects different branches of mathematics (algebra, trigonometry, coordinate geometry, inequalities, graph theory, statistics) with real applications in science, engineering, economics, meteorology, agriculture and demography.","A good model balances simplicity and accuracy: it must be simple enough to analyse but accurate enough to make reliable predictions within a specified range."],"summary":"$25","revision_notes":["Mathematical modelling is the process of converting a real-world situation into a mathematical framework so that known mathematical tools can be used to analyse and solve the problem, and then interpreting the solution in the original context. The main steps are: understanding the physical situation, formulating the mathematical model, solving the mathematical model, and interpreting/validating the results.","The height-of-tower example introduces this structure. The real problem involves a tower whose height \$ h \$ is unknown, a measurable horizontal distance \$ d \$ from a point to the foot of the tower, and a measurable angle of elevation \$ \\theta \$. Identifying these three quantities as key parameters is the first step in modelling.","Using trigonometry, the situation is represented by a right-angled triangle where opposite side is \$ h \$ and adjacent side is \$ d \$, leading to \$ \\tan \\theta = \\dfrac{h}{d} \$. Rearranging gives \$ h = d \\tan \\theta \$. Substituting \$ d = 450 \\, \\text{m} \$ and \$ \\theta = 40^\\circ \$ gives \$ h \\approx 377.6 \\, \\text{m} \$, which is interpreted as the tower being approximately 378 m high. This shows clearly how identification, mathematical relation and substitution give a useful answer.","The Konigsberg bridge problem illustrates modelling with networks (graphs). The city layout with two river islands and river banks connected by seven bridges is abstracted into four vertices (land masses) and seven edges (bridges). This abstraction captures only the essential feature: how different land areas are connected. Euler’s reasoning about odd-degree vertices shows that a walk using each bridge exactly once is impossible in the original layout, but becomes possible when an additional bridge changes the degrees of some vertices. This example shows how simplifying the physical situation to a network can lead to a powerful and general mathematical theory (graph theory).","The chapter formally defines mathematical modelling as an attempt to study some part of a real-life problem in mathematical terms. Conversion of a physical situation into mathematics, together with suitable assumptions, is called mathematical modelling. The approach is closer to an art or technique, where appropriate idealisations and approximations are chosen carefully rather than mechanically.","The simple pendulum is used as a detailed example of the modelling process. In understanding the problem, the aim is to find the period of oscillation \$ T \$. The main parameters that might affect \$ T \$ are the mass of the bob \$ m \$, the effective length \$ l \$ (distance from point of suspension to centre of mass of the bob), and gravitational acceleration \$ g \$.","Experiments show that varying mass \$ m \$ does not appreciably change the period, while varying length \$ l \$ changes \$ T \$ noticeably. This leads to the important step of parameter selection: treat \$ l \$ and \$ g \$ as essential parameters and drop \$ m \$ as non-essential for the period formula. This kind of simplification is common in modelling.","Experimental data plotted for \$ T \$ and \$ l \$ suggest a parabolic relation between \$ T^2 \$ and \$ l \$. This motivates the equation \$ T^2 = k l \$, where \$ k \$ is a constant depending on \$ g \$. Further analysis gives \$ k = \\dfrac{4\\pi^2}{g} \$ so that \$ T = 2\\pi \\sqrt{\\dfrac{l}{g}} \$. This is the mathematical formulation of the pendulum model.","Using \$ T = 2\\pi \\sqrt{\\dfrac{l}{g}} \$, one can compute theoretical periods for different lengths and compare them with experimental values. The difference between calculated and measured periods is the error. In the example, the error is small (for instance, about 0.011 seconds), so the model is accepted as a good approximation under the given conditions, even though some effects like string mass and air resistance are ignored.","This leads to an important modelling insight: the real world is too complex to capture fully, so we select only the main influencing factors and accept small errors. When errors are unacceptable, we refine the model by adding more factors or using more detailed physics.","The diet (farmhouse) example shows modelling using inequalities and optimisation. The problem aims to minimise the daily cost of a special food mixture made from corn and soyabean, subject to constraints on total quantity, minimum protein and maximum fibre content. This is typical of management and finance applications.","In this model, the variables are \$ x \$ (kg of corn) and \$ y \$ (kg of soyabean). The total daily cost is \$ z = 10x + 20y \$. The conditions translate to: (i) \$ x + y \\ge 800 \$ (at least 800 kg of food), (ii) protein constraint \$ 0.09x + 0.60y \\ge 0.30(x + y) \$, and (iii) fibre constraint \$ 0.02x + 0.06y \\le 0.05(x + y) \$. Simplifying the last two gives linear inequalities in \$ x \$ and \$ y \$.","Plotting these inequalities in the \$ xy \$-plane gives a feasible region that represents all combinations of corn and soyabean satisfying the dietary requirements. The cost function is then examined along the boundary of this region. Graphical analysis shows that the minimum cost occurs at approximately \$ x = 470.6 \$ and \$ y = 329.4 \$, giving \$ z \\approx 11294 \$. Interpreted practically, the cheapest acceptable mixture uses about 470.6 kg of corn and 329.4 kg of soyabean per day.","The population model is developed by first observing that population changes with time due to births and deaths. For time steps \$ t = 0, 1, 2, \\dots \$, let \$ P(t) \$ be the population at time \$ t \$, \$ B(t) \$ the number of births between \$ t \$ and \$ t+1 \$, and \$ D(t) \$ the number of deaths in the same interval. The basic balance is \$ P(t+1) = P(t) + B(t) - D(t) \$.","To make the model manageable, two assumptions are introduced: (i) the birth rate \$ b = \\dfrac{B(t)}{P(t)} \$ and death rate \$ d = \\dfrac{D(t)}{P(t)} \$ are constants independent of \$ t \$; and (ii) there is no migration (no one enters or leaves the population except by birth and death). Under these assumptions, \$ B(t) = bP(t) \$ and \$ D(t) = dP(t) \$, so the update becomes \$ P(t+1) = (1 + b - d)P(t) \$.","Iterating this relation gives \$ P(1) = (1 + b - d)P(0) \$, \$ P(2) = (1 + b - d)^2 P(0) \$, and in general \$ P(t) = P(0)(1 + b - d)^t \$ for \$ t = 0, 1, 2, \\dots \$. Writing \$ r = 1 + b - d \$, the model becomes \$ P(t) = P(0) r^t \$, an exponential function of time. This is sometimes called the Malthusian growth model.","A numerical example illustrates the model: if \$ P(0) = 250,000,000 \$, \$ b = 0.02 \$ and \$ d = 0.01 \$, then \$ r = 1.01 \$ and \$ P(10) = 250,000,000 \\times (1.01)^{10} \\approx 276,155,531.25 \$. Interpreting this, we round to \$ 276,155,531 \$ people, recognising that fractional people are not meaningful. The discrepancy arises from rounding and from the idealised assumptions of constant birth and death rates and no migration.","The chapter ends by emphasising that modelling is a cycle. Once a model is built and solved, its predictions are compared with real data. If the predictions are reasonably accurate, the model is accepted within a certain range. If not, the modeller revisits the assumptions, adjusts the formulation, and repeats the process. This cycle continues until the model achieves a suitable balance between simplicity and accuracy for the purpose at hand.","A flowchart summarises this iterative nature: starting from assumptions and axioms, moving to formulation, then solution, then interpretation and validation, and finally checking whether the model is satisfactory. If not, the process loops back for revision. This perspective helps to see mathematical modelling as an ongoing, creative dialogue between mathematics and real-world phenomena."],"pages_n":5}]}]]}],"$L26","$L27"]}]]}] 28:I[8121,["500","static/chunks/500-b13bb91f5a6311b6.js","437","static/chunks/437-2e338806393aa4e8.js","763","static/chunks/app/ncert-books/%5Bclass%5D/%5Bbook%5D/page-df44265c23a0529f.js"],"default"] 29:I[6869,[],"IconMark"] 26:["$","section",null,{"className":"page_completeDownload__bc1Ys","aria-labelledby":"complete-book-heading","children":[["$","div",null,{"children":[["$","span",null,{"className":"page_eyebrow__5qvuL","children":"Complete book"}],["$","h2",null,{"id":"complete-book-heading","children":"Download all chapters together"}],["$","p",null,{"children":["The ZIP file contains the available chapter PDFs for ","Mathematics","."]}]]}],["$","a",null,{"href":"https://ncert.nic.in/textbook/pdf/kemh1dd.zip","target":"_blank","rel":"noopener noreferrer","className":"page_zipAction__9MamK","children":["Download ZIP ",["$","span",null,{"aria-hidden":"true","children":"↓"}]]}]]}] 27:["$","aside",null,{"className":"page_appCard__XiRG_","aria-label":"NCERT Books Android app","children":["$","$L28",null,{"title":"NCERT Books Download Manager","description":"Classes 1–12 • All Subjects • Offline PDFs","playStoreUrl":"https://play.google.com/store/apps/details?id=com.arjunschool.ncertbooks","hint":true,"imageUrl":"/images/android-app/ncert-books-icon.png"}]}] 1b:[["$","meta","0",{"charSet":"utf-8"}],["$","meta","1",{"name":"viewport","content":"width=device-width, initial-scale=1"}]] 19:null 1d:[["$","title","0",{"children":"NCERT Mathematics Book for Class 11 | Arjun School"}],["$","meta","1",{"name":"description","content":"Browse Mathematics for Class 11. View chapter names, page details and available NCERT PDF downloads."}],["$","meta","2",{"name":"application-name","content":"Arjun School"}],["$","link","3",{"rel":"manifest","href":"/manifest.json","crossOrigin":"$undefined"}],["$","link","4",{"rel":"canonical","href":"https://arjunschool.com/ncert-books/class-11/mathematics"}],["$","meta","5",{"property":"og:title","content":"NCERT Mathematics Book for Class 11"}],["$","meta","6",{"property":"og:description","content":"Explore Mathematics chapters and available NCERT PDFs for Class 11."}],["$","meta","7",{"property":"og:url","content":"https://arjunschool.com/ncert-books/class-11/mathematics"}],["$","meta","8",{"property":"og:type","content":"book"}],["$","meta","9",{"name":"twitter:card","content":"summary_large_image"}],["$","meta","10",{"name":"twitter:title","content":"Arjun School | Learning Made Clear"}],["$","meta","11",{"name":"twitter:description","content":"Explore NCERT books, NCERT solutions, exemplar problems, CBSE syllabi, subject concepts and visual learning resources for Classes 1–12."}],["$","meta","12",{"name":"twitter:image","content":"https://arjunschool.com/icon/og-image.png"}],["$","link","13",{"rel":"shortcut icon","href":"/icon/icon-16.png"}],["$","link","14",{"rel":"icon","href":"/favicon.ico?020da1a451bc8fc8","type":"image/x-icon","sizes":"48x48"}],["$","link","15",{"rel":"icon","href":"/favicon.ico"}],["$","link","16",{"rel":"apple-touch-icon","href":"/icon/apple-touch-icon.png"}],["$","$L29","17",{}]]