Adhvaitha
Pages
(Move to ...)
Home
About this blog
▼
Monday, 12 September 2011
IMO-1959
›
Prove that the fraction \(\frac{21n+4}{14n+3}\) is irreducible for every natural number \(n\). To show that a fraction is irreducible, ...
Wednesday, 7 September 2011
Algorithms - Exercises from Chapter 0
›
In each of the following situations, indicate whether \(f = \mathcal{O}(g)\) (or) \(f = \Omega(g)\) or both (in which case \(f = \Theta(g...
Algorithms by S. Dasgupta, C.H. Papadimitriou, and U.V. Vazirani
›
This post contains the solution to the exercises of the book by S. Dasgupta, C.H. Papadimitriou, and U.V. Vazirani named "Algorithms...
Tuesday, 6 September 2011
Elementary Number Theory - 1 Problems
›
Suppose that \(a,b,c \in \mathbb{N}\). Prove each of the following: If \(a|b\) and \(b|c\), then \(a|c\). Since \(a|b\) and \(b|c\), w...
Friday, 2 September 2011
Elementary Number Theory - 1.3 Definitions and Propositions
›
Theorem: (Euclid) There are infinitely many primes. Proof: This is a classic proof by contradiction. Assume that there are only finitel...
›
Home
View web version