# Comment

### Comments

Comments in green were written by me. Comments in blue were not written by me.

subscribe

Comments in green were written by me. Comments in blue were not written by me.

PhD thesis, chapter 5

PhD thesis, chapter 4

PhD thesis, chapter 3

Inverting a matrix

PhD thesis, chapter 2

Gaussian elimination

Matrix multiplication

Christmas (2019) is over

2017-12-24I can tell you that the number of combinations of n As and Bs which contain at at least one uninterrupted sequence of 3 As is 2^n - F3(n+3) where F3 is the fibonaccia variant adding 3 numbers (1,1,2,4,7,13,24 etc.).

Only took me about 8 hours (with some small help form OEIS for the 2 As problem)

on /blog/46