freeCodeCamp/curriculum/challenges/spanish/08-coding-interview-prep/rosetta-code/evaluate-binomial-coefficients.spanish.md

title, id, localeTitle, challengeType

title	id	localeTitle	challengeType
Evaluate binomial coefficients	598de241872ef8353c58a7a2	598de241872ef8353c58a7a2	5

Description

Escribe una función para calcular el coeficiente binomial para el valor dado de n y k.

Se recomienda esta fórmula:

$ \ binom {n} {k} = \ frac {n!} {(Nk)! K!} = \ Frac {n (n-1) (n-2) \ ldots (n-k + 1)} {k (k-1) (k-2) \ ldots 1} $

Instructions

Tests

tests:
  - text: <code>binom</code> es una función.
    testString: 'assert(typeof binom === "function", "<code>binom</code> is a function.");'
  - text: &#39; <code>binom(5,3)</code> debe devolver 10.&#39;
    testString: 'assert.equal(binom(5, 3), 10, "<code>binom(5,3)</code> should return 10.");'
  - text: &#39; <code>binom(7,2)</code> debe devolver 21&#39;.
    testString: 'assert.equal(binom(7, 2), 21, "<code>binom(7,2)</code> should return 21.");'
  - text: &#39; <code>binom(10,4)</code> debe devolver 210.&#39;
    testString: 'assert.equal(binom(10, 4), 210, "<code>binom(10,4)</code> should return 210.");'
  - text: &#39; <code>binom(6,1)</code> debe devolver 6.&#39;
    testString: 'assert.equal(binom(6, 1), 6, "<code>binom(6,1)</code> should return 6.");'
  - text: &#39; <code>binom(12,8)</code> debe devolver 495.&#39;
    testString: 'assert.equal(binom(12, 8), 495, "<code>binom(12,8)</code> should return 495.");'

Challenge Seed

function binom (n, k) {
  // Good luck!
}

Solution

function binom(n, k) {
  let coeff = 1;
  for (let i = n - k + 1; i <= n; i++) coeff *= i;
  for (let i = 1; i <= k; i++) coeff /= i;
  return coeff;
}