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

---
id: 5900f4861000cf542c50ff99
title: 'Problem 282: The Ackermann function'
challengeType: 5
forumTopicId: 301933
dashedName: 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.

# --hints--

`euler282()` should return 1098988351.

```js
assert.strictEqual(euler282(), 1098988351);
```

# --seed--

## --seed-contents--

```js
function euler282() {

  return true;
}

euler282();
```

# --solutions--

```js
// solution required
```