about summary refs log tree commit diff
path: root/daily/306easy/README.md
blob: 77300dee33da840fee48f7c7fd052c6b6fc9e7b9 (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
# [[2017-03-13] Challenge #306 [Easy] Pandigital Roman Numbers](https://www.reddit.com/r/dailyprogrammer/comments/5z4f3z/20170313_challenge_306_easy_pandigital_roman/)

## Description

1474 is a pandigital in Roman numerals (MCDLXXIV). It uses each of the symbols
I, V, X, L, C, and M at least once. Your challenge today is to find the small
handful of pandigital Roman numbers up to 2000. 

## Output Description

A list of numbers. Example: 

    1 (I), 2 (II), 3 (III), 8 (VIII) (Examples only, these are not pandigital Roman numbers)

## Challenge Input

Find all numbers that are pandigital in Roman numerals using each of the
symbols I, V, X, L, C, D and M *exactly* once.

## Challenge Input Solution

1444, 1446, 1464, 1466, 1644, 1646, 1664, 1666 

See [OEIS sequence A105416](http://oeis.org/A105416) for more information.