The world’s Largest Sharp Brain Virtual Experts Marketplace Just a click Away
Levels Tought:
Elementary,Middle School,High School,College,University,PHD
| Teaching Since: | Jul 2017 |
| Last Sign in: | 362 Weeks Ago, 1 Day Ago |
| Questions Answered: | 5502 |
| Tutorials Posted: | 5501 |
MBA.Graduate Psychology,PHD in HRM
Strayer,Phoniex,
Feb-1999 - Mar-2006
MBA.Graduate Psychology,PHD in HRM
Strayer,Phoniex,University of California
Feb-1999 - Mar-2006
PR Manager
LSGH LLC
Apr-2003 - Apr-2007
Math 300-B Winter 2017 Stew #1 Due January 20th Solve three out of five problems. You must work alone. 1. Can you tile a 6 ⇥ 6 board with 15 dominoes so that the six empty squares are all in di↵erent rows and columns? For example, here’s an attempt that almost works, but there are two empty squares in the last column. 2. You are driving in an infinite city whose blocks form a square lattice. At every intersection, you must turn left or right–you can’t go straight. You start from the red point driving north. Is it possible to return to the red point while driving south? 3. Five pillars are arranged in a circle, and between every pair of pillars is a string with a light bulb on it. You are allowed to make the following move, as many times as you want: pick three pillars, then turn the three light bulbs on the strings connecting those pillars on (if they’re o↵) or o↵ (if they’re on). For example, if you pick the top three pillars in the picture on the left, you would end up with the picture on the right. In the beginning, one light bulb is on and all the rest are o↵. Is it possible to turn all the light bulbs o↵? 4. At some point during the quarter, Jonah’s attendance record is less than 90%. Later on in the quarter, it’s above 90%. Is there necessarily some time when his attendance record is exactly 90%? (Note that attendance doesn’t vary continuously. If Jonah has attended 3 out of 5 classes, and then misses another one, his attendance drops directly from 60% to 50%.) 5. Your apartment contains a long hallway with 10,000 light bulbs, numbered 1 through 10,000. Originally, all of the light bulbs are o↵. On the first day, you pull the chain on every light bulb, turning them all on. On the second day, you pull the chain on every even-numbered light bulb, turning them o↵. On the third day, you pull the chain on every light bulb that’s a multiple of three. This continues: on the nth day, you toggle all the light bulbs that are multiples of n. After 10,000 days, which light bulbs are on?
Hel-----------lo -----------Sir-----------/Ma-----------dam----------- T-----------han-----------k y-----------ou -----------for----------- us-----------ing----------- ou-----------r w-----------ebs-----------ite----------- an-----------d a-----------cqu-----------isi-----------tio-----------n o-----------f m-----------y p-----------ost-----------ed -----------sol-----------uti-----------on.----------- Pl-----------eas-----------e p-----------ing----------- me----------- on----------- ch-----------at -----------I a-----------m o-----------nli-----------ne -----------or -----------inb-----------ox -----------me -----------a m-----------ess-----------age----------- I -----------wil-----------l