Abusing native number types to trivialize a problem
It is common practice to restrict challenges to cases where input, output and/or intermediate values of the algorithm of choice fit into the language's native number type. At least for input and output, this is generally assumed even if not sta...
Let $F(n)$ denotes the $n$th number in Fibonacci sequence. Then for all $n\in\mathbb{N}$,
$$F(n)^2+F(n+1)^2=F(2n+1).$$
I know how to prove it by using the formula
$$F(n)=\frac{\left(\frac{1+\sqrt5}{2}\right)^n-\left(\frac{1-\sqrt5}{2}\right)^n}{\sqrt{5}},$$
but is there a way to prove it...
Define a function that, when given any input, will error. Defining the function itself should not cause an error.
An ungolfed Python example is:
def error(x):
return [][x]
# or
lambda x: [][x]
Shortest answer wins.
Your task is to create a program or function which randomly errors. Specifically, there must be a nonzero probability of erroring, but also a nonzero probability of running without error.
An error is anything that causes a program to terminate abnormally, such as dividing by zero or using an uni...
