Missing Number – Number Bonds Pattern Technique
This sample question is from a well reputed Local Chinese Math Olympiad contest
Similar Posts
Combinatorial Geometry Minimum Number of Line Segments at Right Angles to Start and Return to Origin
Question No. 25 of the ASMO (Math Olympiad) in Image A Possible…
Minimum Number of Sides of a Polygon
Question What is the minimum number of sides a polygon can have if all its interior angles are…
A Pythagorean Dilemma in area – Comments
A Pythagorean Dilemma in relating areas – Comments regarding proving areas with Pythagorean Theory and Congruent Triangles in…
Frobenius Number – The Largest Number which cannot be represented
Question & Solution in image below
Let n, m be an element of Z+ and a,b be elements of Z. Suppose that a=b(modn) and a =b(modm) and that (n,m)=1. Prove that a=b(mod nm)
Answer Z+ means positive integers. Proof. (a – b) is divisible by n. (a – b) = pn…
