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
bekas [8.4K]
3 years ago
9

Which number satisfies the inequality? 3/11 < x <sqrt 0.25A. 30%B. 7/9​

Mathematics
1 answer:
olya-2409 [2.1K]3 years ago
4 0
Wait what do you mean
You might be interested in
anyone know how to do this?
Ugo [173]

Answer: A reasonable estimate of the minimum is 20.

8 0
3 years ago
Am I the only one whose parents yell their name and when you tell back yes mom they don’t answer?
arsen [322]
No your not the only one
6 0
3 years ago
Read 2 more answers
Part A
ozzi

Answer:

As the sucrose concentration is higher in the solution, the water in the balloon, where the sucrose is less concentrated, will tend to leave and try to dilute the outer solution until both sucrose concentrations are equal. But as the water leaves the balloon, the concentration inside will increase, so it will flow outside until both concentrations are equal and not until the outer concentration is similar to the initial concentration in the balloon.

Step-by-step explanation:

Hope this helps:)

3 0
3 years ago
The corporate team building event will cost $12 if it has three attendees if there are five attendees how much was a quaker team
Norma-Jean [14]

Answer:

Cost to arrange the event for 5 attendees will be $20.

Step-by-step explanation:

We have to solve this question by calculating the unit rates or unitary method.

Since cost to arrange corporate team building event for 3 attendees is = $12

Cost to arrange the event for 1 attendee will be = \frac{12}{3} = $4

Therefore, cost to arrange the event for five attendees will be = 5×4 = $20

4 0
4 years ago
Suppose that a password for a computer system must have at least 8, but no more than 12, characters, where each character in the
uranmaximum [27]

Part a)

There are 52 letters (26 lowercase and 26 uppercase), 10 digits, and 6 symbols. There are 52+10+6 = 68 different characters to choose from.

  • If there are 8 characters for this password, then we have 68^8 = 4.5716 * 10^14 different passwords possible.
  • If there are 9 characters, then we have 68^9 = 3.1087 * 10^16 different passwords
  • If there are 10 characters, then we have 68^10 = 2.1139 * 10^18 different passwords
  • If there are 11 characters, then we have 68^11 = 1.4375 * 10^20 different passwords
  • If there are 12 characters, then we have 68^12 = 9.7748 * 10^21 different passwords

Adding up those subtotals gives

68^8+68^9+68^10+68^11+68^12 = 9.9207 * 10^21

different passwords possible.

<h3>Answer: Approximately 9.9207 * 10^21 </h3>

======================================================

Part b)

Let's find the number of passwords where we don't have a special symbol

There are 52+10 = 62 different characters to pick from

  • If there are 8 characters for this password, then we have 62^8 = 2.1834 * 10^14 different passwords possible.
  • If there are 9 characters, then we have 62^9 = 1.3537 * 10^16 different passwords
  • If there are 10 characters, then we have 62^10 = 8.3930 * 10^17 different passwords
  • If there are 11 characters, then we have 62^11 = 5.2037 * 10^19 different passwords
  • If there are 12 characters, then we have 62^12 = 3.2263 * 10^21 different passwords

Adding those subtotals gives

62^8+62^9+62^10+62^11+62^12 = 3.2792 * 10^21

different passwords where we do not have a special character. Subtract this from the answer in part a) above

( 9.9207 * 10^21)  - (3.2792 * 10^21) = 6.6415 * 10^21

which represents the number of passwords where we have one or more character that is a special symbol. I'm using the idea that we either have a password with no symbols, or we have a password with at least one symbol. Adding up those two cases leads to the total number of passwords possible.

<h3>Answer: Approximately 6.6415 * 10^21</h3>

======================================================

Part c)

The answer from part a) was roughly 9.9207 * 10^21

It will take about 9.9207 * 10^21  nanoseconds to try every possible password from part a).

Divide 9.9207 * 10^21  over 1*10^9 to convert to seconds

(9.9207 * 10^21 )/(1*10^9) = 9,920,700,000,000

This number is 9.9 trillion roughly.

It will take about 9.9 trillion seconds to try every password, if you try a password per second.

------

To convert to hours, divide by 3600 and you should get

(9,920,700,000,000)/3600 = 2,755,750,000

So it will take about 2,755,750,000 hours to try all the passwords.

------

Divide by 24 to convert to days

(2,755,750,000)/24= 114,822,916.666667

which rounds to 114,822,917

So it will take roughly 114,822,917 days to try all the passwords.

------

Then divide that over 365 to convert to years

314,583.334246576

which rounds to 314,583

It will take roughly 314,583 years to try all the passwords

------------------------------

<h3>Answers:</h3>
  • 9.9 trillion seconds
  • 2,755,750,000 hours
  • 114,822,917 days
  • 314,583 years

All values are approximate, and are roughly equivalent to one another.

5 0
3 years ago
Other questions:
  • 15x+100=82 (has pic)
    15·2 answers
  • X - 2y = -10 find the x and y intercepts
    13·1 answer
  • Find the quantity represented by each percent <br> 45% of 96 quarts(usa quarts)
    14·1 answer
  • 20 hours put into degrees
    14·1 answer
  • Find the equation of the linear relationship.<br><br><br><br> Help plz :)
    7·2 answers
  • Expression 9(2j + 7 + 5j).
    10·1 answer
  • How many solutions does the equation below have?
    13·1 answer
  • A and B are friends and their ages differ by 4 years, A being the elder. A's father D, is twice as old as A, and B is twice as o
    10·1 answer
  • Can someone explain this to me pls
    14·2 answers
  • Which equation represents a line that passes through the two points in the<br> table?
    7·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!