freeCodeCamp/problem-282-the-ackermann-function.english.md at ef79ddd0de35a4e10b8b4588e67938f86d2bae10

Files

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

870 B

Raw Blame History

id, challengeType, isHidden, title, forumTopicId

id	challengeType	isHidden	title	forumTopicId
5900f4861000cf542c50ff99	5	false	Problem 282: The Ackermann function	301933

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);

Challenge Seed

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

euler282();

Solution

// solution required

870 B Raw Blame History