Skip to main content
Calkulon

Matematika

Kalkulačka faktoriálu n!

Variable Legend

n= non-negative integern!= factorial of n

Definition

Product of all positive integers from 1 to n.

Base case

Recursive definition

Each factorial is n times the previous.

Stirling's approximation

Accurate estimate for large n.

Podrobný sprievodca čoskoro

Pracujeme na komplexnom vzdelávacom sprievodcovi pre Kalkulačka faktoriálu n!. Čoskoro sa vráťte pre podrobné vysvetlenia, vzorce, príklady z praxe a odborné tipy.

💡

Pro Tip

Stirling's approximation: n! ≈ √(2πn) × (n/e)ⁿ. For large n, this is very accurate. For n=10: exact = 3,628,800; Stirling gives 3,598,696 (0.83% error).

Difficulty:Intermediate

Did you know?

The number of ways to shuffle a standard 52-card deck is 52! ≈ 8 × 10⁶⁷. This number is so large that every time you shuffle a deck, you are almost certainly creating an ordering that has never existed before in human history.

Mathematically verified
Reviewed May 2026
Used 52K+ times
Our methodology
🔒
100% zadarmo
Nikdy bez registrácie
Presné
Overené vzorce
Okamžité
Výsledky počas písania
📱
Vhodné pre mobily
Všetky zariadenia

Nastavenia