Login

Welcome, Guest. Please login or register.

December 27, 2024, 02:03:17 am

Author Topic: BORED already? Want to learn a bit of maths? :P  (Read 27010 times)  Share 

0 Members and 1 Guest are viewing this topic.

b^3

  • Honorary Moderator
  • ATAR Notes Legend
  • *******
  • Posts: 3529
  • Overloading, just don't do it.
  • Respect: +631
  • School: Western Suburbs Area
  • School Grad Year: 2011
BORED already? Want to learn a bit of maths? :P
« on: November 16, 2012, 01:05:33 pm »
+31
Since I've finished uni exams, I've been pretty bored already to the point where I started making worked examples and notes for one of my uni/eng maths units from last semester. Anyway I thought some of you who may also be bored, and enjoy maths :D, may be interested. If people are interested then I may make a few more like this, with some of the topics we covered (e.g. gauss elimination and such). So yeh, have a read through and try the questions if you want, and post the sols up if you can get them :).

I probably should point out that this is after spesh, and you won't be allowed to use these techniques in VCE maths. Although UMEP students would have probably covered this already.

Integration by Parts

We are all familar with the product rule, which we can rearrange to get the rule for integration by parts.


So we have two 'functions', and . The goal is to end up with a simpler integral than the original. This may be done by picking as the right function, so that both and the term is anti-differentiable.
e.g.
So here, if we pick and , we will end up with the term which is anti-differentiable, and a simpler integral than the first.

 So basically its what you would have come across in Methods, integration by recognition, but backwards. So we have two 'functions', and . The goal is to end up with a simpler integral than the original. This may be done by picking as the right function, so that both and the term is anti-differentiable.
e.g.
 So here, if we pick and , we will end up with the term which is anti-differentiable, and a simpler integral than the first.

We can also note that if we had of picked and the other way round, we would get which is a worse integral than we started with.


So lets try another one.
e.g.
Now the little trick to this one is to look at it as , that is ,


We may even need to apply integration by parts twice, as sometimes the first integral won't be any simpler (note: this won't always work).

You don't have to show all that working, but I've kept it all there for now.

One last example, sometimes when we use integration by parts twice, we can obtain the same integral, as the one we were originally looking for, in the RHS, and add it back to the other side, then solve for it to leave what the integral equals.
e.g.

As we can see we know have the original integral on the RHS as well, so we can 'solve' for it by adding it to the left hand side and dividing by 2.


Now for some questions to try (answers are in the spolier tags).

Spoiler

Spoiler

Spoiler

Spoiler

Spoiler

Spoiler

Spoiler

We may also sometimes use euler's identity to use a simpler method to find the anti-derivative of some of the above. But first we are going to show one way of why . Firstly we start off with a differential equation, with the initial condition of . So we are looking for a function that basically is it's own derivative, so we can use . Now what happens if we let ?

We can check that this satisfies , .
Now we know that will be a solution to the differential equation, but if we look at another function, we can see that it is a solution as well.

Now checking with the initial condition,

Since both solutions are solutions ot the same equation, and satisfy the initial condition, we can say that they are the same.

So now that we have seen one way of showing euler's identity, we can use it to find some anti-derivatives.
Lets start off looking at
We can find the anti-derivative of s similar function involving , and then take the real part of it (we use the real part for
and the imaginary part for ).

So to find the real parts we remember that a real part multiplied by a real part gives a real number, and the imaginary part multipled by an imaginary part gives a real part (as ). So that is the multipled by the and the multiplied by the .

Which gives the same result as the other method, you wouldn't have to show all these steps, which means sometimes this method is quicker.

If we were looking at a function with instead of then we would be looking for the imaginary part instead of the real part, which means that when we get to the multiplying out line, we will be looking for the real parts multiplied by imaginary parts to give an imaginary part.


Now for some questions to try.

Spoiler

Spoiler
« Last Edit: February 07, 2013, 08:02:14 pm by b^3 »
2012-2016: Aerospace Engineering/Science (Double Major in Applied Mathematics - Monash Uni)
TI-NSPIRE GUIDES: METH, SPESH

Co-Authored AtarNotes' Maths Study Guides


I'm starting to get too old for this... May be on here or irc from time to time.

Bhootnike

  • Chief Curry Officer
  • Victorian
  • Part of the furniture
  • *****
  • Posts: 1332
  • Biggest Sharabi
  • Respect: +75
  • School Grad Year: 2012
Re: BORED already? Want to learn a bit of maths? :P
« Reply #1 on: November 16, 2012, 01:25:20 pm »
0
this is sex
2011: Biol - 42
2012: Spesh |Methods |Chemistry |English Language| Physics
2014: Physiotherapy
khuda ne jab tujhe banaya hoga, ek suroor uske dil mein aaya hoga, socha hoga kya doonga tohfe mein tujhe.... tab ja ke usne mujhe banaya hoga

polar

  • Guest
Re: BORED already? Want to learn a bit of maths? :P
« Reply #2 on: November 16, 2012, 04:02:16 pm »
+6
thank you. this board has been very quiet lately. anyway, here's another way of proving euler's identity by using the maclaurin series,









« Last Edit: November 16, 2012, 07:02:38 pm by polar »

b^3

  • Honorary Moderator
  • ATAR Notes Legend
  • *******
  • Posts: 3529
  • Overloading, just don't do it.
  • Respect: +631
  • School: Western Suburbs Area
  • School Grad Year: 2011
Re: BORED already? Want to learn a bit of maths? :P
« Reply #3 on: November 17, 2012, 12:31:55 am »
+12
Got bored again... Anyway, hope you guys enjoy it, and I just realised I forgot to put in how to do any square sized matrix inverses by hand, may do that if I get bored again. Anyway, hope you guys enjoy it :)

Gaussian Elimination

Gauss Elimination can be used as a method of solving linear equations (it also leads into finding the inverse of matricies by hand). If we had the system

Now to solve them by previous methods, we would multiply equation (1) by 2, then subtract the equation (2) from (3)
i.e.



i.e. Our solutions would be
So basically what we can do is, we can
  • add or subtract one equation to another
  • mutiply an equation by a scalar excluding zero
  • swap the order of equations

Now we can apply this to gaussian elimination by doing the same things to the rows of the augmented matrix. The augmented matrix, contains the coefficients of each of the unknowns, and the furtherst right hand column has what the equation equals.
e.g. For the system

The Augmented Matrix would be

So what we aim to do is, to make a 'pivot' in each row. A pivot will have all the entries to the left of it being 0, and each pivot must be to the right of the pivot in the row above it. So if we wanted to form a pivot in the second row, we need to try and do it in the second column, that is we need to make the 2 in the second row, column 1 be 0. To do this we can take half of row 1 away from row 2.

Now we have a pivot at in row 1 column 1 and row 2 column 2. So we try to form the next pivot by making row 3, columns 1 and 2 become 0. Working on row 3 column 1, we can take a multiple of row 1 away, and for column 2 we can take a multiple of row 2 away, as the zero in row 2 means we won't affect what we've done to row 3 column 1.


What we end up with is the row echelon form of the system.
Note: That we are using row 1 to change column 1 and row 2 to change column 2, in that order, so that we don't lose the 0's that we form.
Now we come to the Back Substituion stage. We first solve for the varible in the last row, then use that result to solve for the second last variable and so on.



So lets do another example.
e.g. Find the solution to the following system of equations.


Now since the pivot in the second row is to the left of a non-zero element in the third row, we want to swap the second and third rows, which will leave us with a pivot in each row.




Now for a few problems to try

Spoiler
, Solution:

Spoiler
, Solution:

Spoiler
, Solution:

Spoiler
, Solution:

Now what we've been dealing with is mostly the intersection of planes and lines at a point, but we can have planes intersection along a line, as in the picture below. (We can also have the intersection being a plane aswell)

So that means that we would have our solutions in terms of a parameter, which we will use as . The variable that we set as will be the one that is 'free', that is the variable whose column doesn't have a pivot in it.
e.g. If we are using the variables , and , and we have

Then we have pivots int he first and second columns, so is free, so we set .

Then we have pivots in the first and third columns, so that means the variable is free, so we set .

So lets do an example.
e.g. We have the system


is free, let


So taking a point on the line (lets say for ), we get and the direction vector , so the solution to the system is a line with equation


Lets try another example, this time we three planes to start off with.


Now since we have a row of zeros, we aren't getting any new information from them, so we can get rid of it just to end up with

is free, let



Sometimes we will have a system that has no solutions, such as parallel planes or lines. When we convert to row echelon form, systems with no solutions will have a row of zeros on the left hand side, and a non zero element on the right hand side (as this cannot happen, we can't have giving a number). That is they contain
, where is a non-zero element.
So if we had the system


Now we have that row of zeros resulting in a number on the right hand side, so this system has no soultions. We call this system inconsistent.

Lets try some problems.
1.
Spoiler
, Solution:
2.
Spoiler
, Solution:
3.
Spoiler
, Solution:
4.
Spoiler
, No Solutions, the system is inconsistent.
« Last Edit: November 17, 2012, 12:59:41 am by b^3 »
2012-2016: Aerospace Engineering/Science (Double Major in Applied Mathematics - Monash Uni)
TI-NSPIRE GUIDES: METH, SPESH

Co-Authored AtarNotes' Maths Study Guides


I'm starting to get too old for this... May be on here or irc from time to time.

Special At Specialist

  • Victorian
  • Part of the furniture
  • *****
  • Posts: 1542
  • Respect: +86
  • School: Flinders Christian Community College (Tyabb)
  • School Grad Year: 2012
Re: BORED already? Want to learn a bit of maths? :P
« Reply #4 on: November 17, 2012, 12:50:00 am »
0
Thank you for teaching me Gaussian Elimination! I learnt integration by parts from Khan Academy a while ago, but I've never learnt Gaussian Elimination until just now.

What we end up with is the row echelon form of the system.
Note: That we are using row 1 to change column 1 and row 2 to change column 2, in that order, so that we don't lose the 0's that we form.
Now we come to the Back Substituion stage. We first solve for the varible in the last row, then use that result to solve for the second last variable and so on.
[tex]\begin{alignedat}{1}\frac{9}{2}z & =\frac{15}{2}
\\ \therefore z & =\frac{5}{3}
\\ y+\frac{3}{2}z & =\frac{3}{2}
\\ y & =\frac{3}{2}-\frac{3}{2}\left(\frac{5}{3}\right)
\\  & =\frac{3}{2}-\frac{5}{2}
\\ \therefore y & =-1
\\ 4z+2y-z & =1

Isn't it meant to be:
4x + 2y - z = 1
2012 ATAR - 86.75
2013 ATAR - 88.50
2014: BSci (Statistics) at RMIT
2015 - 2017: BCom at UoM

b^3

  • Honorary Moderator
  • ATAR Notes Legend
  • *******
  • Posts: 3529
  • Overloading, just don't do it.
  • Respect: +631
  • School: Western Suburbs Area
  • School Grad Year: 2011
Re: BORED already? Want to learn a bit of maths? :P
« Reply #5 on: November 17, 2012, 12:59:52 am »
0
Fixed Now.
2012-2016: Aerospace Engineering/Science (Double Major in Applied Mathematics - Monash Uni)
TI-NSPIRE GUIDES: METH, SPESH

Co-Authored AtarNotes' Maths Study Guides


I'm starting to get too old for this... May be on here or irc from time to time.

Jenny_2108

  • Victorian
  • Forum Leader
  • ****
  • Posts: 603
  • Respect: +28
  • School: Melbourne Girls College
  • School Grad Year: 2012
Re: BORED already? Want to learn a bit of maths? :P
« Reply #6 on: November 17, 2012, 02:03:37 am »
0
^ Didn't see this thread until now :(
Hey b^3, if you get bored during hols, can you post 1 new topic everyday please? :P and if we have any ques about it, we will post here to ask
Finally, there is something to do  :D
2012: Bio | Chem| Spesh | Methods | ESL | Vietnamese
2013-2016: BActuarial studies/BCommerce @ ANU

Thanks to gossamer, TT, pi, laserblued, Thus for helping and supporting me during VCE

pi

  • Honorary Moderator
  • Great Wonder of ATAR Notes
  • *******
  • Posts: 14348
  • Doctor.
  • Respect: +2376
Re: BORED already? Want to learn a bit of maths? :P
« Reply #7 on: November 17, 2012, 01:54:29 pm »
+2
We may also sometimes use euler's identity ...

I found this doc useful last year when I toyed with this technique, it slightly extends on b^3's post too

Hancock

  • SUPER ENGINEERING MAN
  • Victorian
  • Part of the furniture
  • *****
  • Posts: 1221
  • Respect: +270
  • School: Ringwood Secondary College
  • School Grad Year: 2011
Re: BORED already? Want to learn a bit of maths? :P
« Reply #8 on: November 17, 2012, 01:58:17 pm »
0
Oh my god, so sick of row reduction of matrices after Linear Algebra this semester.
Thinking of doing Engineering? - Engineering FAQs

2012 - 2014: B.Sc. - Mechanical Systems - The University of Melbourne
2014 - 2014: Cross-Institutional Study - Aero/Mech Engineering - Monash University
2015 - 2016: M.Eng (Mechanical with Business) - The University of Melbourne
2015 - Sem1: Exchange Semester - ETH Zurich

Biceps

  • Victorian
  • Forum Leader
  • ****
  • Posts: 548
  • Respect: +3
  • School Grad Year: 2012
Re: BORED already? Want to learn a bit of maths? :P
« Reply #9 on: November 17, 2012, 03:05:33 pm »
0
http://www.youtube.com/watch?v=CpM1jJ0lob8
Good video to understand complexifying the integral
2011: Arabic [31] IT Applications [36]
2012: english[28] Chemistry[31] methods[39] Spesh [35] Biology:[42]

ATAR 2012: 92.90

2013-2016: BSc at UoM

BubbleWrapMan

  • Teacher
  • Part of the furniture
  • *
  • Posts: 1110
  • Respect: +97
Re: BORED already? Want to learn a bit of maths? :P
« Reply #10 on: November 17, 2012, 03:46:59 pm »
+7
Thought I'd share a bit more on matrix methods and expand on the whole row-echelon thing.

What b^3 has been doing is getting the matrices in row-echelon form, i.e. manipulating the augmented matrices so that each row-leader only has zeros below them. However, the definition of row-echelon form varies from place to place, and some definitions have more requirements. The most common extra requirement is that each row-leader show be 1, and another is that the row-leaders should also have zeros above them, as well as below (this is often called reduced row-echelon form). The main advantage of going this much further is to make it extremely easy to read off the solution set. I'll give a brief example of this:

Say we have the system:

The first row begins with 1, which is what we want, so we will leave it like that. To eliminate the other non-zero entries in the first column we will add/subtract multiples of row 1 to the other two. It's important that when you're adding or subtracting a row that you leave that row unchanged in the process, since otherwise you may destroy information.

So now we have:


The second row looks nicely divisible by 4 so:



Now we want to get rid of the non-zero entries in the second column, so we will add/subtract row 2 from the others:



This is now in [reduced] row-echelon form. We ended up with two equations which means there is an infinite solution set (it would have been empty if the bottom-right entry was non-zero, as we would have had the equation 0x + 0y + 0z = c).

We have the two equations:


and

Which can be rearranged to give:


and

So now, this solution set can be described by a parameter, so I'll use t as the parameter. Letting z = t, the solution set is:

, which describes a line in .

A single linear equation in 3 variables always represents a plane in , so the intersection of two of these linear equations will represent a line, unless the planes are parallel. Planes will either intersect completely (if they are the same plane), or never intersect (they are parallel and do not share a point), or they intersect along a line. This is analogous to lines in having a unique intersection except when they are parallel.

Is there another way to describe/visualise this line we found? Yeah, most definitely. Consider the position vector of any point in the solution set:







So from this we can see it is the line through the point and in the direction of .
Tim Koussas -- Co-author of ExamPro Mathematical Methods and Specialist Mathematics Study Guides, editor for the Further Mathematics Study Guide.

Current PhD student at La Trobe University.

b^3

  • Honorary Moderator
  • ATAR Notes Legend
  • *******
  • Posts: 3529
  • Overloading, just don't do it.
  • Respect: +631
  • School: Western Suburbs Area
  • School Grad Year: 2011
Re: BORED already? Want to learn a bit of maths? :P
« Reply #11 on: November 17, 2012, 04:01:57 pm »
+8
EDIT: Post number 2222 :P

I don't know if I will do anymore after this, depends, but anyway. Also thanks for the contributions to the thread guys (Also it kind of leads into what I had coming next :) )

Matrix Inverses (by hand)

We can use the methods forward eliminiation and backwards elimination methods used in gaussian elimination to find the inverse of matricies by hand, although it is quite tedious.

We start off with an augmented matrix and then use row echelon operations to try and turn the left hand side into the inverse matrix , which will leave the right hand side as our inverse, i.e. .
If we get a row entirely of zeros or a column entirely of zeros then the matrix has no inverse and we don't need to go any further, as we can't turn the left hand side into the identity matrix.
e.g. Find the inverse of A where

So we start with , we work our ways down using the same forward elimination as before, so we get a triangle of zeros in the bottom left hand corner, then we work back up using the bottom rows instead of the top rows, to get a triangle of zeros in the top right hand corner.

Now that is the forward elimination process finished, now for the backwards elimination working. So we start with the bottom rows and work our way back up.

Now we have the identity matrix formed on the LHS, so the right hand side is our inverse of the original, that is we now have


Now for some questions, they may be a fair bit tedious.....
1.
Spoiler
Solution:
2.
Spoiler
Solution:
3.
Spoiler
Solution:
4.
Spoiler
Solution:
2012-2016: Aerospace Engineering/Science (Double Major in Applied Mathematics - Monash Uni)
TI-NSPIRE GUIDES: METH, SPESH

Co-Authored AtarNotes' Maths Study Guides


I'm starting to get too old for this... May be on here or irc from time to time.

pi

  • Honorary Moderator
  • Great Wonder of ATAR Notes
  • *******
  • Posts: 14348
  • Doctor.
  • Respect: +2376
Re: BORED already? Want to learn a bit of maths? :P
« Reply #12 on: November 17, 2012, 04:45:19 pm »
0
As an exercise and after readng b^3's and polar's posts:
Simplify

Spoiler





However, there are actually infinite solutions, had we let where , we would arrive at the more generalised solution of where

:)




When I was in yr11, my methods teacher made a passing comment on Gamma Functions (what fascinated me was how we can get the factorials of non-integers)

Here is a nice doc explaining how the basics of them work :) -> "gamma functions.pdf"

edit: added a more advance doc, still very understandable (well, mostly :P ) -> "GammaAndStirling.pdf"
« Last Edit: November 17, 2012, 05:44:17 pm by pi »

charmanderp

  • Honorary Moderator
  • ATAR Notes Legend
  • *******
  • Posts: 3209
  • Respect: +305
  • School Grad Year: 2012
Re: BORED already? Want to learn a bit of maths? :P
« Reply #13 on: November 17, 2012, 04:58:40 pm »
0
Only on ATARNotes :P You guys never cease to amaze me.
University of Melbourne - Bachelor of Arts majoring in English, Economics and International Studies (2013 onwards)

BubbleWrapMan

  • Teacher
  • Part of the furniture
  • *
  • Posts: 1110
  • Respect: +97
Re: BORED already? Want to learn a bit of maths? :P
« Reply #14 on: November 17, 2012, 06:30:19 pm »
+8
Finding (n x n) Matrix Determinants

You're all familiar with the concept of a matrix determinant, particularly those of (2 x 2) matrices, and their role in invertibility - namely, the fact that a square matrix has an inverse if, and only if, its determinant is non-zero.

What is a determinant, though? There are a few ways to think about it, though it's not really a simple thing to describe - I couldn't really tell you definitively what a determinant is. But these days I associate it with a sort of 'scale factor' when applying a matrix transformation to n-dimensional space. What do I mean by that? Well, consider some now-familiar transformations:

Say we applied the following transformation to :

, where

This is a dilation by a factor of parallel to the x-axis. The determinant of this coefficient matrix is , which make sense since the entire plane is scaled by a factor of a.

Now consider this transformation:



This is a reflection of the plane in the line , or an inversion of a function, if you will. The determinant of this coefficient matrix is -1. This tells you that the plane hasn't been scaled (the magnitude of the determinant is 1), but the negative indicates the plane's orientation is reversed.

The third and final example is:



This is unfamiliar, due to the fact that this time, the determinant of the coefficient matrix is zero. What does that mean, though? What happens to the plane?

Well, we end up with after multiplication. That tells you that every x-coordinate stays where it is, but every y-coordinate becomes 0. So the ENTIRE plane is mapped onto the line y = 0. Needless to say, when you squash the whole plane onto a line, you essentially scale by a factor of 0, and this transformation cannot be undone. It's like multiplying something by zero -- you can't find the original number afterwards. Thusly, we cannot reverse the application of this coefficient matrix.

So, we have some idea of what determinants are. Now let's see how we can find them.

I'll start with a general (3 x 3) matrix:



What we do is pick one row or one column (I'll use the first row), and expand it like so (this won't make sense immediately so bear with me):



(note: the use of straight lines on the matrices is a shorthand for the determinant -- you may not have seen it before, I hadn't seen it before uni...)

So we're left with a few (2 x 2) determinants, which we know how to find. But what exactly did I do there? Well, the , and came from the first row. The matrix determinant came from temporarily 'deleting' the row and column that came from:



And similarly, the matrix determinant that is multiplied by came from 'deleting' the row and column that is in:



But there's one more thing: the negative sign in front of the . Whether the coefficient of each element is 1 or -1 can be determined from the following representation:



So basically, starting at the first element (first row, first column), it's positive, then it alternates between positive and negative. This can be extended to higher dimensions, e.g. for a (6 x 6):



So, for example, if we expanded the second row instead, we would have:



If you expand this out you'll find it's exactly the same as the other expression.

The best way to solidify understanding of this method is to do an example, so I'll use the matrix from my last post:



We found that there was no unique solution to the system, so that should give a clue as to what the determinant will be...

If we expand along the last column (I'll emphasise again that you can use any row or column) we get:









, as expected.

This is usually a relatively quick procedure for (3 x 3)s, so it's a good idea to find the determinant of a matrix before you set out to find its inverse, in case it doesn't have one.

Now, I'll steal the (5 x 5) from b^3's last post to make an important point:



Note that, since we can use any row or column we like, we generally try to use the one with the most zeros in it (if there are any zeros at all), since the calculations are made a lot faster. Here, we can see the second column has three zero entries, so we will use this column:



So we're left with only two (4 x 4) determinants to find, rather than the maximum of five (4 x 4) determinants, if we had used, say, the third row. But of course, you won't always be that lucky, and you'll have to find five of them. Anyway, expanding out the (4 x 4) determinants:













So yeah, it's pretty tedious as you go higher than (3 x 3)... but the good thing is the method itself is fairly simple. I didn't indicate which rows I used in each case above -- try and work it out, or just pick them on your own and see that you get the same number.
Tim Koussas -- Co-author of ExamPro Mathematical Methods and Specialist Mathematics Study Guides, editor for the Further Mathematics Study Guide.

Current PhD student at La Trobe University.