The purpose of this challenge is to find the general term of a given arithmetic or geometric sequence.
Explanation
The formula for an arithmetic sequence is as follows
an = a1 + (n-1)d
where a1 is the first term of the sequence, n is the index of the term, and d is the common difference betw...
Introduction
In the field of mathematics known as topology, there are things called separation axioms.
Intuitively, you have a set X and a collection of subsets of X, which we can think of as properties.
The system is well separated, if one can distinguish between all items of X based on their p...
Given an input of four integers x1, y1,
x2, and y2, output whether a white king in chess
(with coordinates (x1, y1)) could catch a black pawn
(with coordinates (x2, y2)) and capture it if the
pawn is moving to promote to a queen as fast as possible.
The coordinates of the board are as follows:...
It seems I missed a flag party. To whomever thinks it's fun to flag: Note that abuse of chat flags is cause for a lengthy suspension. Flags are for serious issues only.
@Doorknob I'm assuming yes but just to double check: does the pawn have to move every turn? (As in, we can't assume some black king which we move instead)
Matches-like Clock Puzzle
code-golf
Given a valid time on a 12-hour digital clock, output the digit that requires moving the fewest lines to make it so every visible digit on the clock becomes that digit. If more than one digit is the minimum, output them all. If it is impossible to make every ...
@Sp3000 It wouldn't even matter becuase "both players play optimally (the king will move as fast as possible to catch the pawn, and the pawn will move as fast as possible to promote)."