Giving the boot to the bootstrap: how not to learn the natural numbers

Lance J Rips1, Jennifer Asmuth, Amber Bloomfield

  • 1Northwestern University, Austin, Texas, USA. rips@northwestern.edu

Cognition
|January 18, 2006
PubMed

Related Concept Videos

Bootstrapping01:24

Bootstrapping

The term "bootstrap" originated in the 19th century as a metaphor for self-improvement or achieving something independently, without external assistance. This concept extends to statistical bootstrapping, a self-contained method for estimating population parameters through resampling, even though it can be computationally intensive. Developed by the American statistician Dr. Bradley Efron in 1979, bootstrapping provides a robust way to perform inference when the original sample size is small or...
The Binomial Theorem01:30

The Binomial Theorem

The Binomial Theorem is a foundational principle in algebra used to expand expressions raised to a power. It provides a structured approach for expanding binomials of the form (a+b)n, where a and b are variables or constants representing algebraic expressions, and n is a non-negative integer.The general form of the Binomial Theorem is:Each term in the expansion involves a binomial coefficient, which is calculated using factorials:The exponent of a in each term decreases from n to 0, while the...
Mathematical Induction01:29

Mathematical Induction

Mathematical induction is a structured method of proof used to confirm the truth of statements involving natural numbers. Consider the sum of the first n natural numbers:This formula describes a pattern that appears to hold true as more terms are added. To verify that it is valid for all natural numbers, mathematical induction proceeds in two essential steps. The first is the base case, where the formula is tested for the initial value, typically n = 1. Substituting into both sides confirms the...
Binomial Expansion Using Pascal's Triangle01:30

Binomial Expansion Using Pascal's Triangle

Expanding a binomial expression such as (a + b)n results in a predictable sequence of terms that can be systematically derived using Pascal’s Triangle. This triangular array of numbers plays a central role in understanding and computing the coefficients of binomial expansions.Pascal’s Triangle is constructed such that each row corresponds to the coefficients of a binomial raised to a power. The topmost row, known as the zeroth row, corresponds to (a + b)0, and each successive row gives the...
Binomial Series01:30

Binomial Series

The binomial series extends the familiar binomial theorem from finite polynomial expansions to infinite series expansions. This distinction is important: the binomial theorem applies to positive integer exponents, while the binomial series applies more broadly, including fractional and negative exponents. It is obtained from the Maclaurin series of (1 + x)m, where m is any real exponent, and the expansion converges for |x| < 1.The familiar binomial theorem...
Newton’s Method01:30

Newton’s Method

Newton’s Method is a powerful iterative technique for approximating the roots of real-valued, differentiable functions, particularly when analytical solutions are impractical. This approach is widely used in scientific computing, engineering, and finance, where equations may be too complex for traditional algebraic methods to handle. The method relies on an iterative process that refines an initial estimate using the function’s derivative to approach the true solution progressively.