1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
Firlakuza [10]
3 years ago
13

What is your favorite anime of all time? Mine's is One Piece and it is a really goated.

Mathematics
2 answers:
yarga [219]3 years ago
8 0

Answer:

i dont really have a favorite but i like naruto, haikyu nd a few others but i dont remember them.

Step-by-step explanation:

9966 [12]3 years ago
5 0

Answer:

mine are one piece and samurai champloo!

Step-by-step explanation:

You might be interested in
Which number is closest to the
disa [49]
I think it is D
Hope my answer help you?
5 0
2 years ago
Read 2 more answers
Part A
rjkz [21]

Answer:

Step-by-step explanation:

Part A

Solve 4,500 ÷ 90. Enter your answer in the box.

 

Answer : 50

Part B

Select all the expressions that are equal to 4,500 ÷ 90.

A. 4,500 ÷ 9 tens  ✔️

B. 450 ÷ 90  ❌

C. 450 ÷ 9  ❌

D. 4,500 ÷ 9  ❌

E. 4,500 ÷ 90 tens ❌

8 0
2 years ago
A) Find a recurrence relation for the number of bit strings of length n that contain a pair of consecutive 0s.
Fed [463]

Answer:

A) a_{n} = a_{n-1} + a_{n-2} + 2^{n-2}

B) a_{0} = a_{1} = 0

C)   for n = 2

  a_{2} = 1

for n = 3

 a_{3} = 3

for n = 4

a_{4} = 8

for n = 5

a_{5} = 19

Step-by-step explanation:

A) A recurrence relation for the number of bit strings of length n that contain a  pair of consecutive Os can be represented below

if a string (n ) ends with 00 for n-2 positions there are a pair of  consecutive Os therefore there will be : 2^{n-2} strings

therefore for n ≥ 2

The recurrence relation for the number of bit strings of length 'n' that contains consecutive Os

a_{n} = a_{n-1} + a_{n-2} + 2^{n-2}

b ) The initial conditions

The initial conditions are : a_{0} = a_{1} = 0

C) The number of bit strings of length seven containing two consecutive 0s

here we apply the re occurrence relation and the initial conditions

a_{n} = a_{n-1} + a_{n-2} + 2^{n-2}

for n = 2

  a_{2} = 1

for n = 3

 a_{3} = 3

for n = 4

a_{4} = 8

for n = 5

a_{5} = 19

7 0
3 years ago
The current population of a small town is 10,500, and its population is expected to grow at a rate of 5% per year. Which of the
FromTheMoon [43]

Answer:

f(x) = 10,500 x 1.05^t

8 0
3 years ago
Can someone help me with this
Phantasy [73]

These are the the letters that look the same when reflected across the line B,C,D,E,H,I,K,O,X

8 0
2 years ago
Read 2 more answers
Other questions:
  • A guy-wire is attached from the ground to the top of a pole for support. If the angle of elevation to the pole is 67° and the wi
    8·1 answer
  • I really need help on this can someone help me please!!!!
    13·1 answer
  • Which equation matches the graph of the greatest integer function given below?? help pleaze
    15·2 answers
  • WRITE AN EQUATION IN POINT SLOPE FORM FOR THE LINE THROUGH THE GIVEN POINT WIHT THE GIVEN SLOPE (-10,-6): M=-5/8
    11·2 answers
  • carolina has 55 guppies in her fish tank she gives 28 guppies to her friend the num ner ig guppies remaining is three times the
    15·1 answer
  • I need help plz. Can you explain it to me. I have a test tommorow but I am confused.
    7·2 answers
  • How to square root this equation
    12·1 answer
  • Which expression is equivalent to the following complex fraction?
    11·1 answer
  • Please help me with this problem :) <br> show ur work please
    7·1 answer
  • Pythagorean theorem !
    15·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!