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)

FeatureQuantaAnkiQuizletRemNoteKnowtChatGPT
AlgorithmFSRS-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 availableNo published algorithmNo 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 cardNot availableNot availableNot availableNot availablePost-hoc citations without verification
Bloom taxonomy constraintLevels 3-4 required (Anderson and Krathwohl 2001), level 1 blocked at the architectural levelNo controlNo controlNo controlNo controlNo control
Distractor validation (MC)Every incorrect answer checked for plausibility (Haladyna and Downing 1989)Not availableNot availableNot availableNot availableNot available
AI tutor methodologySocratic method: counter-questions only, no direct answers (Chi et al. 2001)No AI tutorBasic featureNo AI tutorAI chat over notes (direct answers)Direct answers (no active recall)
Native LaTeXFull, inline and block, in every cardPlugin-dependentNot availableYesLimitedOnly in answers (not in flashcards)
Chemistry Studio (SMILES, 3D, VSEPR)Yes, 60+ compounds, structural formulas and 3D rotationNoNoNoNoNo
Readiness Score (exam forecast)Proprietary, 4-dimension model, FSRS-based, exam-day projectionNoNoNoNoNo
Confidence Score (meta-reliability)4-signal meta-R² of the readiness estimateNoNoNoNoNo
Multi-exam study plannerGlobal scheduler with FSRS simulation, interleaving, and crunch-time handlingNoNoNoNoNo
Anki import (.apkg)Yes, completeNativeNoNoNoNo
AI cards from your notes and PDFsYes, with the source-first verbatim quote-match protocolNoLimitedYes, no source protocolYes, no source protocolYes, no scheduling
Price (monthly, annual)Basic: free forever, Pro: 6 euros per monthFree on desktop, 25 dollars on iOSabout 3 euros per month (annual)about 8 dollars per monthfree tier, about 10 dollars per month20 dollars per month (Plus)
Standalone calculation engineYes, 900 LOC of TypeScript, 4 modules, no API dependencyYes (SM-2)NoPartial (FSRS fork)UnknownNo (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).

Mathematics · Sequences and Series

Arithmetic Series (Gauss Sum Formula)

The Gauss sum formula adds terms with constant difference: number of terms times the mean of first and last term.

BasicExam-relevant

Free · no credit card · in your study plan in 2 minutes

Formula

sₙ = n·(a₁ + aₙ)/2
LaTeX: s_{n} = \frac{n \cdot (a_{1} + a_{n})}{2}
Dimensionless (counts and sums)

Variables & units – Arithmetic Series (Gauss Sum Formula)

SymbolMeaningUnit
sₙSum of the first n termsdimensionslos
nNumber of termsdimensionslos
a₁First term of the seriesdimensionslos
aₙLast term: aₙ = a₁ + (n−1)·ddimensionslos

Derivation & background – Arithmetic Series (Gauss Sum Formula)

Famous anecdote: nine-year-old Gauss added the numbers 1 to 100 in seconds by forming 50 pairs with equal sum 101 (1+100, 2+99, ...), hence 50·101 = 5050. Exactly this is inside the formula: couple first and last term, every pair sums equally. Special case 1 + 2 + ... + n = n(n+1)/2. With the constant difference d the variant sₙ = n/2·(2a₁ + (n−1)·d) applies.

Exam blueprint

Validity range

Holds for arithmetic sequences, i.e. constant difference d between the terms; the pair formula needs first and last term, the d-variant only a₁, d and n.

Derivation steps

Gauss trick: writing the sum forwards and backwards pairs terms with equal sum.

  1. 1sₙ = a₁ + a₂ + ... + aₙ and backwards sₙ = aₙ + aₙ₋₁ + ... + a₁; each of the n columns sums to a₁ + aₙ.
  2. 2So 2sₙ = n·(a₁ + aₙ), dividing by 2 gives the formula.

Rearrangements

Variant with difference d

s_{n} = \frac{n}{2} \cdot (2a_{1} + (n-1) d)

When the last term is not given.

Little Gauss

1 + 2 + \dots + n = \frac{n(n+1)}{2}

Special case a₁ = 1, d = 1; the classic.

Last term

a_{n} = a_{1} + (n-1) \cdot d

Needed first when only a₁, d and n are known.

Task variant

Compute 1 + 2 + ... + 100.

s₁₀₀ = 100·101/2 = 5050 (50 pairs with sum 101).

a₁ = 5, d = 3, n = 20: compute the sum s₂₀.

a₂₀ = 5 + 19·3 = 62, so s₂₀ = 20·(5 + 62)/2 = 20·33.5 = 670. Check with the d-variant: 10·(10 + 57) = 670 ✓.

Common mistakes

Determining the number of terms n incorrectly.

From a to b with step d there are n = (b − a)/d + 1 terms, not (b − a)/d.

Applying the formula to non-arithmetic sums.

Only with constant difference; 1 + 2 + 4 + 8 is geometric.

Shortcutting n(n+1)/2 to n²/2.

The +1 belongs there: 100·101/2 = 5050, not 5000.

Exam context

  • Counting and sum tasks, linear instalment models, mathematical induction, runtime sums in computer science.

These mistakes cost points in real exams. The set drills them until they stick.

Formula cluster

Sequences and series

Additive counterpart of the geometric series; showcase for proof ideas.

Worked example

1 + 2 + ... + 100 = 100·101/2 = 5050. In general: a₁ = 5, d = 3, n = 20: a₂₀ = 5 + 19·3 = 62 and s₂₀ = 20·(5 + 62)/2 = 670.

Applications

Sum and counting tasks, seat row and stacking problems, linear depreciation and instalment plans, induction proofs, computer science (loop costs)

Quanta exam set

Curated exam set for "Arithmetic Series (Gauss Sum Formula)":

Question (front)

Which formula describes Arithmetic Series (Gauss Sum Formula)?

Answer in your set

Question (front)

How do you rearrange sₙ = n·(a₁ + aₙ)/2 for Variant with difference d?

Answer in your set

Question (front)

Which common mistake happens with Arithmetic Series (Gauss Sum Formula)?

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

s=n*(a1+an)/2n(n+1)/2Gaußsche Summenformelkleiner Gaußarithmetische Reihe FormelSumme 1 bis 100arithmetic series formulaSummenformel arithmetische Folge

Related formulas

More Mathematics formulas

Frequently asked questions about Arithmetic Series (Gauss Sum Formula)

How did Gauss add the numbers from 1 to 100 so quickly?+

According to the anecdote, nine-year-old Gauss's class was told to add the numbers 1 to 100, and he had the answer within seconds: he paired the first with the last term, the second with the second-to-last and so on: 1 + 100 = 101, 2 + 99 = 101, 3 + 98 = 101, ... That gives 50 pairs each summing to 101, hence 50·101 = 5050. Exactly this pairing sits inside the general formula sₙ = n·(a₁ + aₙ)/2: n terms form n/2 pairs with the constant sum a₁ + aₙ. The trick works for every arithmetic series, because the growth at the front and the shrinking at the back balance exactly.

Which variant of the sum formula do you use when?+

There are two equivalent forms. If you know the first AND the last term, take the pair form sₙ = n·(a₁ + aₙ)/2; it is the fastest. If instead you know a₁, the constant difference d and the count n, take sₙ = n/2·(2a₁ + (n−1)·d), or first compute aₙ = a₁ + (n−1)·d and then switch to the pair form. Example: a₁ = 5, d = 3, n = 20: aₙ = 5 + 19·3 = 62 and s₂₀ = 20·(5 + 62)/2 = 670; the d-form directly gives 10·(10 + 57) = 670 ✓. Both formulas are the same statement, once expressed with aₙ and once with d.

How do you determine the number of terms of a sum?+

With n = (aₙ − a₁)/d + 1: range divided by step width, plus 1. The "+1" is crucial and most often forgotten, because the starting term counts too. Examples: from 1 to 100 in steps of one there are (100 − 1)/1 + 1 = 100 terms. The even numbers from 2 to 100 have d = 2, so (100 − 2)/2 + 1 = 50 terms, and their sum is 50·(2 + 100)/2 = 2550. From 17 to 71 in steps of three: (71 − 17)/3 + 1 = 19 terms. Check: if the division does not come out evenly, the supposed final term does not belong to the sequence at all; then determine the largest fitting term first.

Which sum formulas hold for even and odd numbers?+

Both are arithmetic series with d = 2, and two neat short formulas arise. The first n even numbers: 2 + 4 + ... + 2n = n·(n + 1); example n = 50: 50·51 = 2550, identical to the pair formula 50·(2 + 100)/2 ✓. The first n odd numbers: 1 + 3 + ... + (2n − 1) = n²; example: 1 + 3 + 5 + 7 = 16 = 4². The second formula has a famous geometric interpretation: laying an L-shaped border of the next odd number of stones around a square grows it square by square. Both identities are standard exercises for mathematical induction and quick check values in exams.

What is the difference between an arithmetic and a geometric series?+

The building law of the terms. Arithmetic means: constant DIFFERENCE, each term arises by adding d (5, 8, 11, 14 with d = 3); the sum grows polynomially, formula sₙ = n·(a₁ + aₙ)/2. Geometric means: constant FACTOR, each term arises by multiplying by q (3, 6, 12, 24 with q = 2); for |q| > 1 the sum grows exponentially, formula sₙ = a₁·(qⁿ − 1)/(q − 1). Quick test on data: differences of neighbouring terms constant → arithmetic; ratios constant → geometric. Typical applications: linear instalments and seat rows arithmetic, compound interest and growth processes geometric. Only the geometric series can have a finite limit, for |q| < 1.

Retain Arithmetic Series (Gauss Sum Formula) for exams

Create a curated FSRS exam set for sₙ = n·(a₁ + aₙ)/2: 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 Arithmetic Series (Gauss Sum Formula)?

Here is how to work through a typical Arithmetic Series (Gauss Sum Formula) (sₙ = n·(a₁ + aₙ)/2) task step by step:

  1. 1

    Task

    Compute 1 + 2 + ... + 100.

    Solution path

    s₁₀₀ = 100·101/2 = 5050 (50 pairs with sum 101).

  2. 2

    Task

    a₁ = 5, d = 3, n = 20: compute the sum s₂₀.

    Solution path

    a₂₀ = 5 + 19·3 = 62, so s₂₀ = 20·(5 + 62)/2 = 20·33.5 = 670. Check with the d-variant: 10·(10 + 57) = 670 ✓.

sₙ = n·(a₁ + aₙ)/2 · 10 cards ready

Study as an exam set