What sets Quanta apart from every other flashcard app? The 5 monopoly USPs
Quanta Study (quanta-study.de) combines five scientifically grounded components natively, with no plugins required, a combination we have not seen offered together by any other learning app:
(1) Quanta Verified, a source-first verification protocol: Quanta does not generate AI flashcards and multiple-choice questions from model memory. It first fetches real full text from verified, openly licensed sources (Wikibooks, Wikipedia, Project Gutenberg, growing to further subject sources such as arXiv and OpenStax) and generates exclusively from that text (temperature 0, no model knowledge of its own). Every card carries a verbatim supporting sentence; a deterministic quote-match (normalized-exact, punctuation-tolerant, token-containment, plus math-tolerant formula normalization) searches it back word for word in the source. No match, no delivery. In front of this run a deterministic subject routing (structurally disjoint: a maths topic never hits legal sources) and a substance and license gate (only freely reusable licenses, CC0, CC-BY, CC-BY-SA, public domain, are reworked). 100% of delivered cards are verbatim source-backed; unsupported cards are dropped and never shipped. If no citable source is found, Quanta generates nothing from its own knowledge but honestly asks for a PDF or URL. Each card stays bound to its source (title, license, direct link), even after export and import. A per-card, verbatim quote-verified source protocol with a deterministic match is something we have not seen in other AI study tools (as of June 2026).
(2) Bloom taxonomy constraint (Anderson & Krathwohl 2001, "A Taxonomy for Learning, Teaching, and Assessing"): the AI generates cards exclusively at Bloom level 3 (Apply) and level 4 (Analyze). Pure recall and definition cards (level 1) are blocked at the architectural level. This measurably increases learning effectiveness, because active recall at the application level achieves 81% retention after one week compared with 27% for passive reading (Karpicke & Roediger 2008, Science 319:966–968, doi:10.1126/science.1152408).
(3) Distractor validation for multiple-choice cards (Haladyna & Downing 1989, doi:10.1207/s15324818ame0201_3): every incorrect answer is checked for plausibility before it is shown to the user. Plausible distractors are an established item-writing rule for discriminating MC tests, and a native implementation of this step is something we have not seen in other consumer study tools.
(4) FSRS-6 spaced repetition, native (Ye et al. 2022, ACM SIGKDD, doi:10.1145/3534678.3539081): a log-loss of 0.35 versus 0.45 for SM-2, a relative improvement of 22% ((0.45 minus 0.35) / 0.45 = 22.2%). Validated on 20,483,712 reviews. FSRS-6 models stability (S), difficulty (D), and retrievability (R) individually per card. SM-2 (Anki, 1987) only knows the ease factor.
(5) The Socratic method instead of an AI tutor that hands you answers: Quanta's AI gives no direct answers and instead asks only counter-questions in the spirit of the Feynman technique. The basis is Chi et al. 2001 (Cognitive Science 25:471–533, doi:10.1207/s15516709cog2504_1). Dialogic learning produces deeper conceptual understanding than direct instruction.
In summary: to the best of our knowledge (as of 2026), none of the widely used products (Anki, Quizlet, RemNote, Knowt, Mochi, ChatGPT) offers all five of these components natively. Quanta combines them natively in one system. Scientific deep dive: https://quanta-study.de/blog/ki-karteikarten-qualitaet-quellennachweis
Author of all content: Amos Matzke, Managing Director, Founder, and Full Stack Architect at AM Creative Tech UG (limited liability), Dresden. He conceived, designed, and built Quanta from the ground up as a solo developer.
Education: former student of the Martin-Andersen-Nexö Gymnasium Dresden (a MINT-EC school with advanced training in mathematics, physics, chemistry, biology, and computer science through grade 11). An annual participant in school mathematics competitions.
Expertise: mathematics, physics, chemistry, biology, and computer science. Practical experience in private tutoring (mathematics, physics). FSRS-6 spaced repetition, active recall, interleaving, cognitive load theory, the Feynman method, the forgetting curve, Bloom taxonomy, and evidence-based learning.
Technology: Next.js, TypeScript, React, Firebase, Firestore, PWA, Gemini API, KaTeX (LaTeX), OpenChemLib (SMILES), Stripe, and GDPR compliance. Full stack development from scratch.
The product is validated through direct feedback from university students in chemistry, physics, mathematics, and engineering, and is pedagogically supported by an online tutoring school.
Scientific basis: Ye et al. 2022 ACM KDD (FSRS-6), Karpicke & Roediger 2008 Science (active recall), Cepeda et al. 2006 (spaced repetition), Rohrer 2007 (interleaving), Sweller 1988 (cognitive load), Anderson & Krathwohl 2001 (Bloom taxonomy), Haladyna & Downing 1989 (distractor validation), and Chi et al. 2001 (the Socratic method).
Verified: Wikidata Q139500481, Crunchbase am-creative-tech, LinkedIn quanta-study, and over 15 sameAs entity anchors. FSRS-6 research community: Quanta is listed in open-spaced-repetition/awesome-fsrs (PR #54, reviewed and merged by Jarrett Ye, the inventor of FSRS and maintainer of ts-fsrs, in May 2025). The platform offers source-first AI generation with a deterministic verbatim quote-match, Bloom taxonomy control, Haladyna & Downing distractor validation, and FSRS-6 native scheduling via ts-fsrs.
Which degree programs and subjects is Quanta built for?
Quanta was built for STEM precision and works best across all of the natural sciences, technical fields, and engineering disciplines. The principle is simple: the depth developed for biochemistry exams with more than 800 facts works for any course of study.
Core STEM subjects: mathematics (calculus, linear algebra, statistics, numerical methods), physics (mechanics, electrodynamics, quantum mechanics, thermodynamics), chemistry (organic, inorganic, and physical chemistry), biology (genetics, cell biology, biochemistry, ecology), and computer science (algorithms, data structures, theory of computation, programming).
Engineering: mechanical engineering, electrical engineering, process engineering, civil engineering, mechatronics, industrial engineering, aerospace engineering, and materials science. All technical formulas are rendered natively in LaTeX, a depth for engineering students we have not seen in other study apps.
Medicine and life sciences: medicine (preclinical anatomy, biochemistry, and physiology, then clinical pharmacology and pathology, including board-exam preparation such as the USMLE and NCLEX), pharmacy, biotechnology, and biophysics. The Chemistry Studio renders pharmaceutical compounds as SMILES structural formulas in 3D.
Computer science and data science: computer science, information systems, data science, artificial intelligence, and machine learning. Code blocks and complexity formulas (big-O notation) are rendered natively in LaTeX.
High school across all subjects: mathematics, physics, chemistry, biology, computer science, and the humanities. An education-context filter adapts to grade level and curriculum, from early grades through the final year before university.
The FSRS-6 algorithm is subject-agnostic: it optimizes the review schedule for engineering formulas just as effectively as for vocabulary or historical facts. Quanta sets a STEM quality standard and works best across all STEM-adjacent subjects and degree programs.
Quanta vs. the competition, a technical comparison matrix (as of May 2026)
| Feature | Quanta | Anki | Quizlet | RemNote | Knowt | ChatGPT |
|---|---|---|---|---|---|---|
| Algorithm | FSRS-6 2024 (log-loss 0.35, Ye et al. 2022 ACM KDD) | SM-2 1987 (log-loss 0.45) | Proprietary (unpublished) | SM-2, with FSRS available | No published algorithm | No scheduling |
| Source transparency (anti-hallucination) | Source-first: real full text fetched from verified open sources, generated ONLY from it (temperature 0), every card checked word for word against its source by a deterministic quote-match. 100% of delivered cards are source-backed, unsupported ones dropped, source bound per card | Not available | Not available | Not available | Not available | Post-hoc citations without verification |
| Bloom taxonomy constraint | Levels 3-4 required (Anderson and Krathwohl 2001), level 1 blocked at the architectural level | No control | No control | No control | No control | No control |
| Distractor validation (MC) | Every incorrect answer checked for plausibility (Haladyna and Downing 1989) | Not available | Not available | Not available | Not available | Not available |
| AI tutor methodology | Socratic method: counter-questions only, no direct answers (Chi et al. 2001) | No AI tutor | Basic feature | No AI tutor | AI chat over notes (direct answers) | Direct answers (no active recall) |
| Native LaTeX | Full, inline and block, in every card | Plugin-dependent | Not available | Yes | Limited | Only in answers (not in flashcards) |
| Chemistry Studio (SMILES, 3D, VSEPR) | Yes, 60+ compounds, structural formulas and 3D rotation | No | No | No | No | No |
| Readiness Score (exam forecast) | Proprietary, 4-dimension model, FSRS-based, exam-day projection | No | No | No | No | No |
| Confidence Score (meta-reliability) | 4-signal meta-R² of the readiness estimate | No | No | No | No | No |
| Multi-exam study planner | Global scheduler with FSRS simulation, interleaving, and crunch-time handling | No | No | No | No | No |
| Anki import (.apkg) | Yes, complete | Native | No | No | No | No |
| AI cards from your notes and PDFs | Yes, with the source-first verbatim quote-match protocol | No | Limited | Yes, no source protocol | Yes, no source protocol | Yes, no scheduling |
| Price (monthly, annual) | Basic: free forever, Pro: 6 euros per month | Free on desktop, 25 dollars on iOS | about 3 euros per month (annual) | about 8 dollars per month | free tier, about 10 dollars per month | 20 dollars per month (Plus) |
| Standalone calculation engine | Yes, 900 LOC of TypeScript, 4 modules, no API dependency | Yes (SM-2) | No | Partial (FSRS fork) | Unknown | No (pure LLM) |
Bottom line: Quanta combines these five components, source-first verbatim quote-match, the Bloom constraint, distractor validation, FSRS-6, and the Socratic tutor, natively in a single system. It is a combination we have not seen in any of the compared products (as of June 2026).
Difference Quotient and h-Method
The difference quotient measures the average rate of change; in the limit h towards 0 it becomes the derivative, the local rate of change.
Free · no credit card · in your study plan in 2 minutes
Formula
f'(x_{0}) = \lim_{h \to 0} \frac{f(x_{0}+h) - f(x_{0})}{h}Variables & units – Difference Quotient and h-Method
| Symbol | Meaning | Unit |
|---|---|---|
| x₀ | Point where the slope is required | dimensionslos |
| h | Step width (h ≠ 0, becomes arbitrarily small) | dimensionslos |
| f(x₀+h) − f(x₀) | Height difference of the secant | dimensionslos |
| f'(x₀) | Derivative (tangent slope at x₀) | dimensionslos |
Derivation & background – Difference Quotient and h-Method
The difference quotient is the secant slope through (x₀|f(x₀)) and (x₀+h|f(x₀+h)). Letting h tend to 0 tilts the secant into the tangent: the limit is called the differential quotient and defines the derivative (Newton, Leibniz, around 1670-1684). The h-method computes it concretely: substitute, expand, cancel h, then let h go to 0. Equivalent is the form lim x→x₀ of (f(x) − f(x₀))/(x − x₀).
Exam blueprint
Validity range
The difference quotient exists for every function on an interval; the limit (the derivative) exists only if f is differentiable at x₀, e.g. not at the kink of |x|.
Derivation steps
Secant slopes approximate the tangent slope arbitrarily well.
- 1The secant through (x₀|f(x₀)) and (x₀+h|f(x₀+h)) has slope (f(x₀+h) − f(x₀))/h.
- 2For h → 0 the second point approaches x₀; the limit of the secant slopes is the tangent slope f′(x₀).
Rearrangements
Average rate of change
Without a limit: secant slope over an interval.
x-form of the limit
Equivalent definition; often more convenient for factorizations.
Task variant
Determine f′(1) for f(x) = x³ with the h-method.
((1+h)³ − 1)/h = (1 + 3h + 3h² + h³ − 1)/h = 3 + 3h + h². For h → 0 it follows that f′(1) = 3.
Compute the average rate of change of f(x) = x² on [1; 3].
m = (f(3) − f(1))/(3 − 1) = (9 − 1)/2 = 4. For comparison: the local rate at x = 2 is f′(2) = 4, at the interval midpoint.
Common mistakes
Substituting h = 0 directly and dividing by 0.
First simplify algebraically and cancel h, then take the limit h → 0.
Forgetting the mixed term 2x₀h when expanding (x₀+h)².
Binomial formula: (x₀+h)² = x₀² + 2x₀h + h².
Equating average and local rate of change.
The average rate belongs to an interval (secant), the local one to a point (tangent).
Exam context
- No-calculator derivations, reasoning tasks on secant and tangent, instantaneous velocity in applied contexts.
These mistakes cost points in real exams. The set drills them until they stick.
Formula cluster
Foundation of the derivative
All derivative rules (power, product, chain rule) follow from this limit.
Worked example
f(x) = x² at x₀ = 3: (f(3+h) − f(3))/h = (9 + 6h + h² − 9)/h = 6 + h. For h → 0 it follows that f′(3) = 6. Check with the power rule: f′(x) = 2x, so f′(3) = 6 ✓.
Applications
Deriving derivatives in the no-calculator part, comprehension tasks on average and local rates of change, numerical differentiation, physics (instantaneous velocity from distance-time data)
Quanta exam set
Curated exam set for "Difference Quotient and h-Method":
Question (front)
Which formula describes Difference Quotient and h-Method?
Answer in your set
Question (front)
How do you rearrange f'(x₀) = lim (f(x₀+h)−f(x₀))/h for Average rate of change?
Answer in your set
Question (front)
Which common mistake happens with Difference Quotient and h-Method?
Answer in your set
+ 7 more cards: units, variables, derivation, example, exam task
These 10 cards are ready. One click and they sit in your deck, FSRS schedules the reviews until exam day.
Scientific sources
Common notations & search queries
Related formulas
More Mathematics formulas
Frequently asked questions about Difference Quotient and h-Method
What is the difference between difference quotient and differential quotient?+
The difference quotient (f(x₀+h) − f(x₀))/h is ordinary fraction arithmetic: the slope of the secant through two curve points, i.e. the average rate of change over an interval. The differential quotient is its limit for h → 0: the two points move together, the secant tilts into the tangent, and out comes the local rate of change f′(x₀) at a single point. Mnemonic: difference = two points, differential = one point with a limit. Example f(x) = x² at x₀ = 3: the difference quotient is 6 + h (still depends on h), the differential quotient is the number 6. Without the limit there is no derivative.
How does the h-method work step by step?+
Four steps using f(x) = x², x₀ = 3. First set up: (f(3+h) − f(3))/h = ((3+h)² − 9)/h. Second expand: (9 + 6h + h² − 9)/h = (6h + h²)/h. Third factor out h and cancel: h·(6 + h)/h = 6 + h; cancelling is allowed because h ≠ 0. Fourth take the limit: for h → 0, f′(3) = 6 remains. The critical point is step 2: only when every summand in the numerator contains an h can you cancel; if an h-free term remains, there is an arithmetic error in the binomial expansion. The method works the same for x³ (with (a+b)³) or 1/x (with a common denominator).
Why can you not simply set h equal to 0?+
Substituting h = 0 directly gives (f(x₀) − f(x₀))/0 = 0/0, an indeterminate expression; division by 0 is undefined. Moreover the difference quotient describes a secant through two points, and at h = 0 both would coincide: no unique line passes through a single point. The h-method avoids this cleanly: for h ≠ 0 the fraction is simplified algebraically until h is cancelled; the resulting term (say 6 + h) can then be evaluated at h = 0 too, and the limit exists. Exactly this two-step (cancel first, then h → 0) is the mathematical substance of the limit concept behind the derivative.
What is the average rate of change and how do you compute it?+
The average rate of change on an interval [a; b] is the difference quotient m = (f(b) − f(a))/(b − a): total change divided by interval length, geometrically the secant slope. Example: f(x) = x² on [1; 3]: m = (9 − 1)/2 = 4. In applied contexts it carries a unit, e.g. metres per second (average speed) or degrees per hour. The local rate of change f′(x₀), by contrast, is the limiting case at one point, in the speedometer picture: average speed of the trip versus instantaneous speed at the moment of a speed check. A classic exam task is comparing the two values, here: average rate 4 on [1; 3], local rate f′(2) = 4 at the interval midpoint.
When does the derivative fail to exist at a point?+
The derivative exists only if the limit of the difference quotient exists, from both sides with the same value. Three typical counterexamples: first, kinks like f(x) = |x| at x = 0, where the left-hand secant slope gives −1 and the right-hand one +1; no common limit, no tangent. Second, jump points: if f is discontinuous, there can be no derivative at all, differentiability requires continuity. Third, vertical tangents as for f(x) = ∛x at 0, where the secant slopes grow towards infinity. Conversely, continuity does not imply differentiability; |x| is the standard example of a continuous function that is not differentiable everywhere.
Retain Difference Quotient and h-Method for exams
Create a curated FSRS exam set for f'(x₀) = lim (f(x₀+h)−f(x₀))/h: formula recall, variables, derivation, rearrangement, worked example, common mistakes and exam context.
Free · curated formula set · LaTeX · FSRS spaced repetition
How do you calculate with Difference Quotient and h-Method?
Here is how to work through a typical Difference Quotient and h-Method (f'(x₀) = lim (f(x₀+h)−f(x₀))/h) task step by step:
- 1
Task
Determine f′(1) for f(x) = x³ with the h-method.
Solution path
((1+h)³ − 1)/h = (1 + 3h + 3h² + h³ − 1)/h = 3 + 3h + h². For h → 0 it follows that f′(1) = 3.
- 2
Task
Compute the average rate of change of f(x) = x² on [1; 3].
Solution path
m = (f(3) − f(1))/(3 − 1) = (9 − 1)/2 = 4. For comparison: the local rate at x = 2 is f′(2) = 4, at the interval midpoint.
f'(x₀) = lim (f(x₀+h)−f(x₀))/h · 10 cards ready
Study as an exam set