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
Tanya [424]
3 years ago
8

Draw a model to show 35 1/3

Mathematics
1 answer:
katen-ka-za [31]3 years ago
6 0
I think this is the answer. if not sorry

You might be interested in
Solve the system by substitution. -4.5-2y=-12.5 , 3.35x-y=-0.75
goldenfox [79]
First, we solve for y in the first equation:
-2y = -12.5 +4.5
-2y=-8
y= \frac{8}{2}
y=4
Then, we substitute the y value in the other equation and solve for x:
3.35x-(4)=-0.75
3.35x=-0.75+4
3.35x=3.25
x= \frac{3.25}{3.35}
x= \frac{65}{67}

6 0
3 years ago
Read 2 more answers
In your sock drawer you have 4 blue, 5 gray, and 3 black socks. half asleep one morning you grab 2 socks at random and put them
timofeeve [1]

you will have 1/4 or 25% probability to pick a black sock because

4 blue socks + 5 gray socks + 3 black socks = 12 socks. but you need to pick one of the 3 black socks so 3 out of 12 or 3/12. simplify to 1/4

6 0
3 years ago
You are going to paint a six-sector spinner. There are 4 colors to choose from. How many different ways can you paint the spinne
emmainna [20.7K]

Using the Fundamental Counting Theorem, it is found that there are 648 ways to paint the spinner.

<h3>What is the Fundamental Counting Theorem?</h3>

It is a theorem that states that if there are n things, each with n_1, n_2, \cdots, n_n ways to be done, each thing independent of the other, the number of ways they can be done is:

N = n_1 \times n_2 \times \cdots \times n_n

In this problem, we have that the first sector can be painted in any of the 4 colors, the others until the 5th can be painted in 3 colors(not the adjacent), and the sixth in only 2, as it is adjacent to both the 5th and the 1st sectors, hence:

n_1 = 4, n_2 = n_3 = n_4 = n_5 = 3, n_6 = 2

Hence the number of ways is given by:

N = 4 x 3 x 3 x 3 x 3 x 2 = 648.

More can be learned about the Fundamental Counting Theorem at brainly.com/question/24314866

#SPJ1

4 0
1 year ago
Negativo
liubo4ka [24]

Answer:

noooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooo

Step-by-step explanation:

5 0
3 years ago
When entering large numbers in the answer box, do not use commas. For example, enter 1276400‎ for the number 1,276,400. Do not e
Ilia_Sergeevich [38]

Answer:

The answer is 12500....

Step-by-step explanation:

We have been asked that what is the sum of 9260 and 3240?

The sum of two numbers is the result you obtain by adding the two numbers together.

Addition is the mathematical process of putting things together. The plus sign "+" shows  that numbers are added together. We start adding the numbers from right hand side.

We have two values 9260 and 3240. We will add these two values together.

  9  2   6   0

+ 3  2   4   0

__________

 12 5   0   0

Thus the answer is 12500....

 

5 0
3 years ago
Other questions:
  • 0.4166666667 as a fraction
    8·1 answer
  • 75% of ? = 30 helppp
    11·2 answers
  • Gragh the image of the figure after a dilation with a scale factor of 1/4 centered at (5, -5) please help
    15·1 answer
  • What is 2/9 as a decimal ?
    11·2 answers
  • Toms package weights three more pounds then twice the weight of Momos package. Altogether it equals 15 pounds.
    9·1 answer
  • a city has a population of 45,000. Its decreasing by 2% per year. what will population be after 15 years
    13·1 answer
  • Fabian harvests 10 pounds of tomatoes from his garden. He needs 225 pounds to make a batch of soup. If he sets aside 2.8 pounds
    15·1 answer
  • I need help pleaaseeeee
    12·1 answer
  • How many solutions does the following equation have? -3z + 9 -2z = -12 - 5z
    14·1 answer
  • Is this right? and do you use not use the x-intercepts?
    7·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!