7 Raven Room

Seven ravens remember

487 lessons · 69 chapters · 51 articles · 968 problems solved

Mathematics130

Numbers and algebra

Geometry and trigonometry

Calculus

  • Why everything looks straight up closeL2 · 6

    Five tools on one idea: a smooth curve, magnified far enough, is indistinguishable from a straight line. That single fact is what a derivative measures, what a Taylor series extends, and what a gradient does in more than one direction. The path starts with the angle measure that makes the arithmetic come out clean and ends on a hillside where the steepest slope beats every direction you actually measured.

    1. 01Radians
    2. 02Limits
    3. 03The derivative
    4. 04Riemann Sum Explorer
    5. 05Taylor series
    6. 06More than one direction
  • Differentiation: how rates combineL2 · 5

    A derivative is a rate, and each rule of differentiation says how rates combine: through a product, through a function inside another, through an equation nobody solved for y. The last two pages put the rules to work on the questions a course actually asks, how fast something changes at one instant and which choice is best.

    1. 01Product rule
    2. 02Chain rule
    3. 03Implicit differentiation
    4. 04Related rates
    5. 05Optimisation
  • What f′ and f″ say about a graphL3 · 2

    The sign of f′ says where a graph rises and falls, and the sign of f″ which way it bends. The chapter starts with the theorem that makes those readings safe, the mean value theorem, and is building towards the first and second derivative tests and reading f from a graph of f′.

    1. 01Mean value theorem
    2. 02First derivative test
  • Infinite series and convergenceL3 · 3

    An infinite sum is a limit of finite ones, and the limit depends on things no finite sum cares about: the order of the terms, and where the nearest singularity sits, even when it is off the real line.

    1. 01Series convergence
    2. 02Riemann rearrangement
    3. 03Radius of convergence
  • Three numerical methods, and where each one gives outL3 · 3

    Newton's method, Simpson's rule and Euler's method all run on the same engine: inside a small enough interval, treat the curve as straight. Each one therefore has a failure that is not a bug, and the useful knowledge is which failure belongs to which method. Every step here hands the next a named error and the rate at which it shrinks.

    1. 01Newton's method
    2. 02Integrating numerically
    3. 03Euler's method
  • Techniques of integrationL3 · 7

    Differentiation is a procedure and integration is a search, so the trainers in this chapter grade an answer one way: differentiate it and compare it with the integrand. Substitution and parts are the chain and product rules read backwards, partial fractions covers the one large family where an elementary answer always exists, and the last page proves that for e⁻ˣ² none does.

    1. 01Antiderivatives
    2. 02Substitution
    3. 03Integration by parts
    4. 04Partial fractions
    5. 05Trigonometric integrals
    6. 06Choosing a technique
    7. 07No formula at all
  • Applications of integrationL3 · 8

    An integral is an amount piled up: area, distance, volume. This chapter starts with the theorem that ties piling up to rates of change, and builds from there to areas between curves, motion, and volumes found by slicing.

    1. 01The fundamental theorem
    2. 02Area between curves
    3. 03Accumulation and motion
    4. 04Volume by slicing
    5. 05The shell method
    6. 06Combining two solids
    7. 07Double integrals
    8. 08Polar double integrals
  • Differential equations: from slopes to polesL3 · 3

    A differential equation says how fast something is changing, never what it is. The slope field draws that statement and shows a whole family of solutions, one through each starting point. The exponential is the family you can solve in a line, and the Laplace transform turns its rate into a point in the s-plane, where the ending can be read without solving anything.

    1. 01Slope fields
    2. 02Exponential growth and decay
    3. 03Laplace transform pairs

Linear algebra and data

Proof, counting and games

  • When two things land on the same valueL2 · 3

    The birthday problem looks like a party trick and is actually the standard tool for reasoning about collisions. The second step is where computer scientists meet it again, under a different name.

    1. 01Modular Arithmetic Clock
    2. 02Birthday paradox
    3. 03Hash tables
  • Methods of proofL2 · 4

    A proof is a reason that covers every case, including the ones nobody will ever check. These pages build that reason four ways: by induction, by counting things into boxes, by a quantity no move can change, and by pairing things off. The first begins with a formula that gives a prime forty times running and then gives 41 × 41.

    1. 01Proof by induction
    2. 02The pigeonhole principle
    3. 03Invariants
    4. 04The pentagonal number theorem
  • The best reply, and what happens when nobody computes oneL3 · 4

    Four games and one operation: find the move that answers whatever the other player does. It settles the first game on its own, takes a whole square to locate in the second, and carries a price tag in the third. In the fourth nobody computes it at all and the population arrives at the answer anyway.

    1. 01Prisoner's dilemma
    2. 02Nash equilibrium
    3. 03Tragedy of the commons
    4. 04Evolution of cooperation

Statistics & Finance66

Data and inference

  • Statistics: from data to proportionsL2 · 4

    AP Statistics opens with pictures of a single variable and gives its longest unit to inference for proportions. This chapter climbs in that order: how a data set is drawn, then how it is described, then how a sample proportion becomes a confidence interval and a significance test. The normal model and the sampling distributions it rests on have their own chapter, From counts to curves.

    1. 01Displaying data
    2. 02Describing distributions
    3. 03One proportion
    4. 04Two proportions
  • From counts to curvesL2 · 6

    Six tools and one distribution. Everything here is the binomial in a different limit, or the binomial read backwards: count the successes, let the count get large, and watch a bell curve arrive that nobody put there.

    1. 01Binomial
    2. 02Poisson
    3. 03Normal distribution
    4. 04Central limit theorem
    5. 05Z-score
    6. 06Confidence interval
  • When is a difference real?L2 · 4

    Four tools asking one question with progressively less to work with: two groups, then any number of them, then counts with no average in them at all. The last tool asks it before the data exist.

    1. 01t-test
    2. 02ANOVA
    3. 03Chi-square
    4. 04Sample size
  • Priors, and where they come fromL2 · 3

    Nobody objects to the arithmetic in Bayes' theorem. They object to the prior — where the first number came from, and who chose it. These three tools take that question in the order it gets harder: a prior you can look up, a prior the apparatus hands you, and a prior nobody has.

    1. 01Bayes' theorem
    2. 02Bayes' billiard
    3. 03Biosignatures
  • What p < 0.05 does not promiseL2 · 4

    A p-value answers one question about one planned test. Real studies run twenty tests, look at the data as it comes in, and publish the results that came out significant, and each of those changes what p < 0.05 is worth. Every page here takes a procedure that sounds harmless and works out exactly what it costs.

    1. 01Multiple comparisons
    2. 02Optional stopping
    3. 03The winner’s curse
    4. 04False findings

Decisions and risk

  • Choosing on what you have seenL1 · 2

    Two choices where the obvious strategy loses. At the doors you get one piece of news and must decide what it is worth, which depends on the rule the host follows rather than on what you see. With the candidates the news arrives one at a time, every refusal is final, and the question becomes when to stop looking.

    1. 01Monty Hall
    2. 02The 37% rule
  • Fair games that ruin youL2 · 4

    An expected value is a promise about the average over a great many players, and a gambler is one player with one bankroll. A game can be fair, or even in your favour, and still ruin almost everyone who plays it. Each page draws the average as a dashed ghost and lets you watch what happens to the players who make it up.

    1. 01Gambler's ruin
    2. 02The doubling system
    3. 03The St Petersburg paradox
    4. 04The Kelly criterion

Money and investing

Physics104

Mechanics

  • Energy instead of forcesL2 · 3

    Two tools and one shortcut: when all you want is speeds and heights, you can skip the forces entirely and let energy keep the books.

    1. 01Free fall
    2. 02Roller coaster
    3. 03Momentum & Collision Lab
  • Newton's laws: the grip a motion asks forL2 · 3

    Every mechanics problem with a surface in it has to settle one question before any arithmetic: how much friction does this motion need, and can the contact give it? A block on a plank answers with tan θ against μ. A car on a banked bend adds a turn, and the friction it needs changes direction with the speed. A ball rolling down a ramp adds a spin, and the hoop, which asks for the most grip, is the first to slip.

    1. 01Newton's second law
    2. 02Banked curves
    3. 03Rolling down a ramp
  • Simple machines: trading force for distanceL2 · 6

    Five machines and one bargain. None of them creates energy, and every one of them lets you choose how to spend it: a smaller force over a longer path, or the reverse. Each step hands the next a specific piece of that bargain, and by the end you can read any machine by asking two questions about it.

    1. 01Lever classes
    2. 02Wheel and axle
    3. 03Pulley systems
    4. 04Inclined plane, screw and wedge
    5. 05Gear trains
    6. 06Screw Thread
  • Throwing thingsL2 · 3

    Three tools, and the third one breaks the first two. Constant acceleration has a closed-form answer, so the first two steps are algebra. Air resistance is not constant, and from there the only honest method is to integrate it step by step.

    1. 01SUVAT
    2. 02Projectile motion
    3. 03Drag and wind
  • Least time, least actionL2 · 4

    The path a light ray takes, a sliding bead follows and a thrown ball flies is the one along which a small change makes no first-order change in a total: time for the first two, action for the ball. Every page lets you bend the path and watch the total barely move, and two of them find a path whose total is stationary without being least.

    1. 01Fermat's principle
    2. 02Mirages
    3. 03The brachistochrone
    4. 04Least action
  • Rotation and angular momentumL2 · 4

    A spinning body carries a vector, its angular momentum, and nearly everything surprising about rotation is that vector refusing to change. Pull your arms in on a turntable and you spin faster; a wheel turns sideways instead of falling; a racket flips; a pendulum's plane stays put while the floor turns under it.

    1. 01Angular momentum
    2. 02The gyroscope
    3. 03The tennis racket theorem
    4. 04Coriolis and Foucault
  • Where the load goesL3 · 7

    Seven pages on one question: which part of a structure is actually carrying the weight, and in what form. It starts inside a single beam, where the middle does almost nothing, and ends with a truss that has more bars than equations and still says exactly when it will fall.

    1. 01Beam deflection
    2. 02Shaft torsion
    3. 03Mohr’s circle
    4. 04Truss analysis
    5. 05Euler buckling
    6. 06Arches and cables
    7. 07Redundant bars

Fluids

  • Water out of a tank: one speed, spent two waysL2 · 2

    Two tools built on a single result. Water leaves a hole at exactly the speed a stone reaches falling the same depth, and everything else follows from where that speed is spent: sideways it is a projectile, downwards it is the tank emptying itself.

    1. 01Three holes in a tank
    2. 02The tank emptying
  • Fluids at rest: from a pressure gauge to a mountain's rootL2 · 3

    Pressure in a still liquid depends on the depth and on nothing else: not the area, not the amount of liquid, not the shape of the vessel. Apply that to the top and the bottom of a body and you have the upthrust. Floating then has a single rule, that a floating body pushes aside its own mass of liquid, and the rule does not care whether the body is a rowing boat on a pond or a continent on the mantle.

    1. 01Pressure at depth
    2. 02Archimedes and the boat
    3. 03Mountain roots
  • Fluids in motion: what viscosity takes backL2 · 5

    Bernoulli's pipe has no friction in it, and each page after it puts back something that one left out. Viscosity costs pressure along a pipe. The Reynolds number decides whether that cost is the orderly one Poiseuille computed. A sinking grain shows the same number choosing between two drag laws, and in the band between them, where no formula holds, the last page solves the equations themselves.

    1. 01Bernoulli and the Venturi
    2. 02Poiseuille's law
    3. 03The Reynolds number
    4. 04Terminal velocity
    5. 05Navier–Stokes past a cylinder

Waves, light and quanta

  • Bending lightL2 · 3

    A lens is a boundary that somebody curved, and no page on this path introduces physics the first one does not already contain. What changes is how much is asked of it: one surface, then an ideal lens, then a piece of glass.

    1. 01Snell's law
    2. 02Ray-tracing a lens
    3. 03Real lenses
  • From one spring to a standing waveL2 · 4

    One restoring force, followed as far as it will go. A mass on a spring oscillates, a row of them passes the oscillation along, two of those meeting decide whether to add or cancel, and a boundary at each end throws away every frequency that does not fit.

    1. 01Hooke's law
    2. 02Resonance
    3. 03Interference
    4. 04Standing waves
  • Wave opticsL2 · 4

    Ray optics says light goes straight and an edge casts a sharp shadow. Each page here draws that answer as a ghost beside the wave answer, and what stands in the light's way changes from page to page: two surfaces, one slit, a round aperture, and finally an opaque disc whose shadow is bright at its centre.

    1. 01Thin films
    2. 02Single slit
    3. 03The diffraction limit
    4. 04The spot of Arago
  • Quantum mechanics: matter as wavesL2 · 5

    Light arrives in packets, and the same constant h then gives every particle a wavelength. The rest follows from taking that wave seriously: made to fit a box, it has a lowest energy that is not zero; it leaks through walls it cannot climb; and squeezed into a small space it spreads over many wavenumbers, which is the uncertainty principle.

    1. 01The photoelectric effect
    2. 02Matter waves
    3. 03Particle in a box
    4. 04Quantum tunnelling
    5. 05Uncertainty and wave packets
  • The heat, wave and Laplace equationsL3 · 4

    Three equations built on one operator, the Laplacian, that differ only in what time does. Heat forgets, the sharpest detail first. A wave carries a disturbance away, and on a sheet never quite finishes arriving. Laplace's equation has no time in it at all, and it is where heat forgets its way to: every point the average of its neighbours.

    1. 01The heat equation
    2. 02Seasons underground
    3. 03The wave equation
    4. 04Laplace's equation

Electricity and magnetism

  • What Ohm’s law leaves outL1 · 6

    Ohm’s law, as its own page says, describes one resistor at a steady temperature, on direct current, with nothing else in the loop. Each page after it puts back one of the things that sentence left out: a second component, the wire, the battery, a circuit that will not reduce, and a voltage that changes.

    1. 01Ohm’s law
    2. 02Series and parallel
    3. 03Resistivity
    4. 04Internal resistance
    5. 05Kirchhoff’s laws
    6. 06AC and RMS
  • Resistance, then reactanceL2 · 3

    A capacitor has no resistance and limits the current anyway, and what it sets is a time rather than a number of ohms. The second page shows that the time belongs to any system with one store and one drain. The third adds a second store, and the time becomes a frequency.

    1. 01RC circuit
    2. 02Step response
    3. 03RLC resonance
  • What is not a resistorL2 · 5

    Ohm's law describes one kind of part. The five here store energy in a voltage or a current, conduct in one direction, amplify, and amplify precisely, and each is unreliable on its own: a transistor's current gain β varies threefold between samples of the same type. The circuit around a component is what makes it predictable, and every page shows how.

    1. 01Capacitor
    2. 02Inductor
    3. 03Diode
    4. 04Transistor amplifier
    5. 05Op-amp
  • Where fields come fromL3 · 6

    Charges make electric fields and currents make magnetic ones, and the exam question is always which field comes from which arrangement. The chapter adds up pieces first, with an integral and the symmetry that cancels most of it, then takes the shortcuts symmetry allows: Gauss's law for charge, and the Biot–Savart law and Ampère's law for current, ending where Ampère's law needs Maxwell's correction.

    1. 01Point charges
    2. 02Rods, rings and disks
    3. 03Gauss's law
    4. 04Force on a moving charge
    5. 05The Biot–Savart law
    6. 06Ampère's law

Astronomy & Space44

  • How far away is it?L2 · 4

    Nothing about a star can be worked out from how bright it looks until you know how far away it is. That is the order these four go in, and it is the order astronomy went in — each rung measured against the one below it, all the way from a surveyor’s triangle to the edge of the observable universe.

    1. 01Parallax distance
    2. 02Solar luminosity
    3. 03Stellar magnitude
    4. 04The distance ladder
  • Orbits from two numbersL3 · 5

    An orbit is fixed by its size and its shape, and almost everything else follows. These five tools go from the ellipse to the fuel: where a spacecraft is, how fast it is going there, how long the trip takes, which trip is cheapest, and what that costs in propellant.

    1. 01Kepler orbits
    2. 02Vis-viva
    3. 03Orbital period
    4. 04Hohmann transfer
    5. 05The rocket equation

Computing69

Machines and algorithms

  • How a computer runs a programL1 · 6

    From a gate to a running program. A NAND gate is enough to build every circuit, an adder made of gates does subtraction too, and the Little Man Computer puts that adder beside a hundred mailboxes: the program sits in the same memory as its numbers, and the machine runs whatever its program counter lands on.

    1. 01Logic gates
    2. 02Binary arithmetic
    3. 03The Little Man Computer
    4. 04Memory and bytes
    5. 05The call stack
    6. 06Cache locality
  • What a data structure makes cheapL2 · 4

    Every structure here answers one question fast and pays for it somewhere else. A Bloom filter keeps no keys at all and can still say definitely not; a trie answers the prefix questions a hash table cannot; a heap always knows its smallest key and little else. The last page asks which page to throw out of memory, where the best answer needs the future.

    1. 01Bloom filter
    2. 02Trie
    3. 03Binary heap
    4. 04Page replacement
  • Counting work, not secondsL3 · 4

    A stopwatch measures your laptop. Counting operations measures the algorithm. Two tools built on that one habit.

    1. 01Big-O growth
    2. 02Sorting Algorithm Race
    3. 03Recursion Tree Explorer
    4. 04Pathfinding
  • Why an algorithm is correctL3 · 4

    An algorithm is right for a reason that can be stated, and wrong for one a small test can find. Each page sets a correct version beside a plausible wrong one: fourteen of the sixteen ways to write binary search fail, greedy change-giving loses on old British coins and never on US cents, Kruskal and Prim agree for a reason, and a code that corrects one flipped bit makes two flips worse.

    1. 01Binary search
    2. 02Coin change
    3. 03Minimum spanning tree
    4. 04Hamming code

Security

  • How codes are brokenL1 · 5

    Each cipher here hides the letters and leaves something else showing. A substitution leaves the letter counts, a keyword cipher leaves them in columns, and a one-time pad used twice leaves the spaces. Only a random key as long as the message shows nothing at all, and then the hard part becomes getting that key to the other side, which the last two pages do in public.

    1. 01Substitution cipher
    2. 02Vigenère cipher
    3. 03One-time pad
    4. 04Diffie–Hellman
    5. 05RSA
  • Protecting a stream: revoke a device, then find out which oneL3 · 2

    Two halves of the same problem, in the order a studio meets them. First, a key has leaked and the licence must keep working for everyone else — which turns out to cost a header that does not grow with the size of the system at all. Then the harder half: knowing whose key it was, from a copy that several subscribers built together specifically so that it names nobody.

    1. 01Device revocation
    2. 02Forensic watermarking

Signals and information

Bio, Geo, Chem57

  • Clocks in the rockL2 · 3

    One exponential, read three ways. Forwards it tells you how much is left; backwards it tells you how old something is; and applied to DNA rather than to nuclei it needs a rock to set it by.

    1. 01Radioactive decay
    2. 02Radiometric dating
    3. 03Molecular clock
  • Geometry on a curved surfaceL2 · 4

    On a curved surface the rules proved on paper stop holding, and the amount by which each one fails measures the curvature from inside. A straight route changes its compass heading, an arrow carried without turning comes home turned, a ring comes out the wrong length, and in the hyperbolic plane no triangle can hold more than π.

    1. 01Great circle routes
    2. 02Parallel transport
    3. 03Theorema egregium
    4. 04The hyperbolic plane
  • Why a reaction goesL2 · 4

    The heat a reaction gives out does not decide whether it runs; ice melts by taking heat in. These four pages build the bookkeeping that does decide: enthalpy, which adds like equations; standard free energy, which is an equilibrium constant in other units; the difference between moving K and moving Q; and a battery that reads that difference as a voltage.

    1. 01Hess's law
    2. 02Gibbs free energy
    3. 03Le Chatelier's principle
    4. 04The Nernst equation
  • Mixtures and solutionsL2 · 5

    A gas in a mixture acts at its own partial pressure, which sets a diver's depth limit. A liquid boils where its vapour pressure meets the pressure above it. Two liquids that mix badly stop a still at about 95.6% ethanol by mass, dissolved particles make one kelvin of frost worth thirteen bar of osmotic pressure, and a salt dissolves only until its ions reach a fixed product.

    1. 01Partial pressure
    2. 02Vapour pressure and boiling
    3. 03Fractional distillation
    4. 04Colligative properties
    5. 05Solubility product
  • Growth with a limitL2 · 4

    Every population here is held back by something, and the something gets less obliging at each step: first the crowding it causes itself, then a fixed catch taken off the top, then a predator that is a population in its own right, and finally running out of people left to infect.

    1. 01Logistic growth
    2. 02Harvesting
    3. 03Predator and prey
    4. 04Epidemics
  • How a weather forecast is madeL3 · 3

    A forecast is a model run forward from a starting state nobody knows exactly, so forecasters run it many times and let the disagreement say how far to trust it. The second page opens the model and finds a way to fail that has nothing to do with chaos. The third goes back to Lorenz's equations of 1963, where the run's position is soon lost and the shape it draws never is.

    1. 01Ensemble forecasting
    2. 02Weather on a grid
    3. 03The Lorenz attractor
  • Computing with moleculesL4 · 5

    Five tools that build one argument: DNA is a real storage medium and a real computer, and both run into limits you can calculate rather than guess at. Each step hands the next a specific number.

    1. 01DNA data storage
    2. 02DNA computing scale
    3. 03Levinthal’s paradox
    4. 04Strand displacement gate
    5. 05Energy per operation