# Categories

## hack-stack

### GSoC’18 log#06: Packing Up

This is GSoC’18 log#06. Here I will cover on what I have done in week #12-13. Link to the previous log. The work in these two weeks involved packaging and documenting the code.

### GSoC’18 log#05: Dynamic Simplification and Plotting

This is GSoC’18 log#05. Here I will cover on what I have done in week #10-11. Link to the previous log. The work during this period is mostly done in visma/gui.

### GSoC’18 log#04: Develop, Test, Repeat

This is GSoC log#04 (view log#03 here). Here I will cover on what I have done in week #08-09 and a gist of what has been accomplished in Phase II coding period and what is to be done in the final coding period.

### GSoC’18 log#03: Finding the Unknown

This is GSoC’18 log#03. Here I will cover on what I have done in week #06-07. Link to the previous log.

### GSoC’18 log#02: Integrating the Integrator

This is GSoC log#02 (view log#01 here). Here I will cover on what I have done in week #03-05 and a gist of what has been accomplished in Phase I coding period.

### GSoC’18 log#01: Making VisMa classy

I came across AerospaceResearch.net when browsing through GSoC organizations. It offered projects both in my field of interests and academic domain. I had to make a hard choice between DirectDemod and VisMa and I finally chose VisMa as my project for GSoC.

## geek-streak

### Solving the Cake Series

In the previous post about hypercake numbers, we obtained a recurrence relation for the hypercake number:

[c_{m,n} = c_{m,n-1} + c_{m-1,n-1}]

with $$c_{m,1} = 2$$ and $$c_{1,m} = m+1$$.

To move forward, some basic understanding of generating functions1 and binomial coefficients2 is required.