Question

(2 pts each) Find a different equivalent form of the statements. Justify your answers using Laws of equivalence or otherwise.

(10 pts) How many bit strings (the strings consist of only Os and l’s) of length 10 does not start with a zero but ends with

= 5an-1-6an-2 with ao 1, ai (10 pts) Find a solution to an 2. =

0 0
Add a comment Improve this question Transcribed image text
Answer #1

1.

(a) Few men are not scientist too.

(b) Every computer science major needs discrete mathematics.

2. if the bit string of 10 bits does not start with 0 but end with 1

that means we fixed the first and last bit with 1.

then the num of such strings will be  2^8=256

3. given that,  a_n=5a_{n-1}-6a_{n-2} with  a_0=1, a_1=2

Now,

a_n=5a_{n-1}-6a_{n-2}=2a_{n-1}+3a_{n-1}-6a_{n-2}=2a_{n-1}+3\left ( a_{n-1}-2a_{n-2} \right ).............(1)

we have,  a_1-2a_0=0

then,  a_2=2a_1\Rightarrow a_2-2a_1=0

then  \Rightarrow a_3-2a_2=0 from (1)

\Rightarrow a_4-2a_3=0

similarly go on.

so we can say that,

a_n-2a_{n-1}=0\Rightarrow a_n=2a_{n-1}

Hence

a_n=2^n\cdot a_0=2^n\cdot 1=2^n

Add a comment
Know the answer?
Add Answer to:
(2 pts each) Find a different equivalent form of the statements. Justify your answers using Laws...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT