Konbinazio-kalkulagailua (nCr)
R elementuak n-tik aukeratzeko moduak zenbatu ordena ez bada garrantzitsua.
Emaitzak idazten duzun heinean eguneratzen dira.
Kalkulagailu honi buruz
combination counts how many ways you can choose r items from a set of n when order does not matter — picking the same group in a different sequence counts once. This calculator returns the exact count, the formula, and the matching number of ordered arrangements (nPr) for comparison. For example, if you choose 10 items and choose 10 items from the same group, you will get 1000CombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombinationsCombination
[Translation temporarily unavailable. Please try again.]
Zein da konbinazio-formula?
nCr = n! / (r! × (n − r)!). 10 elementu, 3 aldi berean hartuta: 120 talde ezberdin.
Zergatik da nCr nPr baino txikiagoa?
Konbinazioek ordenari ez diote jaramonik egiten, beraz ordenatu gabeko talde bakoitzak r! ordenatutako permutazioei dagozkie. Horregatik nCr = nPr ÷ r!
Noiz erabili behar dut konbinazio bat?
Ordenak ez duenean garrantzirik: loteria zenbakiak, kartak, komite bat aukeratzea, edo talde bat aukeratzea, non taldeak balio duen, ez antolamenduak.
Zer da binomial koefizientea?
nCr-ren beste izen bat da, "n r aukeratu" balioa, teorema binomialean agertzen dena eta Pascalen triangeluaren sarrerak eratzen dituena.
Zer da nC0 edo nCn?
Biek 1 balio dute, eta modu bat dago bat ere ez aukeratzeko, eta beste bat, biak aukeratzeko.
Tresna honek permutazioa ere erakusten du?
Bai. nPr = nCr × r! erakusten du konbinazioaren ondoan, ordenatutako eta ordenatu gabeko zenbakiak konparatu ahal izateko.
API — erabili kalkulagailu hau kodetik
Deitu kalkulagailu honi JSON amaierako puntu libre gisa — ez da gakorik behar. Bidali beheko eremuen balioak kontsultaren parametro edo JSON gisa. Irakurri APIaren dokumentazioa osorik →
Amaierako puntua
GET https://calculator.free/api/v1/combination/curl
curl "https://calculator.free/api/v1/combination/?n=10&r=3"JavaScript fetch()
const r = await fetch(
"https://calculator.free/api/v1/combination/?" + new URLSearchParams({
"n": "10",
"r": "3"
}));
const data = await r.json();
console.log(data.results);Emaitzak gida orokorrerako estimazioak dira, ez finantzarioak, medikuak edo zerga aholkuak.