Do you think I could just leave this part blank and it'd be okay? We're just going to replace the whole thing with a header image anyway, right?
You are not logged in.
Pages: 1
Hi, till next Saturday I need to proof this:
1) If you split any n-angle with diagonals (they don't cross each other) you will receive always n-2 triangles.
2) Every segment within a parallelogram, crossing the centre of the figure will be split in the centre by 2.
3) 2 exact four-angles have been located to touch each other with one same segment. Proof that the other 3 segments of the four-angles will be parallel within each other.
4) In a hexagon two pairs of parallel and equal segments exist. Proof that the last pair is also equal and parallel and that all diagonals will meet in one point.
1) Think about what happens if you add a diagonal, and use induction to formalize it. Particularly, consider that any other diagonal added (since they don't cross each other) must be splitting one of the 2 shapes that the original one has been divided into.
Offline
1) Think about what happens if you add a diagonal, and use induction to formalize it. Particularly, consider that any other diagonal added (since they don't cross each other) must be splitting one of the 2 shapes that the original one has been divided into.
If I add a diagonal in any n-angle i will have 2 new forms: k-angle and (n-k)-angle but that doesn't help me.
Pm me with anything math related please
Offline
Ratburntro44 wrote:1) Think about what happens if you add a diagonal, and use induction to formalize it. Particularly, consider that any other diagonal added (since they don't cross each other) must be splitting one of the 2 shapes that the original one has been divided into.
If I add a diagonal in any n-angle i will have 2 new forms: k-angle and (n-k)-angle but that doesn't help me.
It's actually going to be (k+1) and (n-k+1); the diagonal you added is also a side to both of these. Given this, and assuming the proposition holds true for the smaller ones, you get those to split into (k-1) and (n-k-1) triangles. This adds up to (n-2), no matter how you did the initial diagonal. Think about how that step can be used to prove it.
Offline
MrJaWapa wrote:Literally who gives a ****
Literally everybody who uses a toilet.
some people use toilets as salad drainers
Offline
N1KF wrote:MrJaWapa wrote:Literally who gives a ****
Literally everybody who uses a toilet.
Are you trying to tell me that people that dont use a toilet dont ****?
The cultured people of India have designated **** streets and public beaches.
*u stinky*
Offline
Offline
The cultured people of India have designated **** streets and public beaches.
Also India is famous for it's great mathematicians! How cool we got back on topic
Offline
Also India is famous for it's great mathematicians! How cool we got back on topic
Compare the amount of woots from you to everybody else that made jokes :c
Offline
Pages: 1
[ Started around 1739332015.4652 - Generated in 0.135 seconds, 12 queries executed - Memory usage: 1.66 MiB (Peak: 1.86 MiB) ]