freeCodeCamp/problem-405-a-rectangular-tiling.english.md at 908adc2c372f2c1af0c8d1c80b264c23f96fd7d7

mrugesh 22afc2a0ca feat(learn): python certification projects (#38216 )

Co-authored-by: Oliver Eyton-Williams <ojeytonwilliams@gmail.com>
Co-authored-by: Kristofer Koishigawa <scissorsneedfoodtoo@gmail.com>
Co-authored-by: Beau Carnes <beaucarnes@gmail.com>

2020-05-27 13:19:08 +05:30

1.1 KiB

Raw Blame History

id, challengeType, isHidden, title, forumTopicId

id	challengeType	isHidden	title	forumTopicId
5900f5021000cf542c510014	5	false	Problem 405: A rectangular tiling	302073

Description

We wish to tile a rectangle whose length is twice its width. Let T(0) be the tiling consisting of a single rectangle. For n > 0, let T(n) be obtained from T(n-1) by replacing all tiles in the following manner:

The following animation demonstrates the tilings T(n) for n from 0 to 5:

Let f(n) be the number of points where four tiles meet in T(n). For example, f(1) = 0, f(4) = 82 and f(109) mod 177 = 126897180.

Find f(10k) for k = 1018, give your answer modulo 177.

Instructions

Tests

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

Challenge Seed

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

euler405();

Solution

// solution required

1.1 KiB Raw Blame History