---
id: 5900f5411000cf542c510054
challengeType: 5
title: 'Problem 468: Smooth divisors of binomial coefficients'
videoUrl: ''
localeTitle: 'Problema 468: divisores suaves de coeficientes binomiales'
---

## Description
<section id="description"> Un entero se llama B-suave si ninguno de sus factores primos es mayor que B. <p> Sea SB (n) el divisor B-smooth más grande de n. Ejemplos: S1 (10) = 1 S4 (2100) = 12 S17 (2496144) = 5712 </p><p> Defina F (n) = ∑1≤B≤n ∑0≤r≤n SB (C (n, r)). Aquí, C (n, r) denota el coeficiente binomial. Ejemplos: F (11) = 3132 F (1 111) mod 1 000 000 993 = 706036312 F (111 111) mod 1 000 000 993 = 22156169 </p><p> Encontrar F (11 111 111) mod 1 000 000 993. </p></section>

## Instructions
<section id="instructions">
</section>

## Tests
<section id='tests'>

```yml
tests:
  - text: <code>euler468()</code> debe devolver 852950321.
    testString: 'assert.strictEqual(euler468(), 852950321, "<code>euler468()</code> should return 852950321.");'

```

</section>

## Challenge Seed
<section id='challengeSeed'>

<div id='js-seed'>

```js
function euler468() {
  // Good luck!
  return true;
}

euler468();

```

</div>



</section>

## Solution
<section id='solution'>

```js
// solution required
```
</section>