# Project Euler Problem 440 – GCD and Tiling

- October 26, 2013
- project euler
- math project euler
- no comments

#### Table of Contents

**Spoiler Alert!** This blog entry contains content that might help you solve problem 440 of Project Euler. Please don’t read any further if you have yet to attempt to solve the problem on your own. The information is intended for those who failed to solve the problem and are looking for hints. It is posted not before the problem has a hundred solvers already.

## Test Data

```
<td>
184312344
</td>
```

```
<td>
246963623
</td>
```

```
<td>
10610040
</td>
```

```
<td>
560367075
</td>
```

T(99) mod 987898789 |

T(12345678910101213) mod 987898789 |

gcd(T(7^{3}), T(7^{11})) mod 987898789 |

$\sum_{a=1}^{2000}\sum_{b=1}^{2000} \text{gcd}(T(1848^a),T(1848^b))$ mod 987898789 |