feat: enhance Gradio interfaces for GCD, prime check, and LCM with detailed descriptions and examples

maths/number_theory/gcd.py

@@ -13,5 +13,6 @@ gcd_interface = gr.Interface(
     inputs=[gr.Number(label="A", precision=0), gr.Number(label="B", precision=0)],
     outputs="number",
     title="Greatest Common Divisor (GCD)",
-    description="Compute the greatest common divisor of two integers.",
+    description="Compute the greatest common divisor (GCD) of two integers using the Euclidean algorithm. The GCD is the largest integer that divides both numbers without leaving a remainder.",
+    examples=[[48, 18], [101, 10], [0, 5], [7, 7]],
 )

maths/number_theory/is_prime.py

@@ -22,5 +22,6 @@ is_prime_interface = gr.Interface(
     inputs=[gr.Number(label="Number", precision=0)],
     outputs="text",  # Outputting as text to give a clear True/False message
     title="Prime Number Check",
-    description="Check if a number is a prime number.",
+    description="Check if a number is a prime number. A prime number is a natural number greater than 1 that has no positive divisors other than 1 and itself.",
+    examples=[[2], [17], [18], [1], [0], [97]],
 )

maths/number_theory/lcm.py

@@ -12,5 +12,6 @@ lcm_interface = gr.Interface(
     inputs=[gr.Number(label="A", precision=0), gr.Number(label="B", precision=0)],
     outputs="number",
     title="Least Common Multiple (LCM)",
-    description="Compute the least common multiple of two integers."
+    description="Compute the least common multiple (LCM) of two integers. The LCM is the smallest positive integer that is a multiple of both numbers.",
+    examples=[[4, 6], [21, 6], [0, 5], [7, 7]],
 )