Euclidean algorithm is used to find GCD (greatest common divisor). Use tutorial video and practise problems to master this tool.
Euclidean algorithm is used to find GCD (greatest common divisor). Use tutorial video and practise problems to master this tool.
Try these AMC 8 Number Theory Questions and check your knowledge! AMC 8, 2025, Problem 2 The table below shows the ancient Egyptian hieroglyphs that were used to represent different numbers. For example, the number 32 was represented by $\cap \cap \cap|\mid$. What number was represented by the following combination of hieroglyphs? (A) 1,423(B) 10,423(C) […]
Try these AMC 8 Combinatorics Questions and check your knowledge! AMC 8, 2025, Problem 5 Betty drives a truck to deliver packages in a neighborhood whose street map is shown below. Betty starts at the factory (labeled $F$ ) and drives to location $A$, then $B$, then $C$, before returning to $F$. What is the […]
Try this beautiful problem from AMC 8. It involves permutation and basic counting principles. We provide sequential hints so that you can try the problem.
Try this beautiful problem from AMC 10. It involves geometry of triangles. We provide sequential hints so that you can try the problem.
Try this beautiful problem from AMC 8. It involves basic agebra and powers of numbers. We provide sequential hints so that you can try the problem.
Try this beautiful problem from AMC 10. It involves geometry of triangles. We provide sequential hints so that you can try the problem.
Try this beautiful problem from AMC 8. It involves the concept that when a number is taken as a fraction. And also based upon the basic Linear Equation calculation.
Try this beautiful problem from AMC 8. It involves basic agebra and powers of numbers. We provide sequential hints so that you can try the problem.
Wilson’s Theorem is a beautiful result from Number Theory. We created an animation on it! Linked it with Geometry and behold the beauty of mathematics that comes forth. Try it!