freeCodeCamp/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-282-the-ackermann-function.english.md
Valeriy 79d9012432 fix(curriculum): quotes in tests (#18828)
* fix(curriculum): tests quotes

* fix(curriculum): fill seed-teardown

* fix(curriculum): fix tests and remove unneeded seed-teardown
2018-10-20 23:32:47 +05:30

885 B

id, challengeType, title
id challengeType title
5900f4861000cf542c50ff99 5 Problem 282: The Ackermann function

Description

For non-negative integers m, n, the Ackermann function A(m, n) is defined as follows:

For example A(1, 0) = 2, A(2, 2) = 7 and A(3, 4) = 125.

Find A(n, n) and give your answer mod 148.

Instructions

Tests

tests:
  - text: <code>euler282()</code> should return 1098988351.
    testString: assert.strictEqual(euler282(), 1098988351, '<code>euler282()</code> should return 1098988351.');

Challenge Seed

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

euler282();

Solution

// solution required