Update README.md

Author: JawadSher

10 - Mathematics Problems/README.md

@@ -1 +1,27 @@
+<h1 align='center'>MATHEMATICS - PROBLEMS</h1>
 
+This repository contains a collection of mathematical problems from both **LeetCode** and **GeeksforGeeks (GFG)**, focusing on key concepts and algorithms used in mathematics. The problems are carefully categorized based on their difficulty and concept, providing a solid foundation for those looking to improve their problem-solving skills in areas like number theory, arithmetic operations, prime number algorithms, and other fundamental mathematical concepts.
+
+### Repository Content
+
+<p>
+<img src="https://img.shields.io/badge/problems%20count-01-orange?logo=leetcode" alt="LeetCode">
+<img src="https://img.shields.io/badge/problems%20count-01-darkgreen?logo=geeksforGeeks" alt="GeeksforGeeks">
+<img src="https://img.shields.io/badge/total%20problems%20count-01-blue" alt="Problem Count"> 
+</p>
+
+| No  | Problem Name                      | Description                               | Leetcode | GFG |
+|-----|------------------------------------|-------------------------------------------|----------|-----|
+| 01  | [Modular Exponentiation for Numbers](https://github.com/JawadSher/DSA-LeetCode-GFG-Problems-Repository/tree/main/10%20-%20Mathematics%20Problems/01%20-%20Modular%20Exponentitation%20for%20Numbers) | Calculate \(a^b \mod m\) efficiently. This problem focuses on finding the result of a large exponentiation modulo some number. | [Link](https://leetcode.com/problems/powx-n/) | [Link](https://www.geeksforgeeks.org/modular-exponentiation/) |
+
+This table summarizes the problem, provides a link to its LeetCode and GFG pages, and includes a brief description of the problem.
+
+### Key Concepts Covered:
+- **Prime Numbers & GCD/LCM**: Learn how to determine prime numbers, calculate the greatest common divisor (GCD), and least common multiple (LCM) of two numbers.
+- **Factorial & Fibonacci**: Dive into understanding factorials and the Fibonacci sequence, which are essential for combinatorics and recursive problems.
+- **Mathematical Algorithms**: Explore various algorithms, including Sieve of Eratosthenes for finding primes efficiently, power of a number calculations, and more.
+
+By solving these problems, you will strengthen your mathematical intuition, which is crucial for tackling problems in coding interviews, competitive programming, and real-world applications. Each problem comes with detailed explanations and resources to help you understand the underlying principles.
+
+--- 
+Happy Coding 😊