This problem in number theory is an elegant applciations of the modulo technique used in the diophantine equations. Try with our sequential hints
This problem in number theory is an elegant applciations of the modulo technique used in the diophantine equations. Try with our sequential hints
American Mathematical Olympiard 10A Problem 21 Solutuon. The main idea here in this problem is to use some formulae of induction and finding factors.
This problem in number theory is an elegant application of the ideas of the proof of infinitude of primes from Korea. Try with our sequential hints.
This problem is a basic application of triangle inequality along with getting to manipulate the modulus function efficently. Try with our sequential hints.
This problem is a beautiful application of prime factorization theorem, and reveal how important it is. Try with our sequential hints.
This problem is a beautiful application of algebraic manipulations, ideas of symmetry, and vieta's formula in polynomials. Try with our sequential hints.
This problem is cute and intermediate application of the basic geometry principles. Try out this problem with our sequential hints.
A beautiful problem form American Math Contest (AMC 10A) 2005, Problem 22 solution. Key idea here is to apply the greatest integer function.
This is a bashing problem of combinatorics that will require the idea of patiently solving out the cases with intricate details and patience. Try with our sequential hints.
A beautiful problem form American Math Contest (AMC 10A) 2006, Problem 21 solution. Key idea is to use basic calculation.