Answer:
∀s ∈ D, C(s) - - - > E(s)
∀s ∈ D, C(s) - - - > ~ E(s)
∃s ∈ D such that M(s) ∧ C(s)
Step-by-step explanation:
D = set of all students
M(s) = s math major
C(s) = s Computer science major
E(s) = s Engineering major
Expressing the following using quantifies variables and predicates :
A.) Every computer science student is an engineering student
∀s ∈ D, C(s) - - - > E(s)
b. No computer science students are engineering students
∀s ∈ D, C(s) - - - > ~ E(s)
c. Some computer science students are also math majors
∃s ∈ D such that M(s) ∧ C(s)
∃s = Existential Domain
∀s = universal
∧ = connective and
~ = not
∈ = belongs to
Answer:
T maximum=T average -7.8 seconds
T minimum=T average +7.8 seconds
Step-by-step explanation:
Calculation for the equation that can be
use to find the maximum and minimum times for the track team
Using this equation to find the maximum times for the track team
T maximum=T average -7.8 seconds
T maximum=64.6 seconds-7.8 seconds
Using this equation to find the minimum times for the the track team
T minimum=T average +7.8 seconds
T minimum=64.6 seconds +7.8 seconds
Therefore the equation for the maximum and minimum times for the track team are :
T maximum=T average -7.8 seconds
T minimum=T average +7.8 seconds
Answer:
schools and other services
22 just kidding........ 16
Answer:
Do you have options? The answer would be
g(x)=(x/3)^2
x = 1 btw
Because x = 1, if you have options then it'll most likely be g(x)=(1/3]^2
Step-by-step explanation:
Hope this helps
