IT

Challenge: GCD Product Subdomeniu: Number Theory (number-theory) Scor cont: 150.0 / 150 Submission status: Accepted Submission score: 1.0 Submission ID: 464736095 Limbaj: cpp14 Link challenge: https://www.hackerrank.com/challenges/gcd-product/problem Cerinta This time your assignment is really simple. Calculate GCD(1, 1) * GCD(1, 2)

Challenge: GCD mocktail Subdomeniu: Number Theory (number-theory) Scor cont: 150.0 / 150 Submission status: Accepted Submission score: 1.0 Submission ID: 464775788 Limbaj: cpp14 Link challenge: https://www.hackerrank.com/challenges/gcd-mocktail/problem Cerinta The Rebel Alliance and the Galactic Empire are engaged in an epic battle

Challenge: Fun with 1010 Subdomeniu: Number Theory (number-theory) Scor cont: 120.0 / 120 Submission status: Accepted Submission score: 1.0 Submission ID: 464775662 Limbaj: python3 Link challenge: https://www.hackerrank.com/challenges/fun-with-1010/problem Cerinta When you look at photographs of watches and clocks, you'll find that

Challenge: Find The Operations Subdomeniu: Number Theory (number-theory) Scor cont: 80.0 / 80 Submission status: Accepted Submission score: 1.0 Submission ID: 464737475 Limbaj: cpp14 Link challenge: https://www.hackerrank.com/challenges/flip/problem Cerinta You are given a square grid of size N, with rows numbered

Challenge: Fibonacci LCM Subdomeniu: Number Theory (number-theory) Scor cont: 80.0 / 80 Submission status: Accepted Submission score: 1.0 Submission ID: 464735141 Limbaj: cpp14 Link challenge: https://www.hackerrank.com/challenges/fibonacci-lcm/problem Cerinta After Derek (of district 5) discovered how to compute the greatest common divisor

Challenge: Fibonacci GCD Subdomeniu: Number Theory (number-theory) Scor cont: 80.0 / 80 Submission status: Accepted Submission score: 1.0 Submission ID: 464759180 Limbaj: cpp14 Link challenge: https://www.hackerrank.com/challenges/fibonacci-gcd/problem Cerinta Fibonacci numbers have the following form: $$F_1 = 1 \\\ F_2 = 1

Challenge: Fibonacci Finding (easy) Subdomeniu: Number Theory (number-theory) Scor cont: 30.0 / 30 Submission status: Accepted Submission score: 1.0 Submission ID: 464725415 Limbaj: python3 Link challenge: https://www.hackerrank.com/challenges/fibonacci-finding-easy/problem Cerinta You're given three numbers: $A$, $B$, and $N$, and all you have

Challenge: Euler's Criterion Subdomeniu: Number Theory (number-theory) Scor cont: 30.0 / 30 Submission status: Accepted Submission score: 1.0 Submission ID: 464725254 Limbaj: cpp14 Link challenge: https://www.hackerrank.com/challenges/eulers-criterion/problem Cerinta Your friend gives you an equation $A \equiv X^2 \pmod{M}$ and asks you

Challenge: Eugene and Big Number Subdomeniu: Number Theory (number-theory) Scor cont: 100.0 / 100 Submission status: Accepted Submission score: 1.0 Submission ID: 464775242 Limbaj: python3 Link challenge: https://www.hackerrank.com/challenges/eugene-and-big-number/problem Cerinta Eugene must do his homework, but he is struggling. He has

Challenge: Equations Subdomeniu: Number Theory (number-theory) Scor cont: 60.0 / 60 Submission status: Accepted Submission score: 1.0 Submission ID: 464737199 Limbaj: cpp14 Link challenge: https://www.hackerrank.com/challenges/equations/problem Cerinta Find the number of positive integral solutions for the equations $$\frac{1}{x} + \frac{1}{y} =