I'm really impressed with Julia since it ran faster than D on a processor intensive Euler Project question. #303 if anyone is interested.

What's weird is how slow BigInts in Julia seems to be. Strange because I read their performance is quite good.

The following is a Julia program to calculate the number of partitions of 15k using Euler's recurrence formula.

```
function eu78()
  lim = 15000
  ps = zeros(BigInt, lim)

  function p(n)  #applies Euler recurrence formula
    if n < 0
      return BigInt(0)
    elseif n == 0
      return BigInt(1)
    elseif ps[n] > 0
      return ps[n]
    end
    s = BigInt(0)
    f = BigInt(-1)
    for k = 1 : n
      f *= -1
      t1 = (k * (3k - 1)) ÷ BigInt(2)
      t2 = (k * (3k + 1)) ÷ 2
      s += f * (p(n - t1) + p(n - t2))
    end
    ps[n] = s
  end

  for i = 1 : lim
    p(i)
  end
  println(ps[lim])
end

eu78()

```

Runs in a whopping 3min43sec to generate the 132 digit answer.

The equivalent Python code run with pypy takes a mere 8 seconds.

What am I doing wrong?