1 The pulverizer We saw in lecture that the greatest common divisor(GCD)of two numbers can be written as a linear combination of them. That is, no matter which pair of integers a and b we are given, there is always a pair of integer coefficients s and t such that
Sums, Approximations, and Asymptotics II Block Stacking How far can a stack of identical blocks overhang the end of a table without toppling over? Can a block be suspended entirely beyond the table's edge? Table Physics imposes some constraints on the arrangement of the blocks. In particular, the stack falls off the desk if its center of mass lies beyond the desk's edge. Moreover, the center of mass of the top k blocks must lie above the(k+1)-st block;
Sums and Approximations When you analyze the running time of an algorithm, the probability some procedure succeeds, or the behavior of a load-balancing or communications scheme, you'll rarely get a simple answer. The world is not so kind. More likely, you'll end up with a complicated sum:
1 Coloring Graphs Each term, the MIT Schedules Office must assign a time slot for each final exam. This is not easy, because some students are taking several classes with finals, and a student can take only one test during a particular time slot. The Schedules Office wants to avoid all conflicts, but to make the exam period as short as possible
Problem set SolutioN Exercise for home study o&W8.35 (a) From the system diagram, we see that a(t)=a(t)cos(wet) Using the multiplication property ZGu)= o(X(u)* FT(cos wct)) FT of cos wt is two impulses with area T at +wc. Therefore, Z(w)is the spectrum
1 Strong Induction Recall the principle of strong induction: Principle of Strong Induction. Let(n) be a predicate. If ·P() is true,and for all n, P(O)A P(1)...A P(n) implies P(n+1), then P() is true for all n E N. As an example, let's derive the fundamental theorem of arithmetic
