Idaho Society of Professional Engineers
Friday Update - 05/14/04
UPCOMING EVENTS:
● ISPE Southeast Chapter Noon Luncheon
Seminar, Tuesday, May 18, 2004, 12:00 Noon, Shilling House Restaurant, 81 N
Shilling Ave, Blackfoot, Presenter - Dr. James H. Milligan, PE
● ASCE May Meeting, Thursday, May 27, 2004,
12:00 Noon, MK Plaza - Executive Dining Room, Presenter - Terry Scanlan of
Skellenger Bender, Seattle, WA, Topic - Case Histories: Loss Prevention, for
more information contact Ryan Adelman at
radelman@kellerassociates.com
● NSPE 2004 Convention and Expo, July 8 -
10, 2004, Honolulu, Hawaii
● NSPE Western and Pacific Regional
Meeting, September 17-18, 2004, Coeur d'Alene, ID
BSU COLLEGE OF ENGINEERING
GRADUATION PARTY - MAY 15, 2004, 2:00 PM
Please come and join in the fun. There will be a DJ, BBQ, AstroJump (for
children), volleyball, and fun adult games planned. Families and friends of the
graduates are invited, as well as all of the professionals within ISPE.
A REALLY USEFUL WEBSITE
This website has great appeal as a resource for seeking an almost unlimited
amount of information on anything at all. It is titled, "Librarian's Index to
the Internet," and can be found at http://lii.org.
The mission of the index is to provide a well-organized point of access for
reliable, trustworthy, librarian-selected Internet resources. This site will
allow you to search for technical articles, as well as for information in nearly
boundless areas. It appears to be maintained by highly qualified persons.
EnergyEthics 2004, sponsored by NSPE, ASCE, ASME, IEEE-PES, and IEEE-USA
MATHCOUNTS PROBLEM OF THE WEEK
Can you solve this MATHCOUNTS problem? The answer will appear in next week's
edition of the Friday Update!
The National Competition Wrap-Up
This past weekend, 228 of the nation’s top Mathletes squared off at the
MATHCOUNTS National Competition in Washington, D.C. The final round is scheduled
to air on ESPN2 on June 3 at noon ET. However, here’s a preview of some of the
problems these Mathletes had to successfully answer to even make it to the final
Countdown Round!
--------------------------------------------------------------------------------
Sprint #19: How many distinct, non-equilateral triangles with a perimeter of 60
units have integer side lengths a, b and c, such that a, b, c is an arithmetic
sequence?
--------------------------------------------------------------------------------
Target #6: Joe will randomly select two letters from the word CAMP, four letters
from the word HERBS, and three letters from the word GLOW. What is the
probability that he will have all of the letters from the word PROBLEM? Express
your answer as a common fraction.
--------------------------------------------------------------------------------
Team #3: The student council sold 661 T-shirts, some at $10 and some at $12.
When recording the amount of T-shirts they had sold at each of the two prices,
they reversed the amounts. They thought they made $378 more than they really
did. How many T-shirts actually were sold at $10 per shirt?
Answer to last week's problem:
We need to determine the number of times 0.57 goes into 2,000,000. We see that
2,000,000 ÷ 0.57 = 3,508,772, to the nearest whole number.
--------------------------------------------------------------------------------
The arithmetic mean of the number of viewers of the finale episodes of each of
these three other comedies is (76.2 + 80 + 105.4) ÷ 3 = 87.2 million. This is a
difference of 87.2 – 50 = 37.2 million viewers.
--------------------------------------------------------------------------------
Initially, you may say that there are 9! = 9 × 8 × 7 × 6 × 5 × 4 × 3 × 2 × 1 =
362,880 ways to arrange the nine letters. And this would be the correct answer
if all nine letters were distinct. However, notice that if we write the word
this way: TrIbBiani, though we can now see that TrIbBiani is different from
TriBbIani, they shouldn’t be counted as two distinguishable orders since the
letters wouldn’t really be distinguishable if we wrote them the way they were
supposed to. To make up for the double Bs and the triple Is, we need to divide
9! by 2! and by 3!. Therefore, there are (9!) ÷: (2! × 3!) = 30,240
distinguishable orders for the nine letters.
If you want to see last week's problem again, click on
http://www.mathcounts.org/Queries/POW_Archive.taf?_function=detail&Q_A_uid1=493&_UserReference=4E6587E3EADAB0BE40A270EA
Idaho Society of Professional Engineers
PO Box 170239
Boise, ID 83717-0239
208-426-0636
Fax: 208-426-0639
E-Mail: ispe@rmci.net
Web Site: www.Idahospe.org
Idaho
Society of Professional Engineers
