3
Given a relation, and a domain, output whether the relation is an equivalence relation.
Context
For this challenge, a relation is defined as being a set of ordered pairs that is a subset of the cartesian product of a domain with itself. That is, \$R \subset X \times X\$.
For a relation \$R\$ to b...
398. GeoGebra, 176 bytes, A000498
inputVariable = 0
InputBox( inputVariable )
Sum( nCr( inputVariable + 5 , k0 ) * ( -1 ) ^ k0 * ( inputVariable + 1 - k0 ) ^ ( inputVariable + 4 ) , k0 , 0 , inputVariable + 1 )
Takes input through the input box.
Try It On GeoGebra!
Next Sequence!
Prolog (SWI), 58 bytes
f(<,A,B):-A mod 2>B mod 2.
f(>,_,_).
A+S:-predsort(f,A,S).
Try it online!
The Möbius Function
The Möbius function is an important number theoretic function.
Your submission should accept a positive integer n and return the value of the Möbius function evaluated at n.
Definition
The Möbius function μ(n) is defined as follows:
| 1 if n is squarefree and has an ev...
Compute the Fabius function
The Fabius function is an example of a function which is nowhere analytic, despite being infinitely differentiable.
more text later
40
In software engineering, rubber duck debugging (or rubberducking) is a method of debugging code by articulating a problem in spoken or written natural language. The name is a reference to a story in the book The Pragmatic Programmer in which a programmer would carry around a rubber duck and debug their code by forcing themselves to explain it, line-by-line, to the duck. Many other terms exist for this technique, often involving different (usually) inanimate objects, or pets such as a dog or a cat.
Many programmers have had the experience of explaining a problem to someone else, possibly even to...
19
In this challenge you will take two lists as input and you will zip them. The zip can be defined with this recursive expression:
\$
\mathrm{zip}(a,b) = \begin{cases}
\left[\,\,\right] & a = \left[\,\,\right] \\
[a_0]\mid\mid\mathrm{zip}(b, t) & a = [a_0] \mid\mid t
\end{cases}
\$
or this Haskell...
