0
Euclidean algorithm is an algorithm that produces the greatest common divisor of two integers. It was described by Euclid as early as in 300 BC.
On the other hand, the extended Euclidean algorithm extends his algorithm to express the greatest common divisor as an integer-linear combination of th...
I just got 2 back-to-back 30-minute suspensions for "inappropriate content" for using the F-word. I usually don't use that word that often but for whatever reason people felt the need to bad me for it. The two messages were approximately:
fireworks are legitimately an invention from hell. peo...
In mathematics, a continued fraction is an expression obtained through an iterative process of representing a number as the sum of its integer part and the reciprocal of another number, then writing this other number as the sum of its integer part and another reciprocal, and so on. In a finite continued fraction (or terminated continued fraction), the iteration/recursion is terminated after finitely many steps by using an integer in lieu of another continued fraction. In contrast, an infinite continued fraction is an infinite expression. In either case, all integers in the sequence, other than...
In mathematics, the Lindström–Gessel–Viennot lemma provides a way to count the number of tuples of non-intersecting lattice paths.
== Statement ==
Let G be a locally finite directed acyclic graph. This means that each vertex has finite degree, and that G contains no directed cycles. Consider base vertices
A
=
{
a
1
,
…
,
a
n
}
{\displaystyle A=\{a_{1},\ldots ,a_{n}\}}
and destination...
We can compute this with an application of Lindström-Gessel-Viennot's lemma.
Let $a_1, a_2$ be two sources and $b_1, b_2$ be two sinks. Note that each path has a distinct source and a distinct sink, roughly illustrated here:
This is because the top path must always start with an UP and end wi...
I am a robot. I bought this keyboard because of its easy rectangular layout:
~` !1 @2 #3 $4 %5 ^6 &7 *8 (9 )0 _- +=
tab Qq Ww Ee Rr Tt Yy Uu Ii Oo Pp {[ }] \|
Aa Ss Dd Ff Gg Hh Jj Kk Ll :; "' [-enter-]
Zz Xx...
Meta note: This is similar to my Rotonyms 1 challenge applying a different transformation to the words (circular rotation instead of ROT13)
Rotonyms 2
A "Rotonym" is a word that ROT13s into another word (in the same language).
For this challenge, we'll use an alternate definition: a "Rotony...
Sum of replicated matrices
Tags: code-golf, math, matrix
Given a list of numbers [ a1 a2 ... an ], compute the sum of all the matrices Aᵢ where Aᵢ is defined as follows (m is the maximum of all aᵢ):
1 2 ⋯ aᵢ₋₁ aᵢ aᵢ₊₁ ⋯ n
+--------------------------
1 | 0 0 ⋯ 0 aᵢ aᵢ ...
