Foo

Foo

Lorem post cenam in silva ambulavit.

Tabset demo

Julia

function isprime(n::Integer)
    if n <= 1
        return false
    elseif n <= 3
        return true
    elseif n % 2 == 0 || n % 3 == 0
        return false
    end
    i = 5
    while i <= isqrt(n)
        if n % i == 0 || n % (i + 2) == 0
            return false
        end
        i += 6
    end
    return true
end

Python

def is_prime(n: int) -> bool:
    if n <= 1:
        return False
    elif n <= 3:
        return True
    elif n % 2 == 0 or n % 3 == 0:
        return False
    i = 5
    while i * i <= n:
        if n % i == 0 or n % (i + 2) == 0:
            return False
        i += 6
    return True

Some equations

\[ e^{i \pi} = -1 \]

\[ \int_M \mathrm{d}\omega = \int_{\partial M} \omega \]

\[ G_{\mu \nu} = 8 \pi T_{\mu \nu} \]

Lightbox demo