about summary refs log tree commit diff
path: root/daily/306easy/README.md
diff options
context:
space:
mode:
Diffstat (limited to 'daily/306easy/README.md')
-rw-r--r--daily/306easy/README.md24
1 files changed, 24 insertions, 0 deletions
diff --git a/daily/306easy/README.md b/daily/306easy/README.md
new file mode 100644
index 0000000..77300de
--- /dev/null
+++ b/daily/306easy/README.md
@@ -0,0 +1,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.