g(n) = smallest integer such that g(n)*n! is a perfect square.

How should we go about finding if there's a pattern in that?

```
Plot of log(g(n)) versus n @jamestanton g(n) = smallest integer such that g(n)*n! is a perfect square. pic.twitter.com/tUvhiR0LjI
```

— Republic of Math (@republicofmath) October 18, 2014

## No comments:

## Post a Comment