Language-creation has become a popular activity on PPCG. A decent portion of answers, especially code-golf answers, are written in languages invented by the community. These are also languages that might be unfamiliar to this site's wider viewing audience.
What languages (esoteric, golfing, or...
Problem Given N 3-dimensional points S = [(xi,yi,zi):1<=i<=n] . I have to find the value of the formula
all numbers are between 1 and M ( = 100).
I need an efficient method for the reduction of this formula to something which is easy to calculate.
So far, I have recognized that the above ex...
In this challenge, we will together create a word-search containing many programs in different languages.
I have started us off with a grid of 60-by-25 blanks (·), some of which are replaced by the characters of a Ruby program.
To answer, choose a language that was not yet used. Using your chos...
2
Background
You are working as a programmer for a car sales company.
Your task for this week is to program an XML parser that takes in data about available models from different car manufacturers, and pretty-prints information about the newest models.
Luckily for you, the testing department has p...
Let $n = p_1^{e_1} p_2^{e_2} \cdots p_k^{e_k}$ an integer with $p_i$ prime and $e_i \in \mathbb N$. The prime factorization can assumed to be known, i.e. we already know $p_1,\ldots,p_k$ and $e_1 , \ldots e_k$.
Is it possible to find the number of factorizations of length $m$ of the form
$n = ...
