Question
Find the remainder when 5123 is divided by
36.Solution
φ(36) = φ(4×9) = φ(4)φ(9) = 2×6 = 12 Since gcd(5,36)=1, Euler’s theorem: 512 ≡ 1 (mod 36) Now 123 = 12×10 + 3 5123 ≡ (512)10 × 53 ≡ 110 × 125 ≡ 125 (mod 36) 125 ÷ 36 = 3×36 = 108, remainder 17 Answer: remainder = 17.
Recursive problems are implemented by
Which of the following is considered the strongest type of encryption method in modern cyber security practices?   Â
Which algorithm finds the longest common subsequence (LCS) of two sequences?
What is the worst-case time complexity of QuickSort with a random pivot for sorting n distinct elements?
Which traversal method in a binary search tree retrieves nodes in sorted order?
Dynamic Programming is preferred over recursion when:
Which sorting algorithm is not stable by default?
Which file structure is best suited for handling large datasets and ensuring fast access in C, C++, Java, or Python?    Â
In Database Management Systems, what is the primary purpose of normalization?
Which architecture allows multiple processors to share memory and work simultaneously?     Â
