Recent content by Jim01

Ahh. I see. They are using the word mod like it's used it in Java programming. I didn't see the connection. Thank you so much for the link. I will research it. Really? I double checked the book and that is what it has for that example solution. I assumed that the 0, 1, and 2 were...

Homework Statement Let J3 = {0, 1, 2}, and define functions f and g from J3 to J3 as follows: For all x in J3, f(x) = (x2 + x + 1) mod 3 and g(x) = (x + 2)2 mod 3. Does f = g? Homework Equations The Attempt at a Solution The above is an example from the book. The section is called...

I didn't calculate it. I drew it out. I was hoping that if I knew what what the various numbers were it would jump out at me. I was wrong. I know there is a pattern, and I know that the previous S numbers have something to do with it, I just can't see it. I'll keep working on it.

Homework Statement A single pair of rabbits (male and female) is born at the beginning of a year. Assume the following conditions: (1) Rabbit pairs are not fertile during their first two months of life, but thereafter give birth to three new male/female pairs at the end of every month...

You are absolutely correct. Thank you for pointing that out to me.

OK. I think I may get it. The first thing you did was to make all the subscripts the same, so that a0, a1, a3, ... is defined by ak = 3k + 1 and ak-1 = 3(k - 1) + 1. I didn't know you could do that, although since the letters are arbitrary, it makes sense. You then input the answer to...

If I am understanding you correctly, then If an = 3n + 1, then an-1 = 3(n - 1) + 1 = 3n - 3 + 1 = 3n - 2 therefore an - an-1 = 3n + 1 - 3n - 2 = -1 I'm sorry for being so...

Homework Statement Let a0, a1, a2..., be defined by the formula an = 3n + 1, for all integers n >= 0. Show that this sequence satisfies the recurrence relation ak = ak-1 + 3, for all integers k >=1. Homework Equations for all integers n >= 0, an = 3n + 1 for all integers k...

Thank you Mr. Vickson. You are right, I don't understand. I thought I was following the example in the book step-by-step. I will go back and reread that section. The book only gives one example, so I will take a look around the Internet and see if I can't find more examples that may shed...

Homework Statement Summation of i(i + 1) (with i going from i = 2 to i = n-1) = n(n-1)(n=1) / 3 a. Write P(2). Is P(2) true? b. Write P(k) c. Write P(k+1) d. Prove by mathematical induction that the formula holds true for all integers n \geq 2 Homework Equations...

Outstanding! Thank you for the information. After checking it I was right! I'm on the right track then. I was unsure whether or not I was interpreting the instructions correctly since most math has you doing everything inside the parenthesis first. It's counter-intuitive to do it last, so I...

Is there a way of adding gates to my thread? I attempted to cut and paste my Viso drawing but that didn't work. It is a lot easier to see the circuit rather than read and try to visualize it.

Homework Statement Construct a circuit from the Boolean equation: Homework Equations P v (~P ^ ~Q) The Attempt at a Solution According to the textbook, I am supposed to go from right to left, working on the outermost part of the expression to the innermost part. I read this as...

I just noticed this disclaimer: "This forum is not for homework or any textbook-style questions." I did not see this before. I will post my question in the appropriate section. Please pardon my mistake.

Well that's definitely always been the case in the past but I quoted from the book verbatim. "Go from the right side of the diagram to the left, working from the outermost part of the expression to the innermost part." The example used was (~P ^ Q) v ~Q In the above case they began with...