|
32 | 32 | - [Discrete Root](https://cp-algorithms.com/algebra/discrete-root.html)
|
33 | 33 | - [Montgomery Multiplication](https://cp-algorithms.com/algebra/montgomery_multiplication.html)
|
34 | 34 |
|
35 |
| - |
36 |
| -## Questions related to Number Theory |
37 |
| - |
38 |
| -- All Unique Prime Factors ----> [Java](/Code/Java/Uniquefactor.java) | [C++](/Code/C++/Unique_prime_factor.cpp) |
| 35 | +## Questions related to Number Theory |
| 36 | +- All Unique Prime Factors ----> [C++](/Code/C++/Unique_prime_factor.cpp) | [Java](/Code/Java/Uniquefactor.java) |
39 | 37 | - Binary to Decimal Number Transformation ----> [C++](/Code/C++/binary_string_to_decimal.cpp) | [Java](/Code/Java/Bin_Dec.java)
|
40 | 38 | - Checking for Anagram ---->[Python](/Code/Python/Anagram.py)
|
41 | 39 | - Check Prime Number ----> [Java](/Code/Java/check_prime.java) | [Python](/Code/Python/TrimorphicNumber.py)
|
42 |
| -- Check Trimorphic number ---->[C++](/Code/C++/Trimorphic_number.cpp) |
| 40 | +- Check Trimorphic number ---->[C++](/Code/C++/Trimorphic_number.cpp) | [Java](/Code/Java/trimorphic_number.java) |
43 | 41 | - Counting number of digits in factorial using Kamenetsky's Formula ----> [Java](Code/Java/Kamenetsky_Formula.java)
|
44 | 42 | - Determining if a number is a prime number or not using Trial Division Algorithm ---> [C++](/Code/C++/prime_number.cpp)
|
| 43 | +- Factorial of a number using recursion ---->[C++](/Code/C++/factorial_using_recursion.cpp) | [Python](/Code/Python/Factorial.py) |
45 | 44 | - Factorial of a number without recursion ---->[Python](/Code/Python/factorial_without_recursion.py)
|
46 |
| -- Check Trimorphic number ---->[C++](/Code/C++/Trimorphic_number.cpp) | [Java](/Code/Java/trimorphic_number.java) |
47 | 45 | - Fibonacci Series ----> [Java](/Code/Java/Fibonacci_Series.java)
|
48 | 46 | - GCD of two number using Euclidean Algorithm ----> [Java](/Code/Java/GCD.java) | [Python](/Code/Python/GCD.py)
|
49 | 47 | - Geek-onacci Number----> [C++](/Code/C++/Geek-onacciNumber.cpp)
|
| 48 | +- Program to check a number is perfect ---> [C++](/Code/C++/perfect_number.cpp) |
| 49 | +- All Unique Prime Factors of any number N ----> [C++](/Code/C++/Unique_prime_factor.cpp) |
50 | 50 | - Modular Exponentiation ----> [C++](/Code/C++/modular_exponentiation.cpp)
|
51 | 51 | - Palindrome Number ---> [C++](/Code/C++/palindrome_number.cpp) | [Python](/Code/Python/palindrome_number.py)
|
52 | 52 | - Program to check a string is a pangram----> [Python](/Code/Python/check_pangram.py)
|
53 | 53 | - Square Root using Binary Search ----> [Java](Code/Java/sqrt.java)
|
54 | 54 | - Taylor's Series of e^x ----> [Java](/Code/Java/Taylorseries.java)
|
| 55 | +- Check Triautomorphic number ----> [Java](/Code/Java/triautomorphic_number.java) |
55 | 56 | - To check for palindrome number---->[Java](/Code/Java/Palindrome_number.java)
|
56 | 57 | - To find all prime number from 2 to N ----> [C++](/Code/C++/Sieves_prime.cpp)
|
57 |
| -- Sliding Window Maximum ----> [Python](/Code/Python/SlidingWindowMax.py) |
| 58 | +- Sliding Window Maximum ----> [Python](/Code/Python/SlidingWindowMax.py) |
| 59 | +- Pronic Number ---> [C++](/Code/C++/pronic_Number.cpp) |
| 60 | + |
0 commit comments