public void BinomialCoefficient_PairsOfNaturalNumbers_ReturnsResult()
{
var value = new BigInteger[, ]
{
{ 1, 0, 0, 0, 0, 0, 0, 0, 0, 0 },
{ 2, 1, 0, 0, 0, 0, 0, 0, 0, 0 },
{ 3, 3, 1, 0, 0, 0, 0, 0, 0, 0 },
{ 4, 6, 4, 1, 0, 0, 0, 0, 0, 0 },
{ 5, 10, 10, 5, 1, 0, 0, 0, 0, 0 },
{ 6, 15, 20, 15, 6, 1, 0, 0, 0, 0 },
{ 7, 21, 35, 35, 21, 7, 1, 0, 0, 0 },
{ 8, 28, 56, 70, 56, 28, 8, 1, 0, 0 },
{ 9, 36, 84, 126, 126, 84, 36, 9, 1, 0 },
{ 10, 45, 120, 210, 252, 210, 120, 45, 10, 1 },
};
var result = new BigInteger[10, 10];
for (var i = 0; i < 10; i++)
{
for (var j = 0; j < 10; j++)
{
result[i, j] = CommonFunctions.BinomialCoefficient(i + 1, j + 1);
}
}
Assert.AreEqual(value, result);
}
public static int Solution()
{
var counter = 0;
for (BigInteger n = 1; n <= 100; n++)
{
for (BigInteger k = 1; k <= n; k++)
{
var binomialCoefficient = CommonFunctions.BinomialCoefficient(n, k);
if (binomialCoefficient > 1_000_000)
{
counter++;
}
}
}
return(counter);
}
public static BigInteger Solution()
{
return(CommonFunctions.BinomialCoefficient(40, 20));
}