Mathematics in the Modern World Study Notes: The Modern World Comprehensive Study Guide

Course Introduction: Mathematics in the Modern World

Mathematics in the Modern World is a general education course designed to explore the nature of mathematics beyond simple calculations. It focuses on the practical, intellectual, and aesthetic applications of mathematical tools in daily life.

Primary Objectives:

1. Educative: Equipping students with the intelligence necessary to become leaders and participants in nation-building.

2. Training: Providing the necessary skills to combat the challenges of daily living through independent learning and pedagogical modular sessions.

Curriculum Structure:

• Module 1: Mathematics in Our World: Views mathematics as a science of patterns and explores mathematical structures embedded in nature.

• Module 2: Mathematical Language: Covers symbols, syntax, and rules, treating mathematics as a distinct language.

• Module 3: Problem Solving and Reasoning: Focuses on Polya’s method and the recalibration of problem-solving skills.

• Module 4: Mathematical System: Explores recreational mathematics and its role as the backbone of commerce in the information age.

• Module 5: Data Management: Utilizes statistical tools to process numerical data, decode nature’s numbers, and predict values.

• Module 6: Logic: Studies the art and science of correct thinking and formal logic application.

• Module 7: Mathematics of Graphs: Addresses network connectivity and economic encoding, specifically the Konigsberg Bridge Problem.

Module 1: The Nature of Mathematics

The Mathematics of Our World

This section is based on Ian Stewart’s Nature’s Numbers, asserting that mathematics is a formal system of thought evolved within human culture. Historically, ancestors realized the existence of "form," leading to a system of measurement (counting, gauging, and quantifying).

Mathematics as a Tool:

• It is not merely about "crunching numbers" but forming new ways to see problems using insights and imagination.

• It acts as a "sense" (like sight or touch) to decipher patterns, logical connections, and relationships.

• It deals with the logic of shape, quantity, and arrangement.

Functions of Mathematics (according to Nocon and Nocon):

1. A set of problem-solving tools: Provides solutions and unveils reasons behind occurrences.

2. A study of patterns: Allows for observation, experimentation, and discovery.

3. An art and process of thinking: Involves inductive and deductive reasoning.

Patterns in Nature

Patterns are structures, forms, or designs that are regular, consistent, or recurring. Any regularity explained mathematically is a pattern.

Types of Patterns:

• Patterns of Visuals: Often unpredictable and contain fractals (e.g., seeds, pinecones, ferns).

• Patterns of Flow: Found in the flow of liquids, water, and meandering rivers.

• Patterns of Movement: Rhythmic locomotion (e.g., human walk, bird flight, jellyfish pulsations).

• Patterns of Rhythm: Basic patterns like heartbeats and breathing.

• Patterns of Texture: Qualities sensed through touch (rough, smooth, bristly).

• Geometric Patterns: Repeated series of shapes found in cacti and succulents.

Common Natural Patterns:

• Waves and Dunes: Disturbances carrying energy (mechanical waves, wind waves).

• Spots and Stripes: Result from reaction-diffusion systems (Alan Turing, 1952), determined by chemical interaction and diffusion speed.

• Spirals: Seen in galaxies (Milky Way), pinecones, pineapples, sunflowers, and animal horns (ram, kudu).

Symmetries in Nature

A figure is symmetric if it can be folded or divided into two identical halves. Symmetry is used to classify and organize information about structures and processes.

Types of Symmetry:

1. Reflection Symmetry: (Line or Mirror Symmetry) Left half is identical to the right.

2. Rotational Symmetry: (Turns) Looks the same after a rotation of less than one full turn. The degree is the number of orientations where it looks the same.

3. Translational Symmetry: (Slides) Repeated units with identical figures (e.g., honeycomb hexagonal tiles).

Examples in Nature:

• Human Body: Bilateral symmetry.

• Sunflowers: Both radial (disk florets) and bilateral (ray florets) symmetry.

• Snowflakes: Six-fold radial symmetry.

• Honeycombs: Wallpaper symmetry (patterns repeating to cover a plane).

• Starfish: Five-fold radial symmetry.

The Fibonacci Sequence

Named after Leonardo Pisano Bigollo (1170–1250), who discovered it while studying rabbits. The sequence is governed by adding the two previous numbers to get the next: $0, 1, 1, 2, 3, 5, 8, 13, 21, \dots$

Fibonacci in Nature:

• Petal counts: buttercup ($5$), clematis ($8$), ragwort ($13$).

• Logarithmic spirals: nautilus shells, pineapples, red cabbages.

Mathematical Formulas:

• Nth Term Notation: $Fib(n)$ refers to the $n$th term. Example: $Fib(2) + Fib(6) = 1 + 8 = 9$.

• Binet's Formula: $x_n = \frac{\phi^n - (1-\phi)^n}{\sqrt{5}}$ Where $\phi$ is the Golden Ratio ($1.618$).

The Golden Ratio and Rectangle: A golden rectangle is made of squares whose sizes follow the Fibonacci sequence, creating a spiral line found from infinite to infinitesimal scales.

Module 2: Mathematical Language and Symbols

Characteristics of Mathematical Language

Mathematics is a language with its own alphabet and grammar structures, used to communicate realities effectively. Its key characteristics are:

1. Precise: Able to make very fine distinctions.

2. Concise: Able to say things briefly.

3. Powerful: Able to express complex thoughts with relative ease.

Nouns vs. Sentences

• Mathematical Expression: The analogue of a noun. A correct arrangement of symbols representing an object of interest. Expressions do not state complete thoughts and do not have truth values (e.g., $2$, $3x+2$).

• Mathematical Sentence: Analogous to an English sentence. A statement of a complete thought that can be true, false, or sometimes true/false (e.g., $3+4=7$).

• Verbs and Connectives: The equal sign ($=$) is a common verb. The plus sign ($+$) is a connective used to create a compound object from simple ones.

Symbols Table

Sets and Logic

• $\cup$: Union

• $\cap$: Intersection

• $\in$: Element of

• $\notin$: Not an element of

• $\subset$: Subset

• $\wedge$: Conjunction (and)

• $\vee$: Disjunction (or)

• $\sim$: Negation (not)

• $\rightarrow$: Implies (If-then)

• $\leftrightarrow$: If and only if

• $\forall$: For all

• $\exists$: There exists

• $\therefore$: Therefore

• $\lvert$: Such that

• $\equiv$: Congruence/Equivalent

Set of Numbers

• $\mathbb{N}_0$: Natural/Whole numbers with zero ($\{0, 1, 2, \dots\}$).

• $\mathbb{N}_1$: Natural/Whole numbers without zero ($\{1, 2, 3, \dots\}$).

• $\mathbb{Z}$: Integers ($\{\dots, -1, 0, 1, \dots\}$).

• $\mathbb{Q}$: Rational numbers ($\{x \mid x = \frac{a}{b}, a, b \in \mathbb{Z}, b \neq 0\}$).

• $\mathbb{R}$: Real numbers (\{x \mid -\infty < x < \infty\}).

• $\mathbb{C}$: Complex numbers ($\{z \mid z = a + bi, a, b \in \mathbb{R}\}$).

Sets and Subsets

Introduced by Georg Cantor in 1879. A set is a collection of well-defined objects.

• Cardinal Number ($n$): The number of elements in a set.

• Finite vs. Infinite: Countable vs. uncountable elements.

• Equal vs. Equivalent: Equal sets have identical elements; equivalent sets merely have the same number of elements.

• Joint vs. Disjoint: Joint sets share elements; disjoint sets are mutually exclusive.

Representing Sets:

1. Roster/Tabular Method: Listing elements (e.g., $A = \{1, 2, 3\}$).

2. Rule/Set-builder Method: Describing characteristics (e.g., A = \{x \mid x \text{ is a counting number} < 6\}).

Subsets ($A \subseteq B$):

• Every set is a subset of itself.

• The empty set ($\emptyset$) is a subset of every set.

• Total number of subsets = $2^n$.

Cartesian Product ($A \times B$): The set of all ordered pairs $(a, b)$ where $a \in A$ and $b \in B$.

Relations and Functions

A Relation from set $X$ to $Y$ is a set of ordered pairs $(x, y)$ such that to each $x$ there corresponds at least one $y$.

• Domain: The set of first components ($x$).

• Co-domain/Range: The set of second components ($y$).

Properties of Relations:

1. Reflexive: Every element is related to itself ($aRa$).

2. Symmetric: If $aRb$, then $bRa$.

3. Transitive: If $aRb$ and $bRc$, then $aRc$.

4. Equivalence Relation: A relation satisfy all three properties above.

A Function is a specific type of relation where every input is paired with exactly one output.

• Rule: No two distinct ordered pairs have the same first component.

• Notation: $f(x)$ read as "f of x."

Binary Operations: A method/formula combining members of an ordered pair from a set $G$ to yield a new member of $G$. This property is called Closure.

• Identity Element ($e$): $e * a = a * e = a$.

• Inverse Element ($a^{-1}$): $a * a^{-1} = e$.

• Cayley Tables: Square grids representing operations on finite sets.

Module 3: Problem Solving and Reasoning

Inductive and Deductive Reasoning

• Inductive Reasoning: Reaching a general conclusion (conjecture) by examining specific examples. It does not guarantee truth but provides a means for prediction.

• Deductive Reasoning: Reaching a specific conclusion by applying general assumptions, principles, or procedures. Often visualized as a funnel narrowing from general truths to specific conclusions.

Mathematical Proofs

• Intuition: Immediate understanding without formal reasoning, though it can be improved by observation and critical thinking.

• Proof: A rigorous mathematical argument demonstrating the truth of a proposition. A proof can be presented in Outline Form or Paragraph Form.

Kinds of Proof

1. Direct Proof: Uses rules of inference to derive the conclusion directly from the premises.

   • Example: Proving that the sum of two odd integers is even.

   • If $a = 2k_1 + 1$ and $b = 2k_2 + 1$, then $a + b = 2(k_1 + k_2 + 1) = 2k$.

2. Indirect (Contrapositive) Proof: Proving $P \rightarrow Q$ by proving $\sim Q \rightarrow \sim P$.

3. Proof by Counterexample: Disproving a universal statement by finding a single case where it fails.

   • Example: Disproving "All prime numbers are odd" by citing $n=2$.

4. Proof by Contradiction: Assuming the implication is false and reaching an impossibility.

Polya’s Four Steps in Problem Solving

George Polya, the "Father of Problem Solving," established a four-step heuristic:

1. Understand the Problem: Define unknowns, check for sufficient information, and visualize with diagrams.

2. Devise a Plan: Formulate working equations, look for patterns, or work backward.

3. Carry out the Plan: Perform calculations accurately. If a plan fails, try another.

4. Look Back/Review: Check the solution for accuracy and interpret it in context.

Module 4: Mathematical System

Modular Arithmetic

Often called "Clock Arithmetic," it deals with integers and their remainders modulo $n$.

• Definition: $a \equiv b \pmod{n}$ if and only if $n \mid (a - b)$.

• Arithmetic Modulo $n$: Sums and products are divided by the modulus, and only the remainder is kept. The result is always between $0$ and $n-1$.

Applications:

1. ISBN-13: A 13-digit code for books. The check digit ($d_{13}$) is calculated such that:     $d_{13} = [10 - (d_1 + 3d_2 + d_3 + 3d_4 + \dots + 3d_{12}) \pmod{10}] \pmod{10}$.

2. UPC: A 12-digit code for products. The check digit ($d_{12}$) uses a similar modulo 10 formula.

3. Credit Cards (Luhn Algorithm): Doubling every other digit from right to left and checking if the sum is congruent to $0 \pmod{10}$.

4. Cryptography:

   • Ciphertext: Coded message.

   • Plaintext: Original message.

   • Shift Cipher: $c \equiv (p + m) \pmod{26}$.

Group Theory

A Group $(G, *)$ is an algebraic system consisting of a set $G$ and an operation $*$ satisfying four properties:

1. Closure: $a * b \in G$ for all $a, b \in G$.

2. Associativity: $(a * b) * c = a * (b * c)$.

3. Identity: There exists $e \in G$ such that $e * a = a$.

4. Inverse: For every $a$, there is an $a^{-1}$ such that $a * a^{-1} = e$.

• Abelian Group: A group that also satisfies the Commutative Property ($a * b = b * a$).

• Permutation Groups: Representing symmetry (e.g., rotating a triangle $120^{\circ}$ or flipping it).

Module 5: Data Management

Descriptive and Inferential Statistics

• Descriptive: Describing data in symbolic forms (mean, median, graphs).

• Inferential: Predicting or generalizing from a sample to a population.

• Parameter: A measure obtained from the entire population.

• Statistic: A measure obtained from a sample.

Scales of Measurement

1. Nominal: Categorical labels (e.g., gender, marital status).

2. Ordinal: Ranked data (e.g., race results, product rankings).

3. Interval: Meaningful differences between points; no absolute zero (e.g., IQ, temperature).

4. Ratio: All characteristics of interval data plus an absolute zero (e.g., weight, height).

Measures of Central Tendency

• Mean ($\bar{x}$): The arithmetic average: $\bar{x} = \frac{\sum x}{N}$. Affected by skewed distributions (outliers).

• Median: The middle point that separates the upper and lower halves. Not affected by outliers.

• Mode: The most frequently occurring score. Used for nominal data.

Measures of Dispersion

1. Range ($R$): Difference between the highest and lowest score: $HS - LS$. Extremely unstable.

2. Standard Deviation ($SD$ or $\sigma$): Average amount scores differ from the mean:     $SD = \sqrt{\frac{\sum X^2}{N} - \bar{X}^2}$

3. Variance ($V$): The square of the standard deviation ($SD^2$).

Normal Distribution

A theoretical, perfectly symmetrical distribution where mean = median = mode.

• Empirical Rule:

  • $68\%$ of data falls within $1$ SD.

  • $95\%$ of data falls within $2$ SD.

  • $99.7\%$ of data falls within $3$ SD.

• Z-score: Standardizing scores to compare different distributions:     $z = \frac{X - \mu}{\sigma}$     In a standard normal distribution, $\mu = 0$ and $\sigma = 1$.

Linear Correlation and Regression

• Pearson r: Measures the strength and direction of linear association between two variables.

  • Value range: $-1.0$ to $+1.0$.

  • Interpretation: $0.90-1.00$ (Very dependable/Strong), $0.40-0.70$ (Substantial).

• Linear Regression: Finding the "best fit" line ($y = mx + b$) to predict the value of $y$ given $x$.

  • Method: Least-Squares Regression Line, which minimizes the vertical distance from points to the line.

Module 6: Logic

Statements and Connectives

• Statement: A declarative sentence that is either true or false.

• Connectives:

  • Conjunction ($\wedge$): True only if both components are true.

  • Disjunction ($\vee$): True if at least one component is true.

  • Conditional ($\rightarrow$): False only if the antecedent is true and the consequent is false.

  • Biconditional ($\leftrightarrow$): True only if both components have the same truth value.

Truth Tables and Equivalences

• Logically Equivalent ($\equiv$): Statements with identical truth table columns.

• De Morgan’s Laws:

  1. $\sim(p \wedge q) \equiv \sim p \vee \sim q$

  2. $\sim(p \vee q) \equiv \sim p \wedge \sim q$

• Tautology: A statement that is always true.

• Contradiction: A statement that is always false.

Circuits and Logic Gates

Logic can be applied to electrical switching networks.

• Series Network: Analogous to Conjunction ($p \wedge q$). Closed only if all switches are closed.

• Parallel Network: Analogous to Disjunction ($p \vee q$). Closed if at least one switch is closed.

• Logic Gates:

  • NOT-gate: Inverts the signal ($1 \rightarrow 0, 0 \rightarrow 1$).

  • AND-gate: Output is $1$ only if all inputs are $1$.

  • OR-gate: Output is $1$ if at least one input is $1$.

Arguments

An argument consists of premises and a conclusion.

• Validity: An argument is valid if the conclusion is true whenever all premises are assumed to be true.

• Valid Forms: Modus Ponens, Modus Tollens, Law of Syllogism, Disjunctive Syllogism.

Module 7: Mathematics of Graphs

Basic Graph Theory

• Graph ($G$): A finite set of vertices ($V$) and edges ($E$).

• Path: A walk with distinct vertices.

• Trail: A walk where no edge is repeated.

• Circuit: A closed trail.

• Cycle: A closed path.

• Handshake Theorem: In a complete graph $K_n$, the number of edges is $\frac{n(n-1)}{2}$.

Eulerian and Hamiltonian Graphs

• Eulerian Graph: Contains a circuit using every edge once. Possible if and only if every vertex has an even degree.

• Euler Trail: Uses every edge once but starts and ends at different vertices. Possible if exactly two vertices have an odd degree.

• Hamiltonian Cycle: A cycle that visits every vertex once.

• Dirac’s Theorem: A simple graph with $n \geq 3$ vertices is Hamiltonian if every vertex has degree $\geq \frac{n}{2}$.

Optimization and Coloring

• Weighted Graphs: Edges are assigned values (costs/distances).

• Greedy Algorithm: Choose the cheapest edge to an unvisited vertex at each step.

• Edge-Picking Algorithm: Rank all edges by weight and pick the cheapest available that doesn't create premature cycles or three-edge vertices.

• Graph Coloring: Assigning colors to vertices so no adjacent vertices share a color.

• Chromatic Number ($\chi(G)$): The minimum number of colors needed.

• Four-Color Theorem: Every planar graph is $4$-colorable.