Anonymous
Using named matching groups is often easier to understand than numbering groups but takes up more bytes. Given a regular expression as specified below, your program or function must convert named groups to numbered groups.
Task
These specifications are based on python 3's re module.
A named gr...
The redundant boolean
Classically, booleans are one bit; true or false, 1 or 0. Trailing zeros would just be redundant. For example, 001 means the same as 00001 or just 1.
The 32-bit boolean
Given a truthy/falsey value, output the equivalent 32-bit boolean.
Example i/o
Input >> Output
truthy >
Here is exercise 7.C.4 from A Book of Abstract Algebra by Charles C. Pinter
A is the set of all the real numbers x ≠0, 1, 2. G is the subgroup of SA generated by
f(x) = 2 - x
and
g(x) = 2/x
G has eight elements. List them, and write the table of G.
Solve this using a computer program.
...
Anonymous
7
So, there's a community consensus that functions from stack based languages can leave their output on the stack. This question is about an edge case for that. Suppose the correct result is some value x. Also suppose that that you are working with a stack based language that has an unlimited well ...
Functions in stack-based languages can leave the output on the stack
Mostly for completeness sake. This is the de-facto standard for CJam and GolfScript and probably other stack-based languages.
0
General rules
The universe of the Game of Life is an infinite two-dimensional orthogonal grid of square cells, each of which is in one of two possible states, alive or dead. Every cell interacts with its eight neighbours, which are the cells that are horizontally, vertically, or diagonally adjac...
A biquadratic number is a number that is the fourth power of another integer, for example: 3^4 = 3*3*3*3 = 81
Given an integer as input, output the closest biquadratic number.
Here are the first 15 double-squares:
1, 16, 81, 256, 625, 1296, 2401, 4096, 6561, 10000, 14641, 20736, 28561, 38416, ...
An order of primeness
code-golf primes sequence number-theory
Introduction
In a recent question the concepts of super-primes were explored. A super-prime is a prime whose index is also a prime.
2 is not a super-prime, it's index is 1
3 is a super-prime, it's index is 2
5 is a super-prime, it...
Version 2 coming soon.
Simple challenge: given an integer, draw a house of cards with the given number of stories. If the number is negative, draw the house upside-down. Examples:
Input: 2
Output:
/\
--
/\/\
Input: 5
Output:
/\
--
/\/\
----
/\/\/\
------
/\/\/\/\
--...
MY, 73 bytes
Here's the hex:
07 24 21 21 28 26
0A 24 21 28 26
0B 24 20 20 28 26
0B 24 20 20 28 26
0B 24 21 28 26
04 24 21 21 21 21 28 26
02 25 28 26
09 24 20 20 20 28 26
0B 24 21 28 26
07 25 21 21 28 26
0B 24 20 20 28 26
0A 24 28 26
02 25 21 28 26
I didn't want to update my old answer, becaus...
Monadic may refer to:
In logic and mathematics, a predicate, a relation or a function having an arity of one is called monadic
In category theory, an adjunction is called monadic if and only if it is equivalent to the adjunction given by the Eilenberg–Moore algebras of its associated monad
In chemistry, monadic is a synonym for univalent
== See also ==
All pages with a title containing Monadic
Monad (disambiguation)...
A number is a Chen prime if it satisfies two conditions:
It is prime itself
Itself plus two is either a prime or a semi-prime.
A prime is a number where it has exactly two divisors and those divisors consist of itself and one.
A semi-prime is a number which has exactly two prime factors.
Yo...
1
21
I'm from PPCG so I was making an esolang and I decided to write it in Python. Eventually it went from an esolang to an OEIS (Online Encyclopedia of Integer Sequences) lookup tool. I'm very new to Python.
Essentially this program takes an OEIS sequence number (e.g. 55 for sequence A000055) and t...
### INTRO ###
Let's say you write a passage and you are close to the end of the line wanting to write down a large word. In most languages, you just leave some blank and move to the next line, like a sir.
Example - English:
blah blah blah blah blah blah blah blah blah blah blah blah bl...
