# Genesis

### Estimated reading time of 3 min.

This is the first post of my blog, where I can test new features.

### Math

Math display works:

\begin{align} \nabla \cdot \textbf{E} &= \frac{\rho}{\epsilon_0} \\ \nabla \cdot \textbf{B} &= 0 \\ \nabla \times \textbf{E} &= -\frac{\partial \textbf{B}}{\partial t} \\ \nabla \times \textbf{B} &= \mu_0 \left( \textbf{J} + \epsilon_0 \frac{\partial \textbf{E}}{\partial t} \right) \\ \frac{\partial \rho}{\partial t} + \nabla \cdot \textbf{J} &= 0 \end{align}

### Code

Code blocks also work, including syntax highlighting:

-- Haskell
fib :: Integer -> Integer
fib 0 = 0
fib 1 = 1
fib n = fib (n - 1) + fib (n - 2)
# Python
def fib(n):
i, j = 0, 1
for _ in range(n):
yield i
i, j = j, i + j

### Quotes

The number of bins (of size 1) is one larger than the largest value in x. If minlength is specified, there will be at least this number of bins in the output array (though it will be longer if necessary, depending on the contents of x).

• NumPy documentation for bincount