9514 1404 393
Answer:
13/18
Step-by-step explanation:
5 of the 18 students have a cat, so 13 of them do not.
The probability that a student in the group does not have a cat is 13/18.
Answer:
$160
Step-by-step explanation:
Diane sold some stuffs at a garage sale.
Let the total value of the money Diane made = x
She spent one-half of the money she made on a new bicycle.
Amount spent on a Bicycle = 1/2 × x = 1/2x
Next,
Amount left
= x - 1/2x = 1/2x
She spent one-half of what was left on a portable stereo.
Amount spent spent on Portable stereo
= 1/2 × 1/2x
= 1/4x
If Diane had $40.00 left,
Hence:
The fraction of what was left is calculated as:
= x - (1/2x + 1/4x)
= x - (3/4x)
= 1/4x
Hence:
1/4x = $40
We can find the value of x now.
1/4 × x = $40
x/4 = $40
x = $40 × 4
x = $160
Therefore, the amount she made from the garage sale is $160
There are 10 mm in 1 cm, so 180 mm is really just 18cm and 60 mm is just 6cm.
so how much area each box's base takes up? 18x6 centimeters, or 108cm.
the shelf is a 65x35 so is 2275 centimeters in available area.
how many times does 108 go into 2275? well, 2275/108, that many would fit in the shelf
Answer:
1. 109
2. 29
3. 71
Step-by-step explanation:
1. since a triangle's interior angles always add up to 180, you can add 35 and 36 to get 71, then subtract that from 180 to find the third angle
2. the unnamed angle in triangle RUV is supplementary to <1.Supplementary angles are angle the add up to 180. So you can subtract 109 from 180 to find the unnamed angle. It is 71. Now you can repeat the steps in question one to find <2 in triangle RUV. You get that <2 is 29
3. Angle 3 and the unnamed angle are vertical angles. This means that they are opposite to each other and are congruent. This means that they have the same measure. Knowing that the unnamed angle is 71, we can say that angle 3 is also 71.
Answer:
c) there is an efficient algorithm to test whether an integer is prime
Step-by-step explanation:
The basis of modern cryptography is the fact that factoring large numbers is computationally difficult. No algorithm is efficient for that purpose.
<h3>Choices</h3><h3>a)</h3>
False - there is no known efficient algorithm for factoring large numbers
<h3>b)</h3>
False - there are 78,498 prime numbers less than 1,000,000. That is about 8% of them--far from being "most of the integers."
<h3>c) </h3>
True - a variety of algorithms exist for testing primality. In 2002, a test was published that runs in time roughly proportional to the 7.5 power of the logarithm of the number being tested.
<h3>d)</h3>
False - there is no known efficient algorithm for factoring large numbers
