2018-09-30 22:01:58 +00:00
---
id: 5900f4861000cf542c50ff98
challengeType: 5
title: 'Problem 281: Pizza Toppings'
---
## Description
< section id = 'description' >
You are given a pizza (perfect circle) that has been cut into m·n equal pieces and you want to have exactly one topping on each slice.
2018-10-08 00:01:53 +00:00
Let f(m,n) denote the number of ways you can have toppings on the pizza with m different toppings (m ≥ 2), using each topping on exactly n slices (n ≥ 1). Reflections are considered distinct, rotations are not.
2018-09-30 22:01:58 +00:00
Thus, for instance, f(2,1) = 1, f(2,2) = f(3,1) = 2 and f(3,2) = 16. f(3,2) is shown below:
Find the sum of all f(m,n) such that f(m,n) ≤ 1015.
< / section >
## Instructions
< section id = 'instructions' >
< / section >
## Tests
< section id = 'tests' >
```yml
2018-10-04 13:37:37 +00:00
tests:
- text: < code > euler281()</ code > should return 1485776387445623.
2018-10-08 00:01:53 +00:00
testString: 'assert.strictEqual(euler281(), 1485776387445623, "< code > euler281()< / code > should return 1485776387445623.");'
2018-09-30 22:01:58 +00:00
```
< / section >
## Challenge Seed
< section id = 'challengeSeed' >
< div id = 'js-seed' >
```js
function euler281() {
// Good luck!
return true;
}
euler281();
```
< / div >
< / section >
## Solution
< section id = 'solution' >
```js
// solution required
```
< / section >