What is 11/10 converted to a percent

Mathematics

2 answers:

hammer [34]3 years ago

6 0

110%
hope this helped!

nasty-shy [4]3 years ago

4 0

210 hope this helps you

You might be interested in

How many bit strings of length 10 do not contain the substring 00? In other words, how many strings of length 10, consisting onl

vova2212 [387]

Answer:

144

Step-by-step explanation:

For a bitstring of length n, there are Fibonacci(n+2) strings containing no two consecutive zeros. This can be seen by constructing the strings starting with n=1.

1-bit strings: 1, 0 -- 2 strings not containing consecutive 0s

2-bit strings: 11, 10, 01 -- 3 strings not containing consecutive 0s

Note that we have added 1 to all the 1-bit strings, and added 0 only to the string ending in 1.

3-bit strings: 111, 110, 101, 011, 010 -- 5 strings not containing consecutive 0s

Note that these 5 strings consist of all (3) of the 2-bit strings with 1 appended, and all (1) of the 2-bit strings ending in 1 with 0 appended. The number that now end in 0 is the number previously ending in 1.

If (x, y) represents the numbers of n-bit strings ending in (0, 1), then the number of (n+1)-bit strings ending in (0, 1) is (y, x+y). That is, the recursive relation is ...

$(x_1,y_1)=(1,1)\\(x_n,y_n)=(y_{n-1},\,x_{n-1}+y_{n-1})\\b_n=x_n+y_n\quad\text{number of n-bit strings without consecutive 0s}$