[Cs4800] hw 6 / inclusion-exclusion principle

[Karl Lieberherr]

Hi Ken:

When I opened the document, I got a 2 line question about the Moebius
function.

It is a question not directly relevant to the algorithms we discuss,
although it
can be answered using the inclusion-exclusion principle.

-- Karl

Recall that the Mobius function (n) is 0 if n contains a square factor and
is (􀀀1)r
if n is the product of r dierent primes. For any n  2, prove that
P
djn (d) = 0.
6.

On Thu, Oct 14, 2010 at 12:02 AM, Ken Sham <sham.k at husky.neu.edu> wrote:

> What's the question for number 5?
>
>
> On Wed, Oct 13, 2010 at 21:53, Karl Lieberherr <lieber at ccs.neu.edu> wrote:
>
>> Hw 6 is ready now.
>>
>> Here is a link to a review of the Inclusion-Exclusion Principle from
>> Discrete Structures that we used today.
>>
>> http://www.ccs.neu.edu/home/lieber/courses/algorithms/cs4800/f10/resources/inclExcl.pdf
>>
>> -- Karl
>>
>> _______________________________________________
>> Cs4800 mailing list
>> Cs4800 at lists.ccs.neu.edu
>> https://lists.ccs.neu.edu/bin/listinfo/cs4800
>>
>>
>
>
> --
> Kenneth Sham
> Northeastern University, Class of 2012
> Dual Major: Computer Science & Math
>
-------------- next part --------------
HTML attachment scrubbed and removed