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
dimaraw [331]
3 years ago
13

Can someone please help me with math.

Mathematics
1 answer:
valentina_108 [34]3 years ago
6 0
The first one is B hope this helps
You might be interested in
Australian glitter ants reproduce so that their population doubles every 15 days. If there are 3 ants initially, the equation is
Firlakuza [10]

Answer:

  4.73%

Step-by-step explanation:

  y = 3×2^(t/15) = 3×(2^(1/15))^t = 3×1.0472941^t

In this form, ...

  1 +r = 1.0472941

  r = .0472941 ≈ 4.73%

The daily increase is about 4.73%.

5 0
3 years ago
V and 303 more equals 21
juin [17]
Answer: V= -282

Explanation: if you subtract 21 from 303 you end up with -282 and to recheck you can add -282 with 303 and the total would be 21.
5 0
3 years ago
I need Help please.....
Ira Lisetskai [31]

Answer:

what's up

Step-by-step explanation:

6 0
3 years ago
David wants to buy a large screen television that cost 1800$. If he buys it today ,he can save 30%.How much will the television
Irina-Kira [14]

Answer:

$1260

Step-by-step explanation:

70/100 × $1800 = $1260

3 0
3 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:
  • Find the missing length. Round to the nearest tenth, if necessary.<br><br>​
    5·1 answer
  • 686.924 rounded to the nearest ten
    14·2 answers
  • PLEASE HELP!!!!!
    5·1 answer
  • URGENT GEOMETRY MATH HELP 98 POINTS!!
    11·2 answers
  • Select the correct answer.<br> What is the slope of the line that goes through (-5,-5) and (5,-7)?
    7·1 answer
  • The sum of three consecutive natural numbers is 540, find the numbers.
    13·1 answer
  • What function is graphed below?<br><br><br><br> y = x + 4<br> y = 4x<br> y = 2x + 4<br> y = 3x + 2
    8·1 answer
  • the area of a regular hexagon is 100 units if all the dimensions were cut in half what would the new area be
    13·1 answer
  • Last month you spend $30 on clothing this month you spent 160% of what you spent last minute set up a proportion to model this s
    7·1 answer
  • Please help? 20 points!!!!!!!!!!!!!!!!!!
    9·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!