Add solutions

Author: jrmanrique

projecteuler/README.md

@@ -82,6 +82,7 @@
 | 87 | Prime power triples | :small_blue_diamond: [Python](../projecteuler/python/p087.py)
 | 92 | Square digit chains | :small_orange_diamond: [Python](../projecteuler/python/p092.py)
 | 97 | Large non-Mersenne prime | :small_blue_diamond: [Python](../projecteuler/python/p097.py)
+| 145 | How many reversible numbers are there below one-billion? | :small_orange_diamond: [Lua](../projecteuler/python/p145.py)
 | 205 | Dice game | :small_blue_diamond: [Python](../projecteuler/python/p205.py)
 | 206 | Concealed square | :small_orange_diamond: [Python](../projecteuler/python/p206.py)
 | 243 | Resilience | :small_orange_diamond: [Python](../projecteuler/python/p243.py) :small_orange_diamond: [Lua](../projecteuler/lua/p243.lua)

projecteuler/lua/p145.lua

@@ -0,0 +1,20 @@
+function reverseSum(n)
+  return n + string.reverse(n)
+end
+
+function isAllOdd(n)
+  for digit in string.gmatch(math.floor(n), '%d') do
+    if digit % 2 == 0 then
+      return false
+    end
+  end
+  return true
+end
+
+count = 0
+for i = 1, 10 ^ 9 do
+  if i % 10 ~= 0 and isAllOdd(reverseSum(i)) then
+    count = count + 1
+  end
+end
+print(count)