What would you like to understand?

Popular destinationsCalculatorsCoursesPracticeFormulas

Unlock Premium Help

Explore every tutor and study workspace for seven days, with no daily AI cap during the trial.

Choose a billing period
Ask a parent to pay

Nothing is charged during the first seven days. Unless you cancel, the plan you selected begins when the trial ends and renews on its stated schedule. Manage cancellation from your plan page. Stripe handles the payment details.

← Real Analysis
00:00

Find out what you can choose without a model.

Guided mode reveals one clue and immediate feedback. Quiet-test mode postpones the review until the complete run is submitted.

Course areas in this rehearsal

Treat the list as a dependency map. A later miss may point back to an earlier definition or representation.

Real numbers

Real numbers: Name the objects and notation before applying a rule.

Sequences

Sequences: Connect the symbolic form to a graph, diagram, table, or example.

Series

Series: Compare two methods and record when each one is valid.

Continuity

Continuity: Finish with an unfamiliar problem and an independent check.

Differentiation

Differentiation: Name the objects and notation before applying a rule.

Riemann integration

Riemann integration: Connect the symbolic form to a graph, diagram, table, or example.

Metric spaces

Metric spaces: Compare two methods and record when each one is valid.

Eight original decision checks

These fixed prompts test study and verification choices across the course map. The interactive builder above creates mathematical questions separately.

Question 1: What is the supremum of the set of all numbers 1 - 1/n for positive integers n, and is it in the set?

Real numbers

  1. supremum 1, not in the set
  2. supremum 1, in the set
  3. supremum 0, in the set
  4. the set has no supremum
Inspect the reasoning
  1. The values are 0, 1/2, 2/3, 3/4, and so on, always below 1.
  2. So 1 is an upper bound.
  3. No smaller number works, because 1 - 1/n gets as close to 1 as you like by taking n large.
  4. 1 is never reached, since 1/n is never 0, so the supremum is 1 and it is not a member.

Best choice: supremum 1, not in the set

Question 2: For a(n) = (3n + 1) / (n + 2), the limit is 3. What is the smallest N with |a(n) - 3| < 0.01 for all n greater than or equal to N?

Sequences

  1. N = 499
  2. N = 500
  3. N = 498
  4. N = 302
Inspect the reasoning
  1. Simplify the difference: (3n + 1) / (n + 2) - 3 = (3n + 1 - 3n - 6) / (n + 2) = -5 / (n + 2).
  2. So |a(n) - 3| = 5 / (n + 2).
  3. Require 5 / (n + 2) < 0.01, which means n + 2 > 500, so n > 498.
  4. The smallest integer that works is N = 499. Check: 5 / 501 = 0.00998.

Best choice: N = 499

Question 3: For which values of p does the series of 1 / n^p converge?

Series

  1. p greater than 1
  2. p at least 1
  3. p less than 1
  4. all real p
Inspect the reasoning
  1. The integral test compares the series with the integral of 1 / x^p from 1 to infinity.
  2. That integral is finite exactly when p is greater than 1.
  3. At p = 1 the series is the harmonic series, which diverges.
  4. For p below 1 the terms shrink even more slowly, so it diverges too.

Best choice: p greater than 1

Question 4: Is f(x) = x^2 uniformly continuous on [0, 3], and on all of the real line?

Continuity

  1. Yes on [0, 3], no on the real line
  2. Yes in both cases
  3. No in either case
  4. No on [0, 3], yes on the real line
Inspect the reasoning
  1. A continuous function on a closed bounded interval is always uniformly continuous, so [0, 3] is fine.
  2. On the whole line the slope 2x grows without bound.
  3. Take the points n and n + 1/n. Their squares differ by 2 + 1/n^2, which stays above 2.
  4. The inputs get arbitrarily close while the outputs do not, so uniform continuity fails on the real line.

Best choice: Yes on [0, 3], no on the real line

Question 5: The Mean Value Theorem is applied to f(x) = x^2 on [1, 4]. What value of c does it produce?

Differentiation

  1. c = 2.5
  2. c = 2
  3. c = 3
  4. c = 5
Inspect the reasoning
  1. The average rate of change is (f(4) - f(1)) / (4 - 1) = (16 - 1) / 3 = 5.
  2. The theorem promises some c in (1, 4) with f'(c) equal to 5.
  3. f'(x) = 2x, so 2c = 5.
  4. c = 2.5, which does lie between 1 and 4.

Best choice: c = 2.5

Question 6: For f(x) = x on [0, 1] with 4 equal subintervals, what is the upper Riemann sum?

Riemann integration

  1. 0.625
  2. 0.5
  3. 0.375
  4. 0.75
Inspect the reasoning
  1. Each subinterval has width 1/4, and f is increasing, so the largest value is at the right end.
  2. The right endpoints are 0.25, 0.5, 0.75, and 1.
  3. Those heights add to 2.5.
  4. 0.25 x 2.5 = 0.625. The exact integral is 0.5, so the upper sum is above it as expected.

Best choice: 0.625

Question 7: Which subset of the real line is compact?

Metric spaces

  1. The closed interval [0, 1]
  2. The half-open interval [0, 1)
  3. The set of all integers
  4. The open interval (0, 1)
Inspect the reasoning
  1. In the real line, the Heine-Borel theorem says compact means closed and bounded.
  2. [0, 1) is bounded but not closed, since 1 is a limit point that is missing.
  3. The integers form a closed set but are not bounded.
  4. (0, 1) is bounded but not closed. Only [0, 1] is both, so only it is compact.

Best choice: The closed interval [0, 1]

Question 8: What does the Bolzano-Weierstrass theorem guarantee for a bounded sequence of real numbers?

Sequences

  1. It has at least one convergent subsequence.
  2. It converges.
  3. It is monotone.
  4. It is a Cauchy sequence.
Inspect the reasoning
  1. Bounded does not mean convergent. The sequence 1, -1, 1, -1, ... is bounded and never settles.
  2. But that example does contain a subsequence of all 1s, which converges.
  3. Bolzano-Weierstrass says this always happens: infinitely many terms crowd into some bounded region.
  4. So every bounded real sequence has a convergent subsequence, even when the sequence itself has no limit.

Best choice: It has at least one convergent subsequence.

After the run

Sort each miss into interpretation, recall, setup, execution, verification, or pacing. Schedule a changed question that tests the corrected decision without reusing the same surface details.

When should I increase difficulty?

Increase it after setup is accurate without a clue and you can explain why the method fits.

When should I use test mode?

Use it once guided sets are stable and you want evidence about selection, pacing, and sustained attention.

Printed question coverage
QuestionsReview
8 original promptsChoices, answer, and worked reasoning