A Summer of Maths

Maths and statistics discussion, revision, exam and homework help.

Announcements Posted on
TSR launches Learn Together! - Our new subscription to help improve your learning 16-05-2013
IMPORTANT: You must wait until midnight (morning exams)/4.30AM (afternoon exams) to discuss Edexcel exams and until 1pm/6pm the following day for STEP and IB exams. Please read before posting, including for rules for practical and oral exams. 28-04-2013
Sign in to Reply
  • View Poll Results: Have you studied any Group Theory already?
    Yes, I did some Group Theory during/at my A-level.
    24 34.78%
    No, but I plan to study some before Uni.
    15 21.74%
    No, I haven't.
    30 43.48%

  1. james22's Avatar
    • Peer Of The TSR Realm
    • Posts: 1,978
    Re: A Summer of Maths
    (Original post by Lord of the Flies)
    Having f(k)\leq1, f(k)\geq k does not yield f(x)=x

    Also, you stated f(0)=1 which negates your conclusion.
    (Original post by jack.hadamard)
    Spoiler:
    Show

    If f(k) = k, then what value should f(0) take?
    Typo, that k was meant to be a 1. This then gives f(k)=1 for all k.
  2. jj193's Avatar
    • Peer Of The TSR Realm
    • Location: Manchester
    Re: A Summer of Maths
    Q1
    Can you spot the mistake?

    We use induction to prove that n horses are the same colour:
    Base case, n=1, true.

    assume true for n=k \geq 1
    If we have k+1 horses. Consider the first k horses. By assumption, they are all the same colour. Take one of these k horses, and the (k+1)th horse - again, by assumption, they are the same colour.
    Hence all k+1 are the same colour (here we use 'transitivity of colour' - to be formalised below)

    ------------------
    Q2

    Above i mentioned 'transitivity of colour'.
    Let S be a set, and ~ be a 'binary relation' on S. (this means that it represents true or false. It's like a magic ball, you can give it two elements a,b of S and ask it the question, are they related? and it will return true or false (This is notated as a~b)
    In maths this is often stated as ~ : S \times S \rightarrow \{true, false\} where  '\times' denotes the Cartesian product (look it up!)

    We say that '~' is:
    transitive if and only if (a~b and b~c implies a~c) for any a,b,c in S
    symmetric if and only if (a~b implies b~a) for any a,b in S
    reflexive if and only if (a~a) for any a in S

    If all three of the above are satisfied, then ~ is called an equivalence relation.

    Convince yourself that "having the same colour" is an equivalence relation on any set of elements with a colour.
    Question:
    Is  \geq is an equivalence relation? Is > an equivalence relation?

    ----------------
    Q3
    Let  N \subset \mathbb{R} be finite.
    Use the principle of induction to show that it has a least element.

    ------------------
    Really tough question:
    The guests at Hilbert's hotel keep asking the receptionist if they can use the phone to make a call.
    The female receptionist at Hilbert's hotel wishes to keep track of how many times each room number has used the phone.
    She wishes to use her typewriter because he pencil broke and Mr Hilbert chewed her pen so that it no longer works (he was hungry). Again, Mr Hilbert has been silly and he chewed all but 2 of the keys off the receptionist's typewriter,

    Q4 i) how can she keep her record?

    Later that evening, after an unsatisfactory meal produced by Mrs Hilbert, Mr Hilbert is hungry again. Mr Hilbert eats another key from the typewriter, leaving just one key!

    ii)It is possible for the receptionist to keep track of the room numbers, but how?

    Spoiler:
    Show

    hint:
    ii) there are infinitely many primes.
    any natural number has a unique prime factorisation. (Fundamental Theorem of Arithmetic)




    ------------

    The first few pages of chapter 8 in Korner's "A Companion to Analysis" are readable and somewhat surprising.

    it is found here: ftp://195.214.211.1/books/DVD-002/Ko...on_to_Analysis[c]_A_Second_First_and_First_Second _Course_in_Analysis_(2004)(en)(6 13s).pdf
    Last edited by jj193; 01-07-2012 at 22:55.
  3. ben-smith's Avatar
    • Overlord in Training
    • Location: Hilbert Space
    • Posts: 2,366
    Re: A Summer of Maths
    What are people going to read up on over the summer?
  4. Lord of the Flies's Avatar
    • The foul fiend Flibbertigibbet
    • Location: Paris, France
    • Warning points: 2
    Re: A Summer of Maths
    (Original post by jack.hadamard)
    {*} Question:

    Find f : \mathbb{N} \cup \{0\} \to \mathbb{R} such that for all k,m and n the inequality

    f(km) + f(kn) - f(k)f(mn)\ \geq\ 1

    is satisfied.


    {**} Required:

    Spoiler:
    Show

    The notation \mathbb{N} \cup \{0\} explicitly specifies the set of all natural numbers together with zero; i.e. the union of the natural numbers with the singleton that contains zero.
    Does this work?

    Spoiler:
    Show

    \bullet\; k=m=n=0:

    (f(0)-1)^2\leq0\Rightarrow f(0)=1

    \bullet\; k=m=n=1:

    (f(1)-1)^2\leq0\Rightarrow f(1)=1

    \bullet\; k=0, m=1:

    2f(0)-f(0)f(n)\geq 1 \Rightarrow f(n)\leq1

    \bullet\; k=1, m=0:

    f(0)+f(n)-1\geq 1 \Rightarrow f(n)\geq 1

    Therefore \forall n,\; f(n)=1
    Last edited by Lord of the Flies; 01-07-2012 at 23:19.
  5. Lord of the Flies's Avatar
    • The foul fiend Flibbertigibbet
    • Location: Paris, France
    • Warning points: 2
    Re: A Summer of Maths
    (Original post by james22)
    Typo, that k was meant to be a 1. This then gives f(k)=1 for all k.
    Oh right! I couldn't see what you where getting at with the mistake but by having a go at it myself I can see it now! Hence I kind of unknowingly rephrased your 'corrected' solution above! Sorry!
    Last edited by Lord of the Flies; 01-07-2012 at 23:09.
  6. Tobedotty's Avatar
    • Exalted and Worshipped Member
    • Posts: 909
    Re: A Summer of Maths
    (Original post by ben-smith)
    What are people going to read up on over the summer?
    Stats
  7. jack.hadamard's Avatar
    • Benevolent Member
    • Posts: 696
    Re: A Summer of Maths
    (Original post by Lord of the Flies)
    Does this work?
    It does. Can you please use a
    HTML Code:
    [spoiler]blah[/spoiler]
    to add solutions or hints. Thanks!
  8. jack.hadamard's Avatar
    • Benevolent Member
    • Posts: 696
    Re: A Summer of Maths
    (Original post by ben-smith)
    What are people going to read up on over the summer?
    I have put one of the books on which I'll spend some time over the summer.
    The topics that interest me are Group Theory, Analysis and some Vector Calculus.

    Spoiler:
    Show

    What do people with experience think about Vector Analysis and Cartesian Tensors by Bourne?


    (Original post by Farhan.Hanif93)
    ...
  9. Lord of the Flies's Avatar
    • The foul fiend Flibbertigibbet
    • Location: Paris, France
    • Warning points: 2
    Re: A Summer of Maths
    (Original post by jack.hadamard)
    It does. Can you please use a
    HTML Code:
    [spoiler]blah[/spoiler]
    to add solutions or hints. Thanks!
    Done!
  10. brittanna's Avatar
    • Peer Of The TSR Realm
    • Posts: 1,499
    Re: A Summer of Maths
    (Original post by DJMayes)
    At the Nottingham University Open Day there was a "Maths Trail" with several interesting questions on it. The questions ranged from requiring a working knowledge of arithmetic progressions and combinations to lowest common multiples and counting squares; and more emphasis was put on thinking about them than slogging through endless manipulation. I thought I'd share one with you. The question is of the kind that could be set in C1, but is an interesting one:

    A rectangle is inscribed inside a circle of radius 6 units such that each of the vertices of the rectangle lie on the circumference of the circle. Given that the perimeter of the rectangle is 28 units, what is the area?

    Required Knowledge:
    Spoiler:
    Show

    - Pythagoras' Theorem
    - Simultaneous Quadratic Equations


    Hints:
    Spoiler:
    Show

    What information are you given? You have both the perimeter of the rectangle, and the radius of the circle it is inscribed inside. How can you relate these in terms of the length and width of the rectangle?
    Spoiler:
    Show

    Consider the diagonal of the rectangle



    Full Solution:
    Spoiler:
    Show

    Let X and Y represent the length and width of the rectangle. Using this and the perimeter we can automatically deduce an equation:

    2X + 2Y = 28

    Which simplifies to X + Y = 14

    As we are told that the radius of the circle is 6, we also know that its diameter must be 12. This diameter forms the diagonal of the rectangle. From this, another equation can be deduced using Pythagoras' Theorem:

    X^2 + Y^2 = 144

    We now have a set of simultaneous equations to solve. Re-arranging the first to leave Y in terms of X and substituting in the second equation leaves you with this:

    X^2 + (14 - X)^2 = 144

    This expands to:

    X^2 + X^2 - 28X + 196 = 144

    Which then simplifies to:

    2X^2 - 28X + 52 = 0

    or:

    X^2 - 14X + 26 = 0

    You can then complete the square or use the quadratic formula to get the result:

    X = 7 + rt(23) or X = 7 - rt(23)

    Using this you can then confirm that Y has the same values (i.e. if X = 7 + rt(23) then Y = 7 + rt(23) and vice-versa)

    Now you know both side lengths, you simply multiply them together to get the area. The final answer is 26.
    Have you got any more questions like this?
  11. ben-smith's Avatar
    • Overlord in Training
    • Location: Hilbert Space
    • Posts: 2,366
    Re: A Summer of Maths
    (Original post by Tobedotty)
    Stats
    errr, really?
    OK
  12. Lord of the Flies's Avatar
    • The foul fiend Flibbertigibbet
    • Location: Paris, France
    • Warning points: 2
    Re: A Summer of Maths
    Saw something like this on TSR a while ago:

    Question

    Let the set \Omega=\{0,1,2\}

    We randomly and independently generate elements of \Omega r_n times. If the sum of the results is r_{n+1}=0 we stop. If the sum of the results is r_{n+1}\geq 1, we randomly and independently generate elements of \Omega r_{n+1} times etc.

    Given that r_1=1, what is the probability of this process ending?

    Required

    Spoiler:
    Show

    Basic laws of AND/OR statements, conditional probabilities, total probabilities, and knowing what an independent event is.
  13. Tobedotty's Avatar
    • Exalted and Worshipped Member
    • Posts: 909
    Re: A Summer of Maths
    (Original post by ben-smith)
    errr, really?
    OK
    yeah! I've been finding it interesting for some reason. I'll probably get bored of it soonish and turn back to pure though and gorge on Olympiad problems I imagine.

    What are you doing?
  14. Farhan.Hanif93's Avatar
    • Section Moderator
    • PS Helper
    • TSR Idol
    • Location: Cambridge
    Re: A Summer of Maths
    (Original post by jack.hadamard)
    I have put one of the books on which I'll spend some time over the summer.
    The topics that interest me are Group Theory, Analysis and some Vector Calculus.

    Spoiler:
    Show

    What do people with experience think about Vector Analysis and Cartesian Tensors by Bourne?
    It looks good but it's a little on the expensive side given that this does a sufficiently good job, in my opinion (and is mentioned on one of the Colleges' online reading list, I forget which). If you want more stuff on Tensors, there's another book from the same series (although I haven't personally tried it); and you can buy both for a fraction of the price of Bourne's book.
  15. 4ever_drifting's Avatar
    • Respected Member
    • Posts: 231
    Re: A Summer of Maths
    (Original post by DJMayes)
    At the Nottingham University Open Day there was a "Maths Trail" with several interesting questions on it. The questions ranged from requiring a working knowledge of arithmetic progressions and combinations to lowest common multiples and counting squares; and more emphasis was put on thinking about them than slogging through endless manipulation. I thought I'd share one with you. The question is of the kind that could be set in C1, but is an interesting one:

    A rectangle is inscribed inside a circle of radius 6 units such that each of the vertices of the rectangle lie on the circumference of the circle. Given that the perimeter of the rectangle is 28 units, what is the area?

    Required Knowledge:
    Spoiler:
    Show

    - Pythagoras' Theorem
    - Simultaneous Quadratic Equations


    Hints:
    Spoiler:
    Show

    What information are you given? You have both the perimeter of the rectangle, and the radius of the circle it is inscribed inside. How can you relate these in terms of the length and width of the rectangle?
    Spoiler:
    Show

    Consider the diagonal of the rectangle



    Full Solution:
    Spoiler:
    Show

    Let X and Y represent the length and width of the rectangle. Using this and the perimeter we can automatically deduce an equation:

    2X + 2Y = 28

    Which simplifies to X + Y = 14

    As we are told that the radius of the circle is 6, we also know that its diameter must be 12. This diameter forms the diagonal of the rectangle. From this, another equation can be deduced using Pythagoras' Theorem:

    X^2 + Y^2 = 144

    We now have a set of simultaneous equations to solve. Re-arranging the first to leave Y in terms of X and substituting in the second equation leaves you with this:

    X^2 + (14 - X)^2 = 144

    This expands to:

    X^2 + X^2 - 28X + 196 = 144

    Which then simplifies to:

    2X^2 - 28X + 52 = 0

    or:

    X^2 - 14X + 26 = 0

    You can then complete the square or use the quadratic formula to get the result:

    X = 7 + rt(23) or X = 7 - rt(23)

    Using this you can then confirm that Y has the same values (i.e. if X = 7 + rt(23) then Y = 7 + rt(23) and vice-versa)

    Now you know both side lengths, you simply multiply them together to get the area. The final answer is 26.
    Love these kind of problems Just a note though - could you not observe that you need the product of the roots of the quadratic equation, which is given by c/a in 0=ax^2+bx+c, so you know the answer is 26 without having to find the roots then multiply them together?
  16. jack.hadamard's Avatar
    • Benevolent Member
    • Posts: 696
    Re: A Summer of Maths
    {*} Question:

    i) Let a_1, a_2, a_3, ..., a_n be an arithmetic sequence with non-zero terms.

    Obtain an expression for \displaystyle \sum_{k=1}^{n-1} \frac{1}{a_k a_{k+1}}.


    ii) Find the sum to infinity of the following series.

    \displaystyle \frac{1}{2} + \frac{1}{6} + \frac{1}{12} + \frac{1}{20} + \frac{1}{30} + ...
    Last edited by jack.hadamard; 02-07-2012 at 12:34. Reason: Forgot about something. :p
  17. jack.hadamard's Avatar
    • Benevolent Member
    • Posts: 696
    Re: A Summer of Maths
    (Original post by Farhan.Hanif93)
    .. this does a sufficiently good job..
    It is one of the books suggested for the first-year course; it looks good, I'll check it.
  18. Brit_Miller's Avatar
    • Benevolent Member
    • Location: Bristol
    • Posts: 683
    Re: A Summer of Maths
    I have a question but not an answer as I don't know how to do it. Hopefully someone can show how.

    Let f: \mathbb{R} \mathrm{x} \mathbb{R} \rightarrow \mathbb{R} \mathrm{x} \mathbb{R} \mathrm{be\ given\ by} f(x,y) = (x + y^3, x^5)

    \mathrm{Prove \ that}  f \mathrm{ is \ bijective \ and \ find \ its \ inverse.}
  19. james22's Avatar
    • Peer Of The TSR Realm
    • Posts: 1,978
    Re: A Summer of Maths
    (Original post by jack.hadamard)
    {*} Question:

    i) Let a_1, a_2, a_3, ..., a_n be an arithmetic sequence with non-zero terms.

    Obtain an expression for \displaystyle \sum_{k=1}^{n-1} \frac{1}{a_k a_{k+1}}.


    ii) Find the sum to infinity of the following series.

    \displaystyle \frac{1}{2} + \frac{1}{6} + \frac{1}{12} + \frac{1}{20} + \frac{1}{30} + ...
    1.

    Spoiler:
    Show
    (n-1)/(a_1*a_(n-1))
    Partial fractions did the trick here.
  20. Tobedotty's Avatar
    • Exalted and Worshipped Member
    • Posts: 909
    Re: A Summer of Maths
    (Original post by jack.hadamard)
    {*} Question:

    i) Let a_1, a_2, a_3, ..., a_n be an arithmetic sequence with non-zero terms.

    Obtain an expression for \displaystyle \sum_{k=1}^{n-1} \frac{1}{a_k a_{k+1}}.


    ii) Find the sum to infinity of the following series.

    \displaystyle \frac{1}{2} + \frac{1}{6} + \frac{1}{12} + \frac{1}{20} + \frac{1}{30} + ...
    ii)
    Spoiler:
    Show
    use partial fractions: \displaystyle\sum_{n=1}^\infty \frac{1}{n(n+1)}= \displaystyle\sum_{n=1}^\infty ( \frac{1}{n}- \frac{1}{(n+1)}) = 1
Sign in to Reply
Share this discussion:  
Article updates
Moderators

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

Reputation gems:
The Reputation gems seen here indicate how well reputed the user is, red gem indicate negative reputation and green indicates a good rep.
Post rating score:
These scores show if a post has been positively or negatively rated by our members.