# Reports:Tasks not implemented in Racket

**Awareness**

If

**Racket**is a language you like, or are interested in, please inform your fellow members of the Racket community; this page can't be emptied without your and their participation.

## Contents

## Not implemented[edit]

These are currently not implemented in Racket. Please implement some if you can. If any tasks are not possible or too complex in Racket, they should not be on this list. To mark a task as such, add **{{omit from|Racket}}**, preserving the capitalization of the language, to that task. It will appear below under the "Not Considered" section.

### A

### C

- Calkin-Wilf sequence
- Canny edge detector
- Canonicalize CIDR
- Catmull–Clark subdivision surface
- Chaocipher
- Chernick's Carmichael numbers
- Circular primes
- Cistercian numerals
- Compare sorting algorithms' performance
- Compiler/AST interpreter
- Compiler/code generator
- Compiler/syntax analyzer
- Compiler/virtual machine interpreter
- Consecutive primes with ascending or descending dfferences
- Cyclotomic polynomial

### E

### F

### I

### L

- Lah numbers
- Largest number divisible by its digits
- Largest proper divisor of n
- Latin Squares in reduced form
- Latin Squares in reduced form/Randomizing using Jacobson and Matthews’ Technique
- Law of cosines - triples
- Legendre prime counting function
- Long literals, with continuations
- Long year
- Loops/With multiple ranges
- Lucky and even lucky numbers

### M

- Magic squares of doubly even order
- Magic squares of singly even order
- Magnanimous numbers
- Mastermind
- Mayan calendar
- Mayan numerals
- Merge and aggregate datasets
- Mertens function
- Metallic ratios
- Mian-Chowla sequence
- Mind boggling card trick
- Minimal steps down to 1
- Minimum positive multiple in base 10 using only 0 and 1
- Minkowski question-mark function
- Modified random distribution
- Monads/Writer monad
- Motzkin numbers
- Möbius function

### N

### P

- P-Adic numbers, basic
- P-Adic square roots
- P-value correction
- Padovan n-step number sequences
- Padovan sequence
- Palindrome dates
- Palindromic gapful numbers
- Pancake numbers
- Partition function P
- Peaceful chess queen armies
- Pell's equation
- Permutations/Rank of a permutation
- Pierpont primes
- Pisano period
- Playfair cipher
- Primality by Wilson's theorem
- Pseudo-random numbers/Combined recursive generator MRG32k3a
- Pseudo-random numbers/PCG32
- Pseudo-random numbers/Splitmix64
- Pseudo-random numbers/Xorshift star

### R

### S

- SHA-256 Merkle tree
- SOAP
- Safe primes and unsafe primes
- 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
- Sexy primes
- Sierpinski arrowhead curve
- Sierpinski square curve
- Sleeping Beauty problem
- Smarandache prime-digital sequence
- Sort an outline at every level
- Sorting algorithms/Cocktail sort with shifting bounds
- Spelling of ordinal numbers
- Square form factorization
- Stirling numbers of the first kind
- Stirling numbers of the second kind
- Strassen's algorithm
- Strong and weak primes
- Successive prime differences
- Suffixation of decimal numbers
- Summarize primes
- Super-d numbers
- Sylvester's sequence

### T

### Draft tasks without implementation[edit]

These tasks are drafts, meaning they largely need more work to turn them into full tasks. Perhaps you can help by trying to implement them in Racket (after all, one of the key requirements for a task being non-draft is multiple implementations, preferably in widely different languages) but be aware that this may be difficult because of lack of definition of the task itself.

### A

### B

### C

- CLI-based maze-game
- Change e letters to i in words
- Changeable words
- Checksumcolor
- Chess player
- Combinations with repetitions/Square digit chain
- Common list elements
- Common sorted list
- Compiler/Simple file inclusion pre processor
- Compiler/Verifying syntax
- Concatenate two primes is also prime
- Conjugate a Latin Verb
- Continued fraction/Arithmetic/G(matrix ng, continued fraction n1, continued fraction n2)
- Coprime triplets
- Count how many vowels and consonants occur in a string
- Count the coins/0-1
- Cousin primes
- Cubic Special Primes
- Curve that touches three points
- Cyclops numbers

### D

### F

### G

### L

### M

### N

- N-body problem
- Neighbour primes
- Next special primes
- Nice primes
- Number triplets game
- Numbers divisible by their individual digits, but not by the product of their digits.
- Numbers in base-16 representation that cannot be written with decimal digits
- Numbers in base 10 that are palindromic in bases 2, 4, and 16
- Numbers which binary and ternary digit sum are prime
- Numbers whose count of divisors is prime
- Numbers with prime digits whose sum is 13
- Numbers with same digit set in base 10 and base 16
- Numerical integration/Adaptive Simpson's method

### P

- Palindromic primes
- Palindromic primes in base 16
- Pandigital prime
- Parse EBNF
- Particle fountain
- Peripheral drift illusion
- Permutations with some identical elements
- Permuted multiples
- Piprimes
- Positive decimal integers with the digit 1 occurring exactly twice
- Powerful numbers
- Practical numbers
- Price list behind API
- Prime numbers p which sum of prime numbers less or equal to p is prime
- Prime numbers which contain 123
- Prime triplets
- Prime words
- Primes which contain only one odd digit
- Primes whose first and last number is 3
- Primes whose sum of digits is 25
- Primes with digits in nondecreasing order
- Print itself
- Process SMIL directives in XML data
- Product of divisors
- Pseudorandom number generator image

### R

- Ramanujan primes
- Range modifications
- Raster bars
- Recursive descent parser generator
- Remote agent/Agent interface
- Remote agent/Agent logic
- Remote agent/Simulation
- Remove vowels from a string
- Resistance calculator
- Resistance network calculator
- Reverse the order of lines in a text file while preserving the contents of each line
- Robots
- Rosetta Code/List authors of task descriptions
- Rosetta Code/Run examples
- Rosetta Code/Tasks without examples

### S

- Safe mode
- Self-hosting compiler
- Shift list elements to left by 3
- Show the (decimal) value of a number of 1s appended with a 3, then squared
- Sierpinski curve
- Simple turtle graphics
- Smallest enclosing circle problem
- Smallest numbers
- Smallest power of 6 whose decimal expansion contains n
- Smallest square that begins with n
- Snake
- Solve a Rubik's Cube
- Solving coin problems
- Sort the letters of string in alphabetical order
- Special Divisors
- Special factorials
- Special neighbor primes
- Special pythagorean triplet
- Spoof game
- Square root by hand
- Strange numbers
- Strange plus numbers
- Strange unique prime triplets
- Substring primes
- Sum data type
- Sum of divisors
- Sum of elements below main diagonal of matrix
- Sum of first n cubes
- Sum of primes in odd positions is prime
- Sum of the digits of n is substring of n

### T

### U

### V

### W

## Requiring Attention[edit]

### Examples[edit]

These tasks have implementations in Racket, but somebody, somewhere, decided that the example implementation was faulty or in some other way requiring attention. If you're familiar with the task and language, please consider reviewing/correcting the example and removing the notice.

### Other pages[edit]

These are other pages related to Racket which require attention; with your knowledge and assistance, we can improve the quality of the site's content.

### No pages found.

## Not Considered[edit]

These tasks are not generally counted toward "unimplemented", as somebody, somewhere, decided that Racket was inappropriate for these tasks, or implementations of them would be unenlightening. Feel free to try your hand at them anyway.

### No pages found.

## End of List[edit]

Again, feel free to try your hand at any of the tasks listed on this page.