順列・組み合わせ計算機

計算する 計算中…

リセット 印刷

共有リンク

はじめに

Permutation & Combination — P(n,k) and C(n,k) with BigInt precision. Enter n, k to get an instant, accurate result.

計算式

Permutations: n!/(n−k)!. Combinations: n!/(k!(n−k)!).

ステップごとの説明

1. Enter the n.
2. Enter the k.
3. Click Calculate to see your result instantly.

実例

Example: With n = 10, k = 3, the Permutation & Combination gives Permutations: 720, Combinations: 120.

よくある質問

What's the difference between permutations and combinations?

Permutations count arrangements where order matters; combinations count selections where order does not.

What if k is larger than n?

That's not a valid selection — k can't exceed n.

What inputs does the Permutation & Combination need?

You'll need to provide: n, k. All fields use sensible defaults, so you can see a working example immediately and then adjust the values to match your own numbers.

How accurate is the Permutation & Combination?

The Permutation & Combination applies the formula exactly as calculated — Permutations: n!/(n−k)!. Combinations: n!/(k!(n−k)!). — so results are precise for the inputs you provide. Accuracy depends on entering correct, realistic input values.

Is the Permutation & Combination free to use?

Yes, the Permutation & Combination is completely free, requires no signup, and runs instantly in your browser.

順列・組み合わせ計算機について

The Permutation & Combination uses a real, verifiable formula — Permutations: n!/(n−k)!. Combinations: n!/(k!(n−k)!). — so results are accurate every time, not an approximation.