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
Taya2010 [7]
4 years ago
13

An octagonal pyramid ... how many faces does it have, how many vertices and how many edges? A triangular prism ... how many face

s does it have, how many vertices and how many edges? a triangular pyramid ... how many faces does it have, how many vertices and how many edges?
Mathematics
1 answer:
ser-zykov [4K]4 years ago
6 0

1: 8 faces and 9 with the base 9 vertices and 16 edges

2: 3 faces and 5 with the bases 6 vertices and 9 edges

3: 3 faces and 4 with the base 4 vertices and 6 edges

Hope this can help you.

You might be interested in
Help what’s the answer
Keith_Richards [23]

Answer: A. Vertical angles

Step-by-step explanation:

They are vertically opposite angles.

Correct me if I am incorrect.

7 0
3 years ago
Michaels, Inc., purchased a machine for $75,000. The machine has a useful life of five years and no salvage value. Straight-line
bogdanovich [222]
The net will be 0.0909
6 0
3 years ago
Read 2 more answers
-6+(-2)= <br> plzz help meeeeee
shtirl [24]
-6-2
Answer: it should be -8
6 0
3 years ago
Read 2 more answers
I can be here to help so ask for help
Artyom0805 [142]

Answer:

ok thanks for being here

Step-by-step explanation:

7 0
3 years ago
Give a combinatorial proof that if n is a positive integer, then
gregori [183]

The Empire is attacking a Rebel base that is stocked with n X-wings and n Y-wings. The Rebels need to build a fleet consisting of n ships (with at least 1 X-wing), to be led by 1 pilot in an X-wing.

There are \binom n1=n ways of picking the leader, and \binom{2n-1}{n-1} ways of building the rest of the fleet, so there's a total of

n\dbinom{2n-1}{n-1}

ways of building such a fleet.

In the other direction, suppose we build a fleet comprising of k X-wings and n-k Y-wings. We have \binom nk ways of picking X-wings and \binom n{n-k} ways of picking Y-wings. Also from the k X-wings we pick 1 to be the leader, which we can do in \binom k1=k ways. So there are

k\dbinom nk\dbinom n{n-k}

ways of building such a fleet. But since

\dbinom nk=\dbinom n{n-k}, we have

k\dbinom nk^2

ways of building the fleet with these specifications. Sum over all possible values of k,

\displaystyle\sum_{k=1}^nk\binom nk^2

4 0
4 years ago
Other questions:
  • Find the product. (7x-2) (x+y)
    12·2 answers
  • Helppppppppppppppppppppppppppppppppppppppppppppppppppppp
    11·1 answer
  • Last question of the day!!
    6·1 answer
  • Find the value of x.<br><br><br>m∠IHG = 162°<br><br>m∠IHK = (4x + 4)°<br><br>m∠KHG = (8x + 2)°
    6·2 answers
  • A boy throws a baseball across a field. The ball reaches its maximum height, 18 meters, after 1 second. After approximately 2.3
    11·1 answer
  • ​A sprinkler sprays a radius of 20 feet and rotates 120 degrees, what area of the lawn is covered by the sprinkler?
    15·1 answer
  • Is the equation y = |x-4| linear or not?
    13·1 answer
  • M is the midpoint of AD.
    6·1 answer
  • Sophie is training for the triathlon. She swims 40 meters in 50 secs, moving at a constant speed. Sophie wants to know her rate
    13·1 answer
  • Pls help me simplify
    11·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!