# Reports:Tasks not implemented in Python

**Awareness**

If

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

## Contents

## Not implemented[edit]

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

### L

### P

### 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 Python (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

### C

- CLI-based maze-game
- Code Golf: Code Golf
- Combinations with repetitions/Square digit chain
- Compiler/Simple file inclusion pre processor
- Compiler/Verifying syntax
- Composite numbers k with no single digit factors whose factors are all substrings of k
- Concatenate two primes is also prime
- Conjugate a Latin verb
- Continued fraction/Arithmetic/G(matrix ng, continued fraction n1, continued fraction n2)
- Count the coins/0-1
- Create your own text control codes
- Cubic Special Primes
- Curve that touches three points
- Cyclops numbers

### D

### F

### G

### I

### L

### M

### N

### P

- Palindromic primes in base 16
- Pandigital prime
- Parse EBNF
- Particle fountain
- Penrose tiling
- Permuted multiples
- Piprimes
- Polynomial derivative
- Powerful numbers
- Prime numbers p which sum of prime numbers less or equal to p is prime
- Prime triplets
- Primes which contain only one odd digit
- Primes whose first and last number is 3
- Process SMIL directives in XML data
- Pseudorandom number generator image

### R

- Railway circuit
- Ramanujan primes
- Raster bars
- Recursive descent parser generator
- Remote agent/Agent interface
- Remote agent/Agent logic
- Remote agent/Simulation
- Robots
- Rodrigues’ rotation formula
- Rosetta Code/List authors of task descriptions
- Rosetta Code/Run examples
- Rosetta Code/Tasks without examples
- Round-robin tournament schedule
- Ruth-Aaron numbers

### S

- Safe mode
- Sanitize user input
- Segmentation fault protection
- Selective file copy
- Sierpinski curve
- Simulated annealing
- Sine wave
- Smallest number k such that k+2^m is composite for all m less than k
- Solve a Rubik's Cube
- Solving coin problems
- Sort primes from list to a list
- Sorting algorithms/Tree sort on a linked list
- Special Divisors
- Special neighbor primes
- Spoof game
- Square root by hand
- Starting a web browser
- Substring primes
- Sum data type
- Sum of primes in odd positions is prime
- Sum of square and cube digits of an integer are primes
- Sum of two adjacent numbers are primes
- Summation of primes

### T

### U

### W

## Requiring Attention[edit]

### Examples[edit]

These tasks have implementations in Python, 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 Python which require attention; with your knowledge and assistance, we can improve the quality of the site's content.

## Not Considered[edit]

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

## End of List[edit]

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