At this time of year students are going through past exam questions. It’s tough getting through the AS syllabus in time as the content is very heavy, and to make matters worse, the exam is very early (22nd May). I was somewhat relieved to see (it’s not only me having time problems), and have every sympathy for, Hannah O’Rourke who is an A level student and who writes in this week’s Education Guardian
- … stop and look at your teachers. They’re usually a surprisingly good indicator of whether you should start worrying. If they look calm, cool and collected, relax. My maths A-level exams are coming up in about three weeks and we still haven’t covered three chapters in the textbook, but my teacher’s not panicking, so I’m not panicking … yet.
Revision has highlighted a problem with recent AS papers. Instead of asking you to solve a problem directly the questions take you very slowly though the method required to reach the solution, dividing it up into a number of steps. This suits British students who have been used to answering GCSE questions written in this style. But international students find it confusing, particularly if the exam insists on using a particular method. They are used to being tested for their ability to find the most appropriate method to reach a solution.
Also, one question in a recent paper tells you that then asks you to use the Remainder Theorem to find the remainder when is divided by . The question is written this way because most British students are not taught long division of polynomials. However, international students usually have a much stronger algebra background and are tempted to use long division to find the remainder. But the examiners say:
- Some candidates clearly did not understand the meaning of the Remainder Theorem or the Factor Theorem and approached each of these by long division. They need to realise that when a particular method is stipulated in the question, any other approach is unacceptable.
I’m really not convinced by this – yes the Remainder Theorem is the easiest and quickest way to find the remainder, but what is wrong with using the (harder) good old long division? That technique should be encouraged.
It is this time of year that has attracted a lot of attention devoted to finding the dates of religious festivals. A very comprehensive calendar calculator for 25 different calendar systems can be found at Calendrica (Java applet) and details of these systems are given in a fascinating book Calendrical Calculations.
Algorithms to calculate Easter dates have been given by mathematicians through the ages, including Gauss (see for example Mind Over Mathematics: How Gauss Determined The Date of His Birth) but it does produce a few errors. In 1961 the Scottish mathematician T.H. O’Beirne published an algorithm in his Puzzles and Paradoxes column in the New Scientist subsequently reprinted in his book of the same name published by the Oxford University Press (sadly out of print but I throughly recommend looking for a second-hand copy).
O’Beirne’s algorithm (based on an 1876 article in Nature) has the merit of always giving the correct date as well as being easy to use. It is a simple exercise to write a program to do the work for you. Simple Example
The following process gives the date of Easter Sunday as the th day of the th month in year . It also gives the Golden Number and the epact ( or whichever is between 1 and 30 inclusive). All you have to do is start with the year and perform 10 division operations noting the quotients and remainders.
(Table produced by LaTable)
Have you any examination howlers? I don’t mean mistakes made by students but errors in the questions themselves, particularly those which make one wonder whether the examiner understands maths as well as they should.
My contribution is an A level question:
- The function is defined by and has domain
[That can’t be the tan function we all thought we knew]
The next one comes courtesy of Foostyle:
- . Show where this crosses the x-axis.
[Are you sure it’s the x-axis you want?]
Your turn …