1). Are there exactly 3 distinctly symbols ued to create the code words in language Q? (1). The set of all code words in language Q is the set of all possible distinct horizonal arrangements of one or more symbols, with no repetition. (2). There are exactly 15 code words in language Q. 2). Pat will walk from intersection X to intersection Y along a route that is confined to the square grid of four streets and three avenues shown in the map above. How many routes from X to Y can Pat take that have the minimum possible length? A. six B. eight C. ten D. fourteen E. sixteen
3). In the figure above, two searchlights S1 and S2 are located 10000 feet apart, each covers an area of radius 10000 feet, and each is located 8000 feet from the railroad track. To the nearest 1000 feet, what is the total length X of track spanned by the searchlights? A. 24000 B. 22000 C. 20000 D. 16000 E. 12000 4). Three stacks containing equal numbers of chips are to be made from 9 red chips, 7 blue chips, and 5 green chips. If all of these chips are used and each stack contains at least one chip of each color, what is the maximum number of red chips in anyone stack? A.7 B.6 C.5 D.4 E.3 5). Of the science books in a certain supply room, 50 are on botany, 65 are on zoology, 90 are on physics, 50 are on geology, and 110 are on chemistry. If science books are removed randomly from the supply room, how many must be removed to ensure than 80 of the books removed are on the same science? A.81 B.159 C.166 D.285 E.324 |