# Maths Paper

## Recommended Posts

I heard that algebra is a constant for all dimensional space.

I know geometry is rejected, and what other are also constants?

##### Share on other sites
nope. i think an average 7th year can solve a simple problem is group theory,.

I would definately like to know what you call simple in that case.

Even the basic examples of groups such as symmetric groups and quternian groups would be hard to explain.

##### Share on other sites

i dont know. something like showing that a cyclic group with finite order is Abelian. or something like that.

##### Share on other sites

I agree that the proofs to such results may appear to most to be quite trivial, but they certainly don't constitute any substantial part of group theory. The fact is you won't be able to prove something that you can't fully understand, and to make a school student understand and appreciate fully the beauty of group theory is far from an easy task.

As I said earlier, even the simplest examples are beyond the scope of school curiculum.

##### Share on other sites
i dont know. something like showing that a cyclic group with finite order is Abelian. or something like that.

Think about it: if you'd been given that problem at A-level, you'd probably have gone "wtf?!?" We've had a couple of terms to get used to the idea of university mathematics, and it's a completely different style to what you get at A-level.

It took me long enough to get my head around delta-epsilon arguments, and I'm still not sure I completely understand them.

##### Share on other sites
It took me long enough to get my head around delta-epsilon arguments, and I'm still not sure I completely understand them.
When you get into more rigorous proof classes (Real Analysis, Topology, etc.), $\epsilon-\delta$ arguments will become the easiest type of proof you will encounter.

##### Share on other sites
Maybe if he starts doing that today, he might be done in 20 years or so.

It will probably take more time than that

Mandrake

##### Share on other sites

Just out of inquistiveness, roughly how many people understand/know the proof of fermat's last theorem ?

##### Share on other sites

lol. that set would be a null set.

##### Share on other sites

I heard its a 250 page proof. So much for simplicity !

Theres a similar goliath of a proof in group theory for the theorem "all finite simple non-abelian groups are of even order".

##### Share on other sites

is the contrapositive of that statement true? what about its converse?

##### Share on other sites

Converse is not true.

Contra-positive : I don't understand what exactly you mean by that.

##### Share on other sites

the contrapositive of that statement (in my knowledge) would be

"all finite simple Abelian groups are of odd order"

##### Share on other sites

Again i don't think thats true

##### Share on other sites

The theorem that Pulkit is referring to is often known as the Odd Order Theorem and is Feit, W. and Thompson, J. G. "Solvability of Groups of Odd Order." Pacific J. Math. 13, 775-1029, 1963

As its title says, the paper proves that all groups of odd order are soluble (the British version of solvable) and as an immediate consequence you get the fact that a finite simple non-cyclic group has even order.

Humorous proofs in maths are hard to come by but this impressive theorem is the source of one that, as students, we thought of many years ago.

Theorem

n! is even for all positive integers n

Proof

Suppose, for a contradiction, n! is odd.

It follows that the symmetric group $S_n$, which has order n!, is soluble by the Odd Order Theorem. But for n>4 this is well-known to be false, so n! must be even.

This leaves the case where n<5 which can be checked individually

##### Share on other sites

do u know who proved that theorem first?

##### Share on other sites

Er, which theorem are you referring to?

When you get into more rigorous proof classes (Real Analysis, Topology, etc.), $\epsilon-\delta[/math'] arguments will become the easiest type of proof you will encounter. yay #### Share this post ##### Link to post ##### Share on other sites I heard its a 250 page proof. So much for simplicity ! Theres a similar goliath of a proof in group theory for the theorem "all finite simple non-abelian groups are of even order". Yeah but it is whole theory more general than just FMT. The FMT is just a consequence of whole the theory set up by the guy. There are actually people understanding all of this theory since they pointed out an error in the original reasoning and helped to repair it. In any case it is not like on the first page you see proof : and then 250 pages further you see QED or something like that. It is an entire theory with many results. Mandrake If i remember correctly it was Andrew Wiles who proved FMT in 1994 and corrected his proof in 1995. #### Share this post ##### Link to post ##### Share on other sites What do you do(think) first when you need to prove. Think? Or just applied the knowledge that seems to be the most optimum to the question?> #### Share this post ##### Link to post ##### Share on other sites To whom are you wondering that ? Mandrake #### Share this post ##### Link to post ##### Share on other sites If i remember correctly it was Andrew Wiles who proved FMT in 1994 and corrected his proof in 1995. i meant who proved that theorem about groups first. #### Share this post ##### Link to post ##### Share on other sites Walter Feit and John Thompson #### Share this post ##### Link to post ##### Share on other sites The theorem that Pulkit is referring to is often known as the Odd Order Theorem and is Feit' date=' W. and Thompson, J. G. "Solvability of Groups of Odd Order." Pacific J. Math. 13, 775-1029, 1963 As its title says, the paper proves that all groups of odd order are soluble ([i']the British version of solvable[/i]) and as an immediate consequence you get the fact that a finite simple non-cyclic group has even order. Humorous proofs in maths are hard to come by but this impressive theorem is the source of one that, as students, we thought of many years ago. Theorem n! is even for all positive integers n Proof Suppose, for a contradiction, n! is odd. It follows that the symmetric group [math]S_n$, which has order n!, is soluble by the Odd Order Theorem. But for n>4 this is well-known to be false, so n! must be even.

This leaves the case where n<5 which can be checked individually

n=1 anybody?

n=1 anybody?

## Create an account or sign in to comment

You need to be a member in order to leave a comment

## Create an account

Sign up for a new account in our community. It's easy!

Register a new account