Write a regular expression for the language of all strings over {a, b} in which every b is directly preceded by a, and may not be directly followed by more than two consecutive a symbols.

step-by-step explanation:

111

step-by-step explanation:

the answer is (-8,-5)

step-by-step explanation:

the endpoint to midpoint is half the length. the length is (-2,-1) so when you are at the midpoint just add it to it to find your answer -6+(-2)= -8 and -4+(-1)=-5 so (-8,-5)

the solution of the equation is 2.23 ⇒ answer b

step-by-step explanation:

* lets revise the meaning of exponential function

- the form of the exponential function is y = ab^x, where a ≠ 0, b > 0 ,  

  b ≠ 1, and x is any real number

- it has a constant base b

- it has a variable exponent x

- to solve an exponential equation, take the log or ln of both sides,  

  and solve for the variable

* lets solve the problem

∵

- the base is 7 and the exponent is x

- insert ㏑ in both sides

∴

- use the rule

∴ x ㏑(7) = ㏑(77)

- to find x divide both sides by ㏑(7)

∴

* the solution of the equation is 2.23 to the nearest 2 decimal places