An attempt to solve the 99 PROLOG Problems in Rust. Their categories include Lists, Arithmetic Problems, Logic and Codes, Binary Trees, Multiway Trees, Graphs etc.

[31] Determine whether a given integer number is prime.
[32] Determine the greatest common divisor of two positive integer numbers.
[33] Determine whether two positive integer numbers are coprime.
[34] Calculate Euler's totient function phi(m).
[35] Determine the prime factors of a given positive number.
[37] Calculate Euler's totient function phi(m) (improved).
[36] Construct a list containing the prime factors and their multiplicity.
[38] Compare the two methods of calculating Euler's totient function.
[39] A list of prime numbers.
[40] Goldbach's Conjecture.
[41] A list of Goldbach's Compositions.
[42] There is no problem 42 in original problem set.
[43] There is no problem 43 in original problem set.
[44] There is no problem 44 in original problem set.
[45] There is no problem 45 in original problem set.

[46] Truth tables for logical expressions.
[47] Truth tables for logical expressions(2).
[48] Truth tables for logical expressions(3).
[49] Gray code.
[50] Huffman Code.