Introduction - If you have any usage issues, please Google them yourself
Package consists of two files. First, to find sum of all numbers between t o n whose sum of factorials of each digit is perfectly divisible by the number. Second, to find sum of all numbers less than equal to n, where the number is palindrome as well as its binary representation is palindrome.