Line 36: Line 36:
 
any idea?
 
any idea?
  
The course website is currently down, but I don't remember writing down number 40 as a homework problem.
+
<SPAN STYLE="color:red"> The course website is currently down, but I don't remember writing down number 40 as a homework problem. </span>
 
+
  
 
[[Category:MA375Spring2010Walther]]
 
[[Category:MA375Spring2010Walther]]

Revision as of 11:28, 18 January 2010

Has anyone done number 28 in sec 7.5 yet? I'm not sure how to get started...


T. Qu: Does anyone know how to do #50 in section 4.1?


It is asking us to prove that for any number n (lets say 4) you can pick n+1 integers (5) that are either less than or equal to 2n (8) at least one of the chosen integers can divide one of the other chosen integers in the set.

So if n=4 then the integers that are available to choose from are less than or equal to 2n=8

1, 2, 3, 4, 5, 6, 7, 8

We then choose any 5 (n+1) of these integers and we will see that it is not possible to choose 5 without having at least one of the integers able to divide another.

This is not an answer to the problem. I am just trying to make it more clear what it is asking for anyone who found the statement of the problem confusing.



I havent really solved this yet, but i did notice that the number of elements in the "pool" you can choose from is for the inductive case, 2k elements. the number of elements you are choosing is k+1. k+1 is more than half of the pool of 2k elements. from the example n = 4, from 8 elements you choose 5, where 5 > 8/2. i think you may be able to derive something from that fact. also for n = k+1, the pool is 2k+2, and you choose k+2 elements, > (2k+2)/2 = k+1. so the inductive case would hold.

i dont know if this helps, im kind of stuck too, but some thoughts.

========================================================================================================================================================

Have you done #40?

Here is what I am thinking.

Even thought x and y are positive numbers, but x-1 and y-1 are may not positive numbers.

ex: x=1 is positive number but x-1 is not. so, x-1 and y-1 can't be inductive hypothesis.

I'm not sure it is right.

any idea?

The course website is currently down, but I don't remember writing down number 40 as a homework problem.

Alumni Liaison

Questions/answers with a recent ECE grad

Ryne Rayburn