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
Eddi Din [679]
3 years ago
7

Please answer please correct question

Mathematics
2 answers:
Aleksandr [31]3 years ago
5 0

Answer:

EFB is the angle that is adgacent

siniylev [52]3 years ago
3 0

Answer:

angle AFB

Step-by-step explanation:

Adjacent means next to, so let’s imagine this as sharing a fence with your next door neighbor.

What side does EFA share with?

It shares it with AFB.

That‘s it!

Hope this helped!

You might be interested in
Please help what is the area?
ratelena [41]

Answer: 70 square units

6 0
4 years ago
Factorise the following questions
lesya692 [45]

Answer:

ii)

\sqrt{2} x^{2}  + 3x +  \sqrt{2}   \\  =  \sqrt{2}x(x +  \sqrt{2} ) + x +  \sqrt{2} \\  = ( \sqrt{2} x + 1)(x +  \sqrt{2} )

7 0
3 years ago
What value of "v" makes 12 = 12 + v ÷ 8 a true statement?
Anni [7]

Answer:

v = 0

Step-by-step explanation:

12 = 12 + v / 8

0 = 1/8v

v = 0

8 0
4 years ago
A cryptographic hash takes a message as input and produces a fixed-length string as output, called the digital fingerprint. A br
Allushta [10]

Answer:

1.85x10^{19} attempts are required to find a matching pair if the digital fingerprint is 64 bits long.

3.40*10^{38} attempts are required to find a matching pair if the digital fingerprint is 128 bits long.

Step-by-step explanation:

Each bit has two options. So

How many attempts are required to find a matching pair if the digital fingerprint is 64 bits long?

So for each of the 64 bits, we have the following number of options.

2 - 2 - 2 - 2 -... - 2

So, in all, there are

T = 2^{64} = 1.85x10^{19}

options.

So, 1.85x10^{19} attempts are required to find a matching pair if the digital fingerprint is 64 bits long.

128 bits long?

Using the same logic as the first question.

T = 2^{128} = 3.40*10^{38}

So, 3.40*10^{38} attempts are required to find a matching pair if the digital fingerprint is 128 bits long.

5 0
3 years ago
I need help with this!!!!
Ira Lisetskai [31]

Answer:

  D:  2/4

Step-by-step explanation:

Usually when we talk about a point partitioning a segment, we are interested in the ratio of the first segment to the second:

  BC : CD = 2 : 2 = 1 : 1

Since this is not an answer choice, we need to "reverse engineer" the answer list to see if we can find an answer that corresponds to a reasonable interpretation of the question.

__

None of the segments is 3 units long, so neither of answer choices A or B makes any sense.

While segment BD is 4 units long, there is no segment that is 1 unit long, so answer choice C makes no sense, either.

There are segments that are 2 units long and a segment that is 4 units long, so if we interpret the question to be "what is the ratio of BC to BD?" then answer choice D is appropriate.

4 0
3 years ago
Other questions:
  • If the shape in the diagram rotates about the dashed line, which three-dimensional object will be formed?
    6·3 answers
  • $1 = £0.71. Change $530 into £.
    7·2 answers
  • Provide reasons for the statements.<br>(Thank you!)​
    13·1 answer
  • Simplify and solve<br><br><br><br><br>a x= -16<br> b x = -10<br>c x=10<br>d=16​
    6·1 answer
  • Help me with correct answer
    9·2 answers
  • HELP!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
    6·1 answer
  • A cube with the number 1,2, 3, 4, 5 and 6; what is the probability of getting an even number?
    11·1 answer
  • Amy is making a cake that calls for a 5/6 cup of crushed graham crackers. If she had already crushed 1/2 cup, how much more does
    14·1 answer
  • La tercera parte, de la quinta parte de √225
    9·1 answer
  • What is the surface area of the rectangular prism below?
    13·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!