Geometry n Stuff
Level
pending
Given an n-edged 3-D Figure with n-vertices, find how many faces it must have at minimum.
The answer is 2.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
1 solution
Euler Characteristic states that for any 3-D shape
vertices - #edge + #face = 2
this is true for all 3-D shapes Therefore No of edge = n No of vertices = n Substitute it in the equation v-e+f=2 n-n+f=2 0+f=2 Therefore f=2 Thus there should be minimum 2 faces