A tramp picks up cigarette butts off the street. Assume that for every 7 butts he finds, its equivalent to one full cigarette. He finds 49 butts. How many cigs can he smoke?
I'm from Jersey and they taught us stuff like this in 6th grade: Tony and Vinny went on a crime spree. Tony robbed a convenience store of $155 and at the same time Vinny jacked a Beemer. They then drove to a liquor store and took $1850 out of the till. Next, the went into a high class neighborhood and did a BnE getting a flatscreen. If caught, how many years will they spend in Trenton State Pen??? T
Here is another explanation Jim Sweets - 12: Chocolate 1 : 7 Ken Sweets : Chocolate - 18 1 : 4 Jim Chocolate = 7u x (Sweets -12) Ken 4u Sweets = Chocolate - 18 combine two, (substitute chocolate into Ken's equation) 4u Sweets = 7u x (Sweets -12) -18 4u Sweets = 7u Sweets - 84-18 3u Sweets = 102 1u Sweets = 34 34 x 2 = 68 sweets bought
Answer: North explanation: friction is by defn. in the opposite direction. So for air friction, south is the correct answer. But here we are talking about rolling friction ... to dig this, zoom in on the contact point of the wheel and road and you'll easily see that in this one special case, friction is in the same direction as the motion.
Answer: 8 explanation: for every 7 butts he gets one full cig. But when he smokes this he's got to leave a butt behind like everybody else. So these 7 additional butts make up the 8th cig.
cutting the gradient ..... Two roommate wall street traders travel to work on a circular railway. Their office is situated diametrically opposite to their home. In one direction from home to the office it takes 1 hr 20 min., but in the other direction, only 80 min. - why? ------------------------ An ET farmer has 1 5/8 ( one & five-eights) haystacks in one field, and 2 9/27 (two & nine-twentyseventh) haystacks in another field. If he put them together, how many haystacks will he have? Feel free to use a sliderule --------------------------- You have 6 identical matchsticks. Make some equilateral triangles. What is the max. # of such triangles you can make? supercomputers may be used