Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I defined a function in Mathematica. It is a function of n, so f[n_]:=, but in the definition, I used a sum, $\sum_{k=0}^n$. So, the $k$ is just an index variable for the sum and no $k$ shows up in the final answer. As I was using this function I tried evaluating f[k-1] and got a weird answer, 0. I finally figured out that Mathematica was trying to do the sum $\sum_{k=0}^{k-1}$, or so I guess. So, my question is, is there a way to make the $k$ local so that this error never occurs? My fix for now was to change $k$ to $index$ and I will probably not use f[index] at any point.

share|cite|improve this question
I tried to reproduce your result, but no luck. Could you post your function? What version are you using? – Calle Mar 24 '11 at 21:29
Just about anything will do... g[n_]:=$\sum_{k=0}^n \binom{n}{k}$ and then g[k-1] will yield 0 in Version 7. – Graphth Mar 24 '11 at 21:45
Huh, yeah. In version 8 too. But g[n_]:= $\sum_{k=0}^n k^2$ works fine. – Calle Mar 24 '11 at 21:52
@Numth @Calle @whuber: Mathematica make the summation index local using Block. In this way $k$ has a local value for the Sum function. However, $k$ is still $k$ so that g[k-1] translates into Sum[Binomial[k-1,k],{k,0,k-1}] which will evaluate to 0 (because Binomial[k-1,k]=0). What you want is that the summation index gets a different name and therefore you need Module. With Module the g[k-1] is effectively translated into Sum[Binomial[k-1,k$],{k$,0,k-1}]. – Fabian Mar 24 '11 at 22:32
@Numth Thank you. I double-checked and was able to reproduce your results. (a) After quitting all kernels and re-evaluating the definition of g, I obtain zero for g[k-1]. (b) After issuing Remove[k], I get the correct result. (c) Protecting g with either Block or Module makes it work correctly. Clearly, then, the help statement is not entirely correct. – whuber Mar 25 '11 at 2:52
up vote 5 down vote accepted

The function you are looking for is called Module. So you can define f[n_]:=Module[{k},Sum[a[k],{k,0,n}] and then the evaluation f[k-1] is possible.

share|cite|improve this answer
That is perfect, thanks! – Graphth Mar 24 '11 at 21:35

Block might be better than Module -- when you use recursion, a local variable defined in Module will be shared across stack frames, Block will have a separate version of the variable in each call

share|cite|improve this answer
@Bulatov: but Block will not work for the OP's problem... – Fabian Mar 25 '11 at 5:50
@Fabian Why not? I tried your snippet in Mathematica 8 and replacing Module with Block makes no difference – Yaroslav Bulatov Mar 25 '11 at 17:31
defining g[n_]:=Block[{k},Sum[Binomial[n,k],{k,0,n}] and then executing g[k-1] gives a result different from 0? (then they must have changed something going to version 8) – Fabian Mar 25 '11 at 18:22
@Fabian I was too hasty, you are right, it doesn't work for that example, another approach might be to use Unique – Yaroslav Bulatov Mar 25 '11 at 19:49

An alternative to Module or Block is to use Formal Symbols. This allows for the cleanest code.

One may still run into trouble depending on how you choose to use Formal symbols elsewhere, but if you never use \[FormalK] in the argument to f you are safe.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.