Monday, September 30, 2013
Saturday, September 21, 2013
Homework for next week (9/23-9/28/2013)
1) The webwork for next week (section 1.6) is now open and is due on Tuesday at midnight.
2) the written homework for next week is sections 2.1, 2.2 and 2.3 and is due Thursday at the beginning of class.
By the way, I want to remind you that the first exam is on October 1, which is Tuesday of the following week.
2) the written homework for next week is sections 2.1, 2.2 and 2.3 and is due Thursday at the beginning of class.
By the way, I want to remind you that the first exam is on October 1, which is Tuesday of the following week.
Thursday, September 19, 2013
webwork questions
Hi Dr. Tom! I have some questions about the webwork assignment:
Section1.4 Rosen7: Problem 2
The notation ∃!xP(x) denotes the proposition " There exists a unique x such that P(x) is true. "
If the universe of discourse is the set of integers, what are the truth values of the following?
∃!x(x>1): my answer is true, but the correct answer is false?
<the critical issue here is that there should exist one and only one solution of the inequality. If there is no solution, or if there are more than one solutions, then the answer is false. So, over the integers, how many solutions are there?>
∃!x(x^2=1): my answer is true( 1^2=1?), the correct answer is false?
<Again, the issue is how many solutions are there to the equation x^2=1 over the integers?>
Section1.5 Rosen7: Problem 1
Determine the truth value of the following statements if the universe of discourse of each variable is the set of real numbers:
∃x∀y≠0(xy=1): my answer is true, but the correct answer is false?
<The critical issue here is understanding what the order of quantifiers tells us: ∃x∀y≠0 says that there is some x such that for all y the predicate function xy=1 is true--you have to choose the x and then show that the equation is true for all y≠0. On the other hand ∀y≠0∃x would say that for every y you could find some x--which is a less restrictive statement>
Saturday, September 14, 2013
The Homework for Next Week (9/15/2013-9/21/2013)
1) The written homework for next week is sections 1.6 and 1.7 (see the syllabus)
2) The webwork for next week is open; do sets 1.4 and 1.5; since I didn't open the webwork until just now, I'm giving until Thursday to do it.
2) The webwork for next week is open; do sets 1.4 and 1.5; since I didn't open the webwork until just now, I'm giving until Thursday to do it.
Thursday, September 5, 2013
Homework Due Next Week (September 8-13)
1) The next webwork assignment is now open and is due Tuesday 9/10/2013 at midnight. Remember to get it done correctly by logging in anonymously as "Student" first
2) Written homework sections 1.4 and 1.5 are due at the beginning of class on Thursday 9/12/2013
Monday, September 2, 2013
Webwork Question (bitwise operations)
Hi,
I'm trying to do this problem and I'm not even sure what they're asking us
to do. Can you give me a little guidance please? Thank you.
*********************************************************
This is the problem webwork tells me you are working, is this correct?
Evaluate each of the following expressions:
(a)11000∧(01011∨11011)
(b)(01111∧10101)∨01000
(c)(01010⊕11011)⊕01000
(d)(11011∨01010)∧(10001∨11011)
This problem is about bitwise logical operations, which were covered in section 1.1--You should
reread that section. The general idea is that you consider "1" to be an equivalent of "True", "0" to
be an equivalent of "False" and then perform logical operations "And", "Or" and "XOr" on a
pointwise basis. This link takes you to the wiki article on the subject, and gives more detailed
explanation than the book.
kajs
I'm trying to do this problem and I'm not even sure what they're asking us
to do. Can you give me a little guidance please? Thank you.
*********************************************************
This is the problem webwork tells me you are working, is this correct?
Evaluate each of the following expressions:
(a)
(b)
(c)
(d)
reread that section. The general idea is that you consider "1" to be an equivalent of "True", "0" to
Subscribe to:
Comments (Atom)