A soccer team played 160 games and won 65 percent of them. How many games did it win ? Please show work

2 answers:

7 0

To find the percent of games the soccer team won, you would do 160 multiplied by 0.65, because if you were to convert the 65% into a decimal, you would get 0.65. Notice the key word, "of". This refers to multiplication. So when doing 160*0.65, you get 104 games won. Therefore the soccer team won 104 of their games.

Hope this helps! :D Feel free to ask more questions, or ask me questions about my explanation.

Soloha48 [4]3 years ago

3 0

160x.65 = 104 , they won 104 games

You might be interested in

A 52 foot building casts a shadow that is 48 feet long, At the same time the shadow cast by a nearby statue 18 feet long .

8_murik_8 [283]

Answer: 14 feet

Step-by-step explanation: the difference between the shadow of the building and the building is 4 feet so the difference between the shadow of the statue and the statue is 4 feet so the answer is 14 feet.

8 0

1 year ago

A building engineer analyzes a concrete column with a circular cross section. The circumference of the column is 18 \pi18π18, pi

Whitepunk [10]

Answer:

$A=81\pi $ m^2$

Step-by-step explanation:

Circumference of the column $=18\pi $ meters$

Circumference of a circle $=2\pi r$

Therefore:

$2\pi r =18\pi $ meters\\2r=18\\r=18 \div 2\\$Radius, r=9 meters$

Area of a Circle $=\pi r^2$

Since radius of the cross section of the column =9 meters

Area of the cross section of the column

$=\pi *9^2\\=81\pi $ m^2$

5 0

3 years ago

tensor-on-tensor regression: riemannian optimization, over-parameterization, statistical-computational gap and their interplay

Contact [7]

The purpose of the tensor-on-tensor regression, which we examine, is to relate tensor responses to tensor covariates with a low Tucker rank parameter tensor/matrix without being aware of its intrinsic rank beforehand.

By examining the impact of rank over-parameterization, we suggest the Riemannian Gradient Descent (RGD) and Riemannian Gauss-Newton (RGN) methods to address the problem of unknown rank. By demonstrating that RGD and RGN, respectively, converge linearly and quadratically to a statistically optimal estimate in both rank correctly-parameterized and over-parameterized scenarios, we offer the first convergence guarantee for the generic tensor-on-tensor regression. According to our theory, Riemannian optimization techniques automatically adjust to over-parameterization without requiring implementation changes.

Learn more about tensor-on-tensor here

brainly.com/question/16382372

#SPJ4

7 0

2 years ago

What is the value of x?

alexandr402 [8]

What is the equation?

8 0

3 years ago

Please help!!...............................

Airida [17]