Please helpppp:( Thanks

A computer programmer's yearly income of $82,000 is increased by 6%. What is the dollar amount of the increase, and what is her

Vinvika [58]

The new yearly income is $86920.
Convert 6% into a decimal which is 0.06.
1ST METHOD:
82000*0.06=4290
4290+82000=86920
2ND METHOD:
0.06+1=1.06
82000*1.06=86920

4 0

3 years ago

Read 2 more answers

n social studies class, Cole is making a scale drawing of a flag. The flag measures 24 inches high by 36 inches wide, having thr

Ray Of Light [21]

The complete question in the attached figures

we know that

1 ft---------------> 0.083333 in

so
24 inches high--------------> 24*0.083333=2 ft
36 inches wide--------------> 36*0.083333=3 ft

we will analyze each drawing

drawing a) scale 1/4 in/ 1 ft ----------> (1/4)/1=1/4
for a high of 2 ft-------------> 2*(1/4)=0.5 in
for a wide of 3 ft-------------> 3*(1/4)=0.75 in
drawing a) is not solution

drawing b) scale 1/2 in/ 1 ft ----------> (1/2)/1=1/2
for a high of 2 ft-------------> 2*(1/2)=1 in
for a wide of 3 ft-------------> 3*(1/2)=1.5 in
drawing b) is not solution

drawing c) scale 1/2 in/ 1 ft ----------> (1/2)/1=1/2
for a high of 2 ft-------------> 2*(1/2)=1 in
for a wide of 3 ft-------------> 3*(1/2)=1.5 in
drawing c) is not solution

drawing d) scale 1 in/ 1 ft ----------> (1)/1=1
for a high of 2 ft-------------> 2*(1)=2 in
for a wide of 3 ft-------------> 3*(1)=3 in
drawing d) is a solution

the answer is
The correct model of the flag is the drawing D

8 0

3 years ago

Suppose that you pick a bit string from the set of all bit strings of length ten. Find the probability that a) the bit string ha

emmasim [6.3K]

Answer:

45/1024
1/4
15/128
193/512
9/512

Step-by-step explanation:

There are 2^10 = 1024 bit strings of length 10.

a) There are 10C2 = 45 ways to have exactly two 1-bits in 10 bits

p(2 1-bits) = 45/1024

__

b) Of the four (4) possibilities for beginning and ending bits (00, 01, 11, 10), exactly one (1) of those is 00.

p(b0=0 & b9=0) = 1/4

__

c) There are 10C7 = 120 ways to have seven 1-bits in the bit string.

p(7 1-bits) = 120/1024 = 15/128

__

d) ∑10Ck {for k=0 to 4} = 386 is the total of the number of ways to have 0, 1, 2, 3, or 4 1-bits in the string. If there are more than that, there won't be more 0-bits than 1-bits

p(more 0 bits) = 386/1024 = 193/512

__

e) The string will have two 1-bits if it starts with 1 and there is a single 1-bit among the other 9 bits. There are 9 ways that can happen, among the 512 ways to have 9 remaining bits.

p(2 1-bits | first is a 1-bit) = 9/512

6 0

3 years ago

What is the slope of the line that passes through the points (0, -4) and (30, – 9)?

Softa [21]

Answer:

-1/6

Step-by-step explanation:

the slope is -1/6

6 0

2 years ago

A bushel of apples weighs 42 pounds. There are 4 pecks in a bushel. It takes 2 pounds of apples to make one pie. How many pies c

umka2103 [35]

42/4=10.5 pounds in one bushel
10.5/2=5.25≈5 pies
It's possible to make 5 pies with one peck of apples

6 0

3 years ago