freeCodeCamp/problem-209-circular-logic.english.md at f247090895217636df6cd574aa3777a554983491

Files

Oliver Eyton-Williams bd68b70f3d Feat: hide blocks not challenges (#39504 )

* fix: remove isHidden flag from frontmatter

* fix: add isUpcomingChange

Co-authored-by: Ahmad Abdolsaheb <ahmad.abdolsaheb@gmail.com>

* feat: hide blocks not challenges

Co-authored-by: Ahmad Abdolsaheb <ahmad.abdolsaheb@gmail.com>

Co-authored-by: Ahmad Abdolsaheb <ahmad.abdolsaheb@gmail.com>

2020-09-03 15:07:40 -07:00

1.1 KiB

Raw Blame History

id, challengeType, title, forumTopicId

id	challengeType	title	forumTopicId
5900f43e1000cf542c50ff4f	5	Problem 209: Circular Logic	301850

Description

A k-input binary truth table is a map from k input bits (binary digits, 0 [false] or 1 [true]) to 1 output bit. For example, the 2-input binary truth tables for the logical AND and XOR functions are:

x y x AND y000010100111x y x XOR y000011101110How many 6-input binary truth tables, τ, satisfy the formula

τ(a, b, c, d, e, f) AND τ(b, c, d, e, f, a XOR (b AND c)) = 0 for all 6-bit inputs (a, b, c, d, e, f)?

Instructions

Tests

tests:
  - text: <code>euler209()</code> should return 15964587728784.
    testString: assert.strictEqual(euler209(), 15964587728784);

Challenge Seed

function euler209() {
  // Good luck!
  return true;
}

euler209();

Solution

// solution required

1.1 KiB Raw Blame History