G For relatively small values of n, algorithms with larger orders can be more efficient than algorithms with smaller orders. Use a graphing calculator or computer to answer this question. For what values of n is an algorithm that requires n operations more efficient than an algorithm that requires ⌊50 log2(n)⌋ operations? (Assume n is an integer such that n > 1.)

Can i get some on 18,20,& 22? or one of them

The polynomial 10x3 + 35x2 - 4x - 14 is factored by grouping. 10x3 + 35x2 - 4x - 14 5x )-20 what is the common factor that is missing from both sets of parentheses?

Martha has a deck of cards. she has lost some of the cards, and now the deck only contains nine spades, eleven diamonds, eight clubs, and twelve hearts. martha predicts that whenever she draws a card from the deck without looking, she will draw a club one-fifth of the time. which activity would best allow martha to test her prediction? a. randomly draw a card from the box and see if it is a club. b. randomly draw a card. then, continue to draw another card until all eight clubs are drawn. c. randomly draw and replace a card 120 times. then, observe how close to 30 times a club is drawn. d. randomly draw and replace a card 100 times. then, observe how close to 20 times a club is drawn.