The student body at Eureka High School is having an election for Homecoming Queen. The candidates are Alicia, Brandy, Cleo, and Dionne ( A , B , C , and D for short ). Table 1-26 shows the preference schedule for the election. Table 1-26 N u m b e r o f v o t e r s 202 160 153 145 125 110 108 102 55 1st B C A D D C B A A 2nd D B C B A A C B D 3rd A A B A C D A D C 4th C D D C B B D C B a. How many students voted in this election? b. How many first-place votes are needed for a majority? c. Which candidate had the fewest last-place votes?
The student body at Eureka High School is having an election for Homecoming Queen. The candidates are Alicia, Brandy, Cleo, and Dionne ( A , B , C , and D for short ). Table 1-26 shows the preference schedule for the election. Table 1-26 N u m b e r o f v o t e r s 202 160 153 145 125 110 108 102 55 1st B C A D D C B A A 2nd D B C B A A C B D 3rd A A B A C D A D C 4th C D D C B B D C B a. How many students voted in this election? b. How many first-place votes are needed for a majority? c. Which candidate had the fewest last-place votes?
The student body at Eureka High School is having an election for Homecoming Queen. The candidates are Alicia, Brandy, Cleo, and Dionne (
A
,
B
,
C
,
and
D
for short
). Table 1-26 shows the preference schedule for the election.
Table 1-26
N
u
m
b
e
r
o
f
v
o
t
e
r
s
202
160
153
145
125
110
108
102
55
1st
B
C
A
D
D
C
B
A
A
2nd
D
B
C
B
A
A
C
B
D
3rd
A
A
B
A
C
D
A
D
C
4th
C
D
D
C
B
B
D
C
B
a. How many students voted in this election?
b. How many first-place votes are needed for a majority?
c. Which candidate had the fewest last-place votes?
2. Consider the following argument:
(a)
Seabiscuit is a thoroughbred.
Seabiscuit is very fast.
Every very fast racehorse can win the race.
.. Therefore, some thoroughbred racehorse can win the race.
Let us define the following predicates, whose domain is racehorses:
T(x) x is a thoroughbred
F(x) x is very fast
R(x) x can win the race
:
Write the above argument in logical symbols using these predicates.
(b)
Prove the argument using the rules of inference. Do not make use of conditional
proof.
(c)
Rewrite the proof using full sentences, avoiding logical symbols. It does not
need to mention the names of rules of inference, but a fellow CSE 16 student should be
able to understand the logical reasoning.
Find the inverse of the matrix, or determine that the inverse does not exist for:
€
(b)
7
-12
240
1 1 1
(c)
2 3 2
2 17
036
205
20
(d) -1
1
2
1
T NO
1
0
-1
00
1
0
02
(e)
1
0
00
0
0
1
1
4. Prove the following. Use full sentences. Equations in the middle of sentences are fine, but do
not use logical symbols.
(a)
(b)
(n+3)2 is odd for every even integer n.
It is not the case that whenever n is an integer such that 9 | n² then 9 | n.
Chapter 1 Solutions
Excursions in Mathematics, Loose-Leaf Edition Plus MyLab Math with Pearson eText -- 18 Week Access Card Package
University Calculus: Early Transcendentals (4th Edition)
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, subject and related others by exploring similar questions and additional content below.