56 lines
1.2 KiB
Markdown
56 lines
1.2 KiB
Markdown
---
|
|
id: 5900f43e1000cf542c50ff4f
|
|
challengeType: 5
|
|
title: 'Problem 209: Circular Logic'
|
|
videoUrl: ''
|
|
localeTitle: 'Problema 209: Lógica Circular'
|
|
---
|
|
|
|
## Description
|
|
<section id="description"> Una tabla de verdad binaria de entrada k es un mapa de k bits de entrada (dígitos binarios, 0 [falso] o 1 [verdadero]) a 1 bit de salida. Por ejemplo, las tablas de verdad binarias de 2 entradas para las funciones lógicas AND y XOR son: <p> x y x AND y000010100111x y x XOR y000011101110Cuántas tablas de verdad binarias de 6 entradas, τ, satisfacen la fórmula </p><p> τ (a, b, c, d, e, f) AND τ (b, c, d, e, f, a XOR (b AND c)) = 0 para todas las entradas de 6 bits (a, b, c, d, e, f)? </p></section>
|
|
|
|
## Instructions
|
|
<section id="instructions">
|
|
</section>
|
|
|
|
## Tests
|
|
<section id='tests'>
|
|
|
|
```yml
|
|
tests:
|
|
- text: <code>euler209()</code> debe devolver 15964587728784.
|
|
testString: 'assert.strictEqual(euler209(), 15964587728784, "<code>euler209()</code> should return 15964587728784.");'
|
|
|
|
```
|
|
|
|
</section>
|
|
|
|
## Challenge Seed
|
|
<section id='challengeSeed'>
|
|
|
|
<div id='js-seed'>
|
|
|
|
```js
|
|
function euler209() {
|
|
// Good luck!
|
|
return true;
|
|
}
|
|
|
|
euler209();
|
|
|
|
```
|
|
|
|
</div>
|
|
|
|
|
|
|
|
</section>
|
|
|
|
## Solution
|
|
<section id='solution'>
|
|
|
|
```js
|
|
// solution required
|
|
```
|
|
</section>
|