This is a rather common inquiry in contests that require computing elements of a sequence.
For example, consider the following recursive implementation of the factorial function (Python):
f = lambda n:n<1or n*f(n-1)
This works well for all positive n; f(n) returns the required result as an in...
Python 2, 30 bytes
f=lambda n:n<3or f(n-2)+f(n-1)
Try it online!
One catch: this outputs True instead of 1. This is allowed by this meta consensus.
Complex Dice Rolling Expressions code-golf random parsing string
Background
I play D&D on a regular basis with some friends. While talking about the complexity of some systems/versions when it comes to rolling dice and applying bonuses and penalties, we jokingly came up with some additional com...
Taxi, 7394 bytes
Go to the Post Office:w 1 l 1 r 1 l.Pickup a passenger going to The Babelfishery.Pickup a passenger going to The Babelfishery.Go to The Babelfishery:s 1 l 1 r.Pickup a passenger going to Cyclone.Go to Cyclone:n 5 l 2 l.Pickup a passenger going to Bird's Bench.Pickup a passenger ...
Rank Correlation Coefficient
The usual correlation coefficient (in 2d) measures how well a set of points can be described by a line, and if yes, its sign tells us whether we have a positive or negative correlation. But this assumes that coordinates of the points can actually interpreted quantita...
