Question

5.   Consider base 2.  What is log 128  What is log 256  what is log 64...

5.   Consider base 2.

 What is log 128

 What is log 256

 what is log 64

What is log 32

 

6.   Draw the diagram showing a function is injective

 

7.  Draw the diagram showing a function surjective

 

8.  What is the

     floor of  sqrt ( 2)  =   

     ceiling of 28/6,   = 

     floor of  sqrt ( 5 ) =

     ceiling of 32/3 =

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

`Hey,

Note: Brother if you have any queries related the answer please do comment. I would be very happy to resolve all your queries.

5)

a)

log(128)=log(2^7)=7*log(2)

We know that log(2) is 1

So,

log(128)=7

b)

log(256)=log(2^8)=8*log(2)

We know that log(2) is 1

So,

log(256)=8

c)

log(64)=log(2^6)=6*log(2)

We know that log(2) is 1

So,

log(64)=6

d)

log(32)=log(2^5)=5*log(2)

We know that log(2) is 1

So,

log(32)=5

Note: Brother According to HomeworkLib's policy we are only allowed to answer first 4 part if there are many. So, I request you to post other part as separate posts.

Kindly revert for any queries

Thanks.

Add a comment
Know the answer?
Add Answer to:
5.   Consider base 2.  What is log 128  What is log 256  what is log 64...
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
  • Please detail all your answers 2. Consider the function f : {1, 2, 3, 4, 5}...

    Please detail all your answers 2. Consider the function f : {1, 2, 3, 4, 5} → {1, 2, 3, 4} given by the table below: (15 points) x 1 2 3 4 5 f (x) 3 2 4 1 2 (a) Is f injective? Explain. (b) Is f surjective? Explain. (c) Write the function using two-line notation. 5. In the game of Hearts, four players are each dealt 13 cards from a deck of 52. Is this a function?...

  • 5. Let A = P(R). Define f : R → A by the formula f(x) =...

    5. Let A = P(R). Define f : R → A by the formula f(x) = {y E RIy2 < x). (a) Find f(2). (b) Is f injective, surjective, both (bijective), or neither? Z given by f(u)n+l, ifn is even n - 3, if n is odd 6. Consider the function f : Z → Z given by f(n) = (a) Is f injective? Prove your answer. (b) Is f surjective? Prove your answer

  • 6. Find the value of y a. log, 3) = y b. log, = y log...

    6. Find the value of y a. log, 3) = y b. log, = y log (1125) = y d. 10° = y 15 =y 1 e 50 9. 200 7. Given the function and t f(0) = 2 g(x) = 5* Draw the 2 function. Which one grows faster with increasing & 8. Plot f(x) = log, (x) = y log2 (L) =y and g(x) =

  • 2. The mergesort is a recursive sort. What is the base case for the merge sort?...

    2. The mergesort is a recursive sort. What is the base case for the merge sort? A.There is none. B. When right = left -1 C. When start = end D. When end - start = 1 3. Given the array [ 23, 83, 82, 92, 28, 21, 91, 17, 54, 32, 41, 14], what is the value of mid for the call mergesort (elements, 0, 5, temp) ? A. The value of mid is 3 B. The value of...

  • Please answer this question and it’s subparts 3. (25 points) Part I11: Functions a. (7 pts)...

    Please answer this question and it’s subparts 3. (25 points) Part I11: Functions a. (7 pts) Consider functions f and g with the same domain X and co-domain Y, eg, f : X → Y and gX -Y. Must it be true that fng is a function? Why or why not? glx) b. (4 pts) Draw an arrow diagram for a function that is injective but not surjective. ほ, v/ c. (15 pts) Let S be the set of all...

  • 11. What is the probability of a family of 6 consisting of 4 girls and 2...

    11. What is the probability of a family of 6 consisting of 4 girls and 2 boys? с. 1/64 d. 1/256 b. 15/64 vet yadt e. 15/32 a. 10/128 11 GA bns sA e far an.

  • C) Find the smallest ? so that ?(?) = 7?2(log ?)3 + 2?4 + 3(log ?)2...

    C) Find the smallest ? so that ?(?) = 7?2(log ?)3 + 2?4 + 3(log ?)2 is ?(??) d)Prove whether or not the program segment ?≔3 ?≔?−?+2 ?? ? > 0 ???? ?≔?+3 ???? ?≔2 is partially correct with respect to the initial assertion ? = 4 and the final assertion ? = 6 e) Consider the following recurrence relation: What is ?(8)? f) Let ?(?) be the recurrence relation defined by ?(?)=?(?−1)2 +??(?−2)for?≥2 Find ?(3) ?(?) = 3? (?)...

  • Discrete math for Computer Science, Sets: Binary relations / Functions Please show work 2. Let S...

    Discrete math for Computer Science, Sets: Binary relations / Functions Please show work 2. Let S = {0, 2, 4, 6), and T-1, 3, 5, 7). Determine whether each of the following sets of ordered pairs is a function from S to T. If so, is it injective, surjective, and bijective?

  • Draw the graph of f(x) = – 64 – 1 10+ 9 8 7 6 5...

    Draw the graph of f(x) = – 64 – 1 10+ 9 8 7 6 5 3 2 1 10 -9 -8 -7 -6 -5 -4 -3 -2 - / - 1 1 2 3 4 5 6 7 8 9 10 N -3 -4 -5 -6 -7 -8 -9 1A

  • Given sequence: .03125, .125, .5, 2, 8, 32, 128, 512, … What is the value of...

    Given sequence: .03125, .125, .5, 2, 8, 32, 128, 512, … What is the value of the seed or first term (t1) in this sequence? t1 =

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