Tasks not implemented in Racket
- ADFGVX cipher
- AVL tree
- Abelian sandpile model
- Abelian sandpile model/Identity
- Achilles numbers
- Active Directory/Search for a user
- Add a variable to a class instance at runtime
- Almkvist-Giullera formula for pi
- Anadromes
- Anagram generator
- Arithmetic derivative
- Arithmetic numbers
- Ascending primes
- Babylonian spiral
- Bernstein basis polynomials
- Bifid cipher
- Bioinformatics/Global alignment
- Biorhythms
- Blum integer
- Boustrophedon transform
- Boyer-Moore string search
- Break OO privacy
- Brilliant numbers
- Burrows–Wheeler transform
- Bézier curves/Intersections
- Calkin-Wilf sequence
- Canny edge detector
- Canonicalize CIDR
- Catmull–Clark subdivision surface
- Centre and radius of a circle passing through 3 points in a plane
- Chaocipher
- Check if a polygon overlaps with a rectangle
- Check if two polygons overlap
- Chernick's Carmichael numbers
- Circular primes
- Cistercian numerals
- Colorful numbers
- Compare sorting algorithms' performance
- Compiler/AST interpreter
- Compiler/code generator
- Compiler/syntax analyzer
- Composite numbers k with no single digit factors whose factors are all substrings of k
- Consecutive primes with ascending or descending differences
- Continued fraction/Arithmetic/G(matrix ng, continued fraction n1, continued fraction n2)
- Cullen and Woodall numbers
- Curzon numbers
- Cycles of a permutation
- Cyclops numbers
- Cyclotomic polynomial
- De Polignac numbers
- Deceptive numbers
- Deconvolution/2D+
- Decorate-sort-undecorate idiom
- Descending primes
- Disarium numbers
- Display an outline as a nested table
- Distance and Bearing
- Distribution of 0 digits in factorial series
- Dominoes
- Doomsday rule
- Duffinian numbers
- EKG sequence convergence
- Earliest difference between prime gaps
- Eban numbers
- Elliptic Curve Digital Signature Algorithm
- Equal prime and composite sums
- Erdös-Selfridge categorization of primes
- Erdős-Nicolas numbers
- Esthetic numbers
- Euclid-Mullin sequence
- Euclidean rhythm
- Execute Computer/Zero
- Exponentiation with infix operators in (or operating on) the base
- Faces from a mesh
- Factorial base numbers indexing permutations of a collection
- Factorize string into Lyndon words
- Fermat numbers
- Fermat pseudoprimes
- Find Chess960 starting position identifier
- First perfect square in base n with n unique digits
- Fixed length records
- Fortunate numbers
- Four is the number of letters in the ...
- French Republican calendar
- GSTrans string conversion
- Gapful numbers
- Gaussian primes
- Generate random chess position
- Giuga numbers
- Go Fish
- Goldbach's comet
- Golden ratio/Convergence
- Gotchas
- Graph colouring
- Greatest prime dividing the n-th cubefree number
- Halt and catch fire
- Harmonic series
- Hex words
- Home primes
- Honaker primes
- I'm a software engineer, get me out of here
- Idoneal numbers
- Imaginary base numbers
- Inconsummate numbers in base 10
- Increasing gaps between consecutive Niven numbers
- Intersecting number wheels
- Isograms and heterograms
- Jacobi symbol
- Jacobsthal numbers
- Jaro-Winkler distance
- Jordan-Pólya numbers
- Joystick position
- Juggler sequence
- Klarner-Rado sequence
- Kolakoski sequence
- Kronecker product based fractals
- Lah numbers
- Largest number divisible by its digits
- Largest proper divisor of n
- Latin Squares in reduced form
- Law of cosines - triples
- Legendre prime counting function
- Logistic curve fitting in epidemiology
- Long literals, with continuations
- Long year
- Loops/With multiple ranges
- Lucky and even lucky numbers
- Lyndon word
- Magic constant
- Magic squares of doubly even order
- Magic squares of singly even order
- Magnanimous numbers
- Mastermind
- Mayan calendar
- Mayan numerals
- Meissel–Mertens constant
- Merge and aggregate datasets
- Mertens function
- Metallic ratios
- Mian-Chowla sequence
- Mind boggling card trick
- Minimal steps down to 1
- Minimum multiple of m where digital sum equals m
- Minimum positive multiple in base 10 using only 0 and 1
- Minkowski question-mark function
- Modified random distribution
- Monads/Writer monad
- Motzkin numbers
- Multi-base primes
- Möbius function
- N-smooth numbers
- Next highest int from digits
- Non-transitive dice
- Numbers k such that the last letter of k is the same as the first letter of k+1
- Numbers which are not the sum of distinct squares
- Numbers which are the cube roots of the product of their proper divisors
- Numbers with equal rises and falls
- Numerical and alphabetical suffixes
- OLE automation
- Order by pair comparisons
- Ormiston triples
- Own digits power sum
- P-Adic numbers, basic
- P-Adic square roots
- P-value correction
- Padovan n-step number sequences
- Padovan sequence
- Pairs with common factors
- Palindrome dates
- Palindromic gapful numbers
- Pan base non-primes
- Pancake numbers
- Particle fountain
- Peaceful chess queen armies
- Pell numbers
- Pell's equation
- Penta-power prime seeds
- Periodic table
- Peripheral drift illusion
- Pierpont primes
- Pisano period
- Playfair cipher
- Primality by Wilson's theorem
- Prime numbers whose neighboring pairs are tetraprimes
- Prime triangle
- Primes: n*2^m+1
- Product of min and max prime factors
- Pseudo-random numbers/Combined recursive generator MRG32k3a
- Pseudo-random numbers/Middle-square method
- Pseudo-random numbers/PCG32
- Pseudo-random numbers/Splitmix64
- Pseudo-random numbers/Xorshift star
- Quad-power prime seeds
- Quoting constructs
- Radical of an integer
- Ramanujan primes/twins
- Ramanujan's constant
- Random Latin squares
- Random sentence from book
- Recaman's sequence
- Reflection/Get source
- Reflection/List methods
- Reflection/List properties
- Repunit primes
- Rhonda numbers
- Riordan numbers
- Round-robin tournament schedule
- Ruth-Aaron numbers
- SHA-256 Merkle tree
- SOAP
- Safe primes and unsafe primes
- Search in paragraph's text
- Selectively replace multiple instances of a character within a string
- Self numbers
- Sequence: nth number with exactly n divisors
- Sequence: smallest number greater than previous term with exactly n divisors
- Sequence: smallest number with exactly n divisors
- Set right-adjacent bits
- Set, the card game
- Sexy primes
- Sierpinski arrowhead curve
- Sierpinski square curve
- Sieve of Pritchard
- Simple turtle graphics
- Singular value decomposition
- Sisyphus sequence
- Sleeping Beauty problem
- Smallest number k such that k+2^m is composite for all m less than k
- Smarandache prime-digital sequence
- Smarandache-Wellin primes
- Snake
- Soloway's recurring rainfall
- Sorensen–Dice coefficient
- Sort an outline at every level
- Sorting algorithms/Cocktail sort with shifting bounds
- Spelling of ordinal numbers
- Sphenic numbers
- Square form factorization
- Steffensen's method
- Stirling numbers of the first kind
- Stirling numbers of the second kind
- Strassen's algorithm
- Strong and weak primes
- Sub-unit squares
- Successive prime differences
- Sudan function
- Suffixation of decimal numbers
- Sum of elements below main diagonal of matrix
- Summarize primes
- Super-Poulet numbers
- Super-d numbers
- Sylvester's sequence
- Teacup rim text
- The Name Game
- Transliterate English text using the Greek alphabet
- Tree datastructures
- Tree from nesting levels
- Tropical algebra overloading
- Tupper's self-referential formula
- Twin primes
- Two bullet roulette
- Two's complement
- Ukkonen’s suffix tree construction
- Ultra useful primes
- Undulating numbers
- Universal Lambda Machine
- Untouchable numbers
- Variable declaration reset
- Variadic fixed-point combinator
- Verhoeff algorithm
- Video display modes
- Wagstaff primes
- Wasteful, equidigital and frugal numbers
- Word wheel
- Wordiff
- Wordle comparison
- Zsigmondy numbers