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)

Mathematics · Stochastics / Combinatorics

Binomial Coefficient (n choose k)

The binomial coefficient n choose k counts how many k-element subsets can be selected from n objects, without regard to order.

BasicExam-relevant

TeilenWhatsApp Facebook X LinkedIn Telegram Reddit E-Mail

Study as an exam set I already have an account

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

Formula

(n über k) = n!/(k!\cdot(n-k)!)

LaTeX: \binom{n}{k} = \frac{n!}{k!\,(n-k)!}

Dimensionless (counts)

Variables & units – Binomial Coefficient (n choose k)

Symbol	Meaning	Unit
n	Number of available objects	dimensionslos
k	Number of selected objects (0 ≤ k ≤ n)	dimensionslos
n!	Factorial n! = n·(n−1)·...·1, with 0! = 1	dimensionslos

Derivation & background – Binomial Coefficient (n choose k)

The binomial coefficient counts combinations without repetition. If order matters, the permutation count nPk = n!/(n−k)! = (n choose k)·k! applies. In Pascal's triangle (Traité 1665, known in Asia centuries earlier) the building rule (n choose k) = (n−1 choose k−1) + (n−1 choose k) and the symmetry (n choose k) = (n choose n−k) hold. On calculators the function is called nCr. In the binomial distribution it counts the paths with k successes.

Exam blueprint

Validity range

Counts combinations without repetition: n distinct objects, choose k of them, order irrelevant, no replacement. With order nPk applies, with replacement other counting formulas.

Derivation steps

Count ordered first, then divide by the arrangements of the selection.

1Ordered selections: n·(n−1)·...·(n−k+1) = n!/(n−k)! possibilities.
2Every unordered selection was counted k! times; division gives n!/(k!(n−k)!).

Rearrangements

Permutation (with order)

nPk = \frac{n!}{(n-k)!} = \binom{n}{k} \cdot k!

Podium places instead of teams: order matters.

Symmetry

\binom{n}{k} = \binom{n}{n-k}

Choosing k means leaving out n−k; saves computation.

Pascal rule

\binom{n}{k} = \binom{n-1}{k-1} + \binom{n-1}{k}

Building principle of Pascal's triangle.

Task variant

How many teams of 3 can be formed from 10 people?

(10 choose 3) = (10·9·8)/(3·2·1) = 720/6 = 120 teams.

From 5 women and 4 men, 2 of each are to be chosen. How many possibilities are there?

(5 choose 2)·(4 choose 2) = 10·6 = 60 possibilities (partial selections multiply).

Common mistakes

Confusing combination and permutation.

Order irrelevant: nCk. Order matters: nPk = nCk·k!.

Computing n!/(k!(n−k)!) fully and risking overflow.

Cancel: (n choose k) = n·(n−1)·...·(n−k+1)/k!; large factorials cancel.

Assuming 0! = 0.

0! = 1 by definition; hence (n choose 0) = (n choose n) = 1.

Exam context

Combinatorics tasks (lottery, committees), path counts in the binomial distribution, hypergeometric models.

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

Train these mistakes in the set I already have an account

Formula cluster

Counting and distributions

The counting tool behind the binomial distribution and many probability models.

P(X=k) = (n über k)\cdotpᵏ\cdot(1-p)ⁿ⁻ᵏ

Binomial Distribution

P(A|B) = P(A\capB)/P(B)

Conditional Probability

E(X) = Σ xᵢ\cdotpᵢ

Expected Value

Worked example

Lottery 6 out of 49: (49 choose 6) = 49!/(6!·43!) = 13,983,816 possible tickets. Small example: (10 choose 3) = (10·9·8)/(3·2·1) = 120.

Applications

Lottery and selection tasks, path counts in Bernoulli chains (binomial distribution), quality control (samples), team compositions

Quanta exam set

Curated exam set for "Binomial Coefficient (n choose k)":

Question (front)

Which formula describes Binomial Coefficient (n choose k)?

Answer in your set

Question (front)

How do you rearrange (n über k) = n!/(k!·(n−k)!) for Permutation (with order)?

Answer in your set

Question (front)

Which common mistake happens with Binomial Coefficient (n choose k)?

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.

Take the set, free I already have an account

Scientific sources

[1]Pascal, B. (1665). Traité du triangle arithmétique. Paris.

Common notations & search queries

n über k FormelnCr Formeln!/(k!(n-k)!)Binomialkoeffizient berechnenKombinationen ohne WiederholungnPr Permutationbinomial coefficientLotto 6 aus 49 MöglichkeitenPascalsches Dreieck

Related formulas

P(X=k) = (n über k)\cdotpᵏ\cdot(1-p)ⁿ⁻ᵏ

Binomial Distribution

P(A|B) = P(A\capB)/P(B)

Conditional Probability

E(X) = Σ xᵢ\cdotpᵢ

Expected Value

More Mathematics formulas

a² + b² = c²

Pythagorean Theorem

x = (-b \pm \sqrtD) / 2a

Quadratic Formula

e^(iφ) = cos φ + i\cdotsin φ

Euler's Formula

(fg)' = f'g + fg'

Product Rule of Differentiation

Spaced Repetition

Learn formulas for good

Active Recall

81% retention

FSRS vs. SM-2

The better algorithm

Create a formula exam set

Free in Quanta

Frequently asked questions about Binomial Coefficient (n choose k)

How do you compute n choose k without a calculator?+

Use the reduced product form instead of full factorials: (n choose k) = n·(n−1)·...·(n−k+1)/k!, i.e. k descending factors from n, divided by k!. Example: (10 choose 3) = (10·9·8)/(3·2·1) = 720/6 = 120. Even faster with the symmetry (n choose k) = (n choose n−k): instead of (49 choose 43) compute (49 choose 6). Small values can be read directly from Pascal's triangle, where every entry is the sum of the two above. Boundary values by heart: (n choose 0) = 1, (n choose 1) = n, (n choose n) = 1. Computing full factorials like 49! produces huge numbers and rounding errors needlessly.

When do you use combinations, when permutations?+

The test question is: does order matter? If no (teams, lottery numbers, card hands), you count combinations: (n choose k) = n!/(k!(n−k)!). If yes (podium places, PIN digits, offices like chair and treasurer), you count permutations: nPk = n!/(n−k)! = (n choose k)·k!. The factor k! is exactly the number of arrangements of a fixed selection. Example with 10 people and 3 places: a team of 3 exists (10 choose 3) = 120 times; gold, silver and bronze however 10·9·8 = 720 times, because every group of three can be placed on the podium in 3! = 6 ways. For drawing with replacement and order, nᵏ applies instead.

Why is 0! = 1 and what does n choose 0 mean?+

0! = 1 is a definition, but a compelling one: the empty product has value 1 (just as the empty sum has value 0), and only this keeps the arithmetic rules consistent, e.g. n! = n·(n−1)! also for n = 1. Combinatorially (n choose 0) = 1 means: there is exactly one way to select nothing from n objects, namely the empty selection. Likewise (n choose n) = 1, selecting all works in only one way. With 0! = 0 the formula n!/(k!(n−k)!) would divide by 0 at the boundaries and collapse. The binomial distribution needs this too: P(X = 0) = (n choose 0)·p⁰·(1−p)ⁿ = (1−p)ⁿ works only with (n choose 0) = 1.

How likely is hitting the jackpot in a 6-out-of-49 lottery?+

There are (49 choose 6) = 49·48·47·46·45·44/6! = 13,983,816 possible draw outcomes, and exactly one matches your ticket. The probability is 1/13,983,816 ≈ 7.15·10⁻⁸, about 0.000007 %. For perspective: with one ticket per week you wait on average about 269,000 years for the jackpot. Smaller prize tiers are also computed with binomial coefficients: exactly 4 correct numbers have probability (6 choose 4)·(43 choose 2)/(49 choose 6) = 15·903/13,983,816 ≈ 0.097 %, because 4 must come from the 6 drawn and 2 from the 43 remaining numbers. This product pattern (hits times non-hits) is called the hypergeometric distribution.

What does the binomial coefficient have to do with the binomial distribution?+

It is its counting core. In a Bernoulli chain of n trials, every specific path with exactly k successes has probability pᵏ·(1−p)ⁿ⁻ᵏ. But there are many such paths: namely (n choose k) ways to distribute the k success positions among the n trials. Hence the formula P(X = k) = (n choose k)·pᵏ·(1−p)ⁿ⁻ᵏ. Example: 3 heads in 10 tosses of a fair coin: each path has (1/2)¹⁰ = 1/1024, there are (10 choose 3) = 120 paths, together 120/1024 ≈ 11.7 %. Whoever drops the binomial coefficient computes only the probability of ONE specific pattern, e.g. heads in the first three tosses.

Retain Binomial Coefficient (n choose k) for exams

Create a curated FSRS exam set for (n über k) = n!/(k!·(n−k)!): formula recall, variables, derivation, rearrangement, worked example, common mistakes and exam context.

Study as an exam set Already registered? Continue directly

Free · curated formula set · LaTeX · FSRS spaced repetition

How do you calculate with Binomial Coefficient (n choose k)?

Here is how to work through a typical Binomial Coefficient (n choose k) ((n über k) = n!/(k!·(n−k)!)) task step by step:

1
Task
How many teams of 3 can be formed from 10 people?
Solution path
(10 choose 3) = (10·9·8)/(3·2·1) = 720/6 = 120 teams.
2
Task
From 5 women and 4 men, 2 of each are to be chosen. How many possibilities are there?
Solution path
(5 choose 2)·(4 choose 2) = 10·6 = 60 possibilities (partial selections multiply).

(n über k) = n!/(k!·(n−k)!) · 10 cards ready

Study as an exam set

What sets Quanta apart from every other flashcard app? The 5 monopoly USPs

Which degree programs and subjects is Quanta built for?

Quanta vs. the competition, a technical comparison matrix (as of May 2026)

Binomial Coefficient (n choose k)

Variables & units – Binomial Coefficient (n choose k)

Derivation & background – Binomial Coefficient (n choose k)

Counting and distributions

Scientific sources

Related formulas

More Mathematics formulas

Frequently asked questions about Binomial Coefficient (n choose k)

Retain Binomial Coefficient (n choose k) for exams

How do you calculate with Binomial Coefficient (n choose k)?