You are Here: Home >< Maths

# The Proof is Trivial! Watch

It's significantly more than that. Roughly, people get this wrong 95% of the time.
Oh yeh... I missed all them. Sack this, I'm not counting triangles.
Problem 230

How many triangles are there?

Attachment 225644

I think more mathematicians should be interested in cognitive psychology.
40

Spoiler:
Show
... base 16
Problem 230

How many triangles are there?

Attachment 225644

I think more mathematicians should be interested in cognitive psychology.
Same answer as LotF, but I'll provide a method.

Spoiler:
Show
Lower right corner limited to one "slice" is 4 triangles, combining to give 10 total. Hence 4 slices give 40. Symmetrically for the lower left corner but any triangle which uses the bottom-most pieces have already been counted, so 3 triangles combining to give 6 then times 4 slices gives 24. 40 + 24 = 64.
4. (Original post by Lord of the Flies)
40
Correct, (of course)!

(Original post by ukdragon37)
...
A nice way (maybe, I haven't actually tried it) would be to consider the triangle as a graph, rank the vertices and then try to count the 3-vertex cliques through subsequent edge contractions. Anyway, it's still too complicated.

Spoiler:
Show

You can obtain the recurrence for the number of ways to combine regions in the triangle when you have edges connecting its down-left vertex to the edge on the right. Solving it, you get . This can easily be proved by induction (once you know the formula). Then, by introducing edges from the down-right vertex on the left edge, you see that the total number of triangles is where are vertices on the right and on the left edge.

Plugging luckily gives , so the formula may be correct.

By the way, I didn't count in this way first and got slightly off the true number.
A nice way (maybe, I haven't actually tried it) would be to consider the triangle as a graph, rank the vertices and then try to count the 3-vertex cliques through subsequent edge contractions. Anyway, it's still too complicated.
But it's exactly how you would program a computer to do it! I'm not a theoretical computer scientist in the American (combinatorial) sense, so I'm pleasantly surprised I came up with a method that got it right.
Correct, (of course)!

A nice way (maybe, I haven't actually tried it) would be to consider the triangle as a graph, rank the vertices and then try to count the 3-vertex cliques through subsequent edge contractions. Anyway, it's still too complicated.

Spoiler:
Show

You can obtain the recurrence for the number of ways to combine regions in the triangle when you have edges connecting its down-left vertex to the edge on the right. Solving it, you get . This can easily be proved by induction (once you know the formula). Then, by introducing edges from the down-right vertex on the left edge, you see that the total number of triangles is where are vertices on the right and on the left edge.

Plugging luckily gives , so the formula may be correct.

By the way, I didn't count in this way first and got slightly off the true number.

I'm not sure how you did it, but I realized that you could do something like this:

Each vertex going up contains a certain number of triangles. (the verticies being the points of intersection).

There is a recurrence relationship, where you have 1(1) triangle, then 2(2) triangles, 3(3) triangles, 4(4) triangles. Then as you go higher up the value starts to decrease so you have one region with 3(5) triangles, one region with 2(6) triangles and one region with 1(7) triangles.

Is it just a coincidence that the maximum number of repeated triangles within a region where two lines intersect (i.e, there are 4 regions with 4 triangles) is the maximum number of regions of a certain value to the power of the the shape which is being used? As 4 regions is my most of a repeated value, and I've a triangle, it's 4^3? = 64. Maybe I'm spewing poppycock.
Problem 230

How many triangles are there?

Attachment 225644

I think more mathematicians should be interested in cognitive psychology.
I got 60.

Okay... apparently, I missed 4.
Problem 230

How many triangles are there?

Attachment 225644

I think more mathematicians should be interested in cognitive psychology.
25?
9. Let's stick something different into the thread..

Problem 231* (*** if you don't look at the spoiler)

Prove the annulus is homeomorphic to the cylinder

Spoiler:
Show
A glimpse into the geometric side of topology. A homeomorphism between two topological spaces says they are topologically identical, and consists of a pair of continuous functions , such that f and g are inverses of each other (more precisely, f(g(x)) = identity of C, g(f(x)) = identity of A). The question then is now simply to find such functions.
10. (Original post by Zakee)
Is it just a coincidence that the maximum number of repeated triangles within a region where two lines intersect (i.e, there are 4 regions with 4 triangles) is the maximum number of regions of a certain value to the power of the the shape which is being used? As 4 regions is my most of a repeated value, and I've a triangle, it's 4^3? = 64.
Your question is not very clear to me (i.e. why expect such a relation), but I will guess no.

(Original post by FireGarden)
Problem 231* (*** if you don't look at the spoiler)
Even if you look at the spoiler, it is still ***.
11. Which method of proof do you identify with?
12. (Original post by ukdragon37)
Which method of proof do you identify with?
I like the Dirac and Thermodynamical one
13. (Original post by ukdragon37)
Which method of proof do you identify with?
That is quite possibly the best thing I've ever read ever. And quite cutting edge given the time - in 1938, Quantum mechanics and Tauberian theorems were very much in their infancy in the 1930s. Love it.
14. (Original post by ukdragon37)
Which method of proof do you identify with?
Awesome!

My favourites are "The Method of Inverse Geometry" and "The Schrödinger Method"

However, I can't help but feel as though it could be dramatically expanded upon by including methods from philosophy...
15. I can't believe it.... ten thousand words of category theory, done and submitted. I never thought I'd be able to

Now to get some sleep.
16. Had a nice afternoon avoiding STEP and indulging in some IMO problems! These questions are from a paper sat by Timonthy Gowers and Imre Leader who got Gold (42/42) and Silver (37/42) respectively (where each question is work 7). Also note that, whilst most IMO problems nowadays are restricted to those who are comfortable with the techniques taught, these particular problems do not require such knowledge and so should be just as accessible to someone who has been preparing for a year as they would to someone who hasn't (though there are many intern ate solutions to each). Enjoy!

Problem 232
*/**

Let and consider all subsets of elements of the set . Each of these subsets has a smallest member.
Let denote the arithmetic mean of these smallest numbers.

Prove that .

Problem 233*/**

Determine that maximum value of , where and are integers satisfying and .

Edit: Another fun problem (not from IMO):

Problem 234*

Find all possible n-tuples of reals such that and for all

Problem 235*

Prove that
where n is a natural number greater than 1.
17. THE BOLZANO-WEIERSTRASS METHOD AND SCHRODINGER METHOD FOR ME.
18. Ok, I'll drop one of mine on here.

problem 238 *

Using methods encountered at A-level, find the mean value of f(x) over an interval [0,xa].
19. Problem 236 *

Find

Problem 237 */**

For the last one, there is an easier way than partial fractions.
20. Spoiler:
Show
(Original post by james22)
Problem 236 *
Find
Solution 236

Just by inspection really:

Spoiler:
Show
(Original post by hecandothatfromran)
Ok, I'll drop one of mine on here.
Using methods encountered at A-level, find the mean value of f(x) over an interval [0,xa].

Solution 238
I may be simplifying things too much here, but would it just be ?

TSR Support Team

We have a brilliant team of more than 60 Support Team members looking after discussions on The Student Room, helping to make it a fun, safe and useful place to hang out.

This forum is supported by:
Updated: December 11, 2017
Today on TSR

### Am I pregnant?

...or just paranoid?

### A robot wrote Harry Potter?

Discussions on TSR

• Latest
• ## See more of what you like on The Student Room

You can personalise what you see on TSR. Tell us a little about yourself to get started.

• Poll
Useful resources

### Maths Forum posting guidelines

Not sure where to post? Read the updated guidelines here

### How to use LaTex

Writing equations the easy way

### Study habits of A* students

Top tips from students who have already aced their exams

## Groups associated with this forum:

View associated groups
Discussions on TSR

• Latest
• ## See more of what you like on The Student Room

You can personalise what you see on TSR. Tell us a little about yourself to get started.

• The Student Room, Get Revising and Marked by Teachers are trading names of The Student Room Group Ltd.

Register Number: 04666380 (England and Wales), VAT No. 806 8067 22 Registered Office: International House, Queens Road, Brighton, BN1 3XE

Reputation gems: You get these gems as you gain rep from other members for making good contributions and giving helpful advice.