freeCodeCamp/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-282-the-ackermann-function.english.md

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

## Description
<section id='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.
</section>

## Instructions
<section id='instructions'>

</section>

## Tests
<section id='tests'>

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

```

</section>

## Challenge Seed
<section id='challengeSeed'>

<div id='js-seed'>

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

euler282();
```

</div>



</section>

## Solution
<section id='solution'>

```js
// solution required
```
</section>