Total number of five letter strings formed by A,B,C and D with repetitions allowed
={4x4x4x4x4 = 4 power 5 = 1024
Now, fix BAD in a string at one place then we have 2 more places to be filled with 4 letters, total number of such strings
=4x4=16
Here, BAD can be at any of the 3 positions,
Hence the total number of strings with BAD in it
= 3 x 16=48
Now, The total number of strings not containing BAD
=1024-48
=976
Using 26 letters, the number of 5-letter words that can be formed when the letters are different is determined as follows: 26P5 = 26 × 25 × 24 × 23 × 22 = 7883600 different words.
Learn more about five-letter strings here:brainly.com/question/27134945
#SPJ4
Actually, 40 is divisible by 7. Any number is divisible by 7. However, 7 does not go into forty evenly. Your quotient would have a remainder since 7 cannot go into 40 an even number of times.
7 goes into 40 5 times evenly (7x5=35) 40-35 is five, so 40 divided by 7 is 5 (remainder 5)
~theLocoCoco
Answer:
$4785.68
Step-by-step explanation:
Original amount: <u>$</u><u>4</u><u>2</u><u>3</u><u>0</u>
Interest for 1 year: <u>4</u><u>.</u><u>2</u><u>%</u>
<em>First year;</em>
<em>S</em><em>e</em><em>c</em><em>o</em><em>n</em><em>d</em><em> </em><em>y</em><em>e</em><em>a</em><em>r</em><em>;</em>
<em>T</em><em>h</em><em>i</em><em>r</em><em>d</em><em> </em><em>y</em><em>e</em><em>a</em><em>r</em><em> </em><em>(</em><em>t</em><em>o</em><em>t</em><em>a</em><em>l</em><em> </em><em>b</em><em>a</em><em>l</em><em>a</em><em>n</em><em>c</em><em>e</em><em> </em><em>a</em><em>f</em><em>t</em><em>e</em><em>r</em><em> </em><em>3</em><em> </em><em>y</em><em>e</em><em>a</em><em>r</em><em>s</em><em>)</em><em>;</em>
Round the number;
<em><u>$4785.68</u></em>
YOUR ANSWER hope this helps :))
Answer:a<−13/3
b+10
Step-by-step explanation:
Step 1: Add -65b to both sides.
15a+65b+−65b<150+−65b
15a<−65b+150
Step 2: Divide both sides by 15.
15a
15
<
−65b+150
15
a<
−13
3
b+10
Answer:
a<
−13
3
b+10
2 over 7 =0,28
9/0,28=32,14
Hope it helped
