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
MissTica
3 years ago
12

3.52 in expanded form

Mathematics
1 answer:
Scrat [10]3 years ago
6 0

Step-by-step explanation:

3.52 =

3

+ 0.5

+ 0.02

hopes this helps you

You might be interested in
A roller-rink floor is shown below. Each end is semi-circle. What is its area? Use t = 3.14
liubo4ka [24]

Answer:

6884

Step-by-step explanation:

8x8x5

7 0
3 years ago
Yung is designing a flashlight that uses a parabolic reflecting mirror and a light source. The shape of the mirror can be modele
mihalych1998 [28]
The general form for a parabolic dish is:

y=x^2/(4f), where f=focus' y coordinate when x=0

So if you are given the equation:

8y=x^2, you need only to rearrange it to the form y=x^2/(4f)

y=x^2/8

Since 8=4f, f=2 inches  and the focal point of course (0,2)
5 0
3 years ago
Read 2 more answers
14540(squared by2) x 35=?
natka813 [3]
Your answer is 739,940,6000
3 0
3 years ago
54.8 m= ? km? how did you solve? do you place the zeros in front or behind the number? where does my decimal go and why does it
Maru [420]
M is smaller than km
1000m=1km

so divide by 1000
basically move decimal 3 places to left
put zero in front
0.0548km
4 0
4 years ago
Suppose you have a complete, weighted graph with 8 vertices. How many Hamilton Circuits are there in this graph?
Natali5045456 [20]

The number of Hamilton Circuits with 8 vertices are 5040.

Given that, a complete, weighted graph with 8 vertices.

<h3>What are Hamilton Circuits?</h3>

A Hamiltonian circuit is a circuit that visits every vertex once with no repeats. Being a circuit, it must start and end at the same vertex. A Hamiltonian path also visits every vertex once with no repeats, but does not have to start and end at the same vertex.

For N vertices in a complete graph, there will be (n−1)!=(n−1)(n−2)(n−3)…3⋅2⋅1 routes. Half of these are duplicates in reverse order, so there are (n−1)!/2 unique circuits.

A complete graph with 8 vertices would have = 5040 possible Hamiltonian circuits. Half of the circuits are duplicates of other circuits but in reverse order, leaving 2520 unique routes.

Therefore, the number of Hamilton Circuits with 8 vertices are 5040.

Learn more about the Hamilton Circuits here:

brainly.com/question/24725745.

#SPJ1

7 0
1 year ago
Other questions:
  • I want to paint a paint a parallelogram shaped area that has a base of 12 feet and a height of 4 feet. It cost 3.90$to cover one
    15·1 answer
  • What is -7.08 as a fraction or mixed number
    14·1 answer
  • What two numbers multiply to -112 and add up to -54
    10·2 answers
  • What is the value of sin C? <br><br> A) 8/15<br> B)8/17<br> C)15/8<br> D)15/17
    15·1 answer
  • Suppose the radius of a circle is 4. What is its area?
    9·1 answer
  • Please help!!!<br><br> This is my measurement homework
    11·1 answer
  • What is the answer to p(8 and A)
    9·1 answer
  • Is the spinner described below a fair spinner? If yes, explain why. If not describe a change that could make the spinner fair
    12·1 answer
  • Determine whether the given value is a solution to the equation.
    10·2 answers
  • Noah has $5.
    10·2 answers
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!