Here are some tasks that are ugly with [1:n] indexing:<p><pre><code>    - the 1D index of element (i,j) in a matrix is i+(j-1)*m instead of i+j*m

    - the i&#x27;th 3-element subvector of a vector is v[3*(i-1)+1:3*i] 
      instead of v[3*i:3*(i+1)]

    - if you have vector of indices that partitions an vector into chunks,
      the i&#x27;th chunk is v[ind[i]:ind[i+1]-1] instead of v[ind[i]:ind[i+1]]
</code></pre>
Perhaps small issues, but these are all real examples from my most recent Matlab project that were annoying.<p>But maybe, like the static typing issue, my opinion on this topic is distorted because I spent a lot of time programming in C++ and comparatively little time reading math papers.<p>Or maybe it would be equally easy to make a list of tasks that are ugly with [0:n) indexing.