Shayantan C. A Level Maths tutor, A Level Further Mathematics  tutor,...

Shayantan C.

Currently unavailable: for regular students

Degree: MMath (Bachelors) - Warwick University

Contact Shayantan
Send a message

All contact details will be kept confidential.

To give you a few options, we can ask three similar tutors to get in touch. More info.

Contact Shayantan

About me

Hello everyone - the name is Shay. I'm in second year studying mathematics at the University of Warwick. I sat my A-Levels in 2015 (Maths, Further Maths, Economics, Chemistry and French) and should be able to help with A-Level Maths & Further Maths and GCSE French questions, as well as maths university admissions tests (MAT & STEP) and UCAS Personal Statements. My objective is simple - to ensure my tutee understands the ideas behind the key ideas of topics. I will do my best to help people understand what's going on in a concise and enjoyable manner. I have some mentoring experience at school. 

In my sessions, I will try to make maths and/or economics seem enjoyable to you - while many of you may not believe this, but these subjects are really amazing. A lot can be done in a fun hour - there will be some jokes and banter, but I will strive to ensure my tutee understands the material. I will use as many different ways (diagrams, words, analogies, poor jokes - my puns, despite what my friends say, are in my opinion unrivalled) as possible to explain a concept, until you are confident enough to explain what on earth is going on to me - if not me, you can always try the dog!

If you have any questions, send me a 'WebMail' or book a 'Meet the Tutor Session'! (both accessible through this website). Remember to tell me your exam board and what you're struggling with - I can't help you if I don't know what to help you with!

I look forward to meeting you!

Subjects offered

SubjectLevelMy prices
Economics A Level £22 /hr
Further Mathematics A Level £22 /hr
Maths A Level £22 /hr
Economics GCSE £20 /hr
French GCSE £20 /hr
Further Mathematics GCSE £20 /hr
Maths GCSE £20 /hr
-Personal Statements- Mentoring £22 /hr
.MAT. Uni Admissions Test £25 /hr
.STEP. Uni Admissions Test £25 /hr

Qualifications

QualificationLevelGrade
Mathematics (OCR)A-LevelA*
Further Mathematics (OCR)A-LevelA
Economics (OCR)A-LevelA*
Chemistry A (OCR)A-LevelA
French (AQA)A-LevelB
AEA Mathematics (Edexcel)Uni Admissions TestMerit
Disclosure and Barring Service

CRB/DBS Standard

No

CRB/DBS Enhanced

No

Currently unavailable: for regular students

General Availability

Weeks availability
MonTueWedThuFriSatSun
Weeks availability
Before 12pm12pm - 5pmAfter 5pm
MONDAYMONDAY
TUESDAYTUESDAY
WEDNESDAYWEDNESDAY
THURSDAYTHURSDAY
FRIDAYFRIDAY
SATURDAYSATURDAY
SUNDAYSUNDAY

Please get in touch for more detailed availability

Ratings and reviews

5from 1 customer review

Kirsty (Parent) September 16 2016

Questions Shayantan has answered

How does proof by mathematical induction work?

Mathematical induction is a way of proving statements in maths. The principle is quite similar to dominoes (not pizza, the game) - if you push the first one, the second one will be pushed over, pushing the third one and so on.  There are 3 stages to induction. The first stage is to prove that ...

Mathematical induction is a way of proving statements in maths. The principle is quite similar to dominoes (not pizza, the game) - if you push the first one, the second one will be pushed over, pushing the third one and so on. 

There are 3 stages to induction. The first stage is to prove that the base case, n = 1 is true (essentially the first domino). The second stage involves you assuming the case n = k is true. The final stage involves you using the assumption above to show that the case n = k + 1 is also true (essentially you're showing that if you push the kth domino, the (k + 1)th domino will also be pushed over).

Here is an example of proof by induction being applied:

For any positive integer n, 1 + 2 + 3 + ... + n = n(n + 1)/2.

Let P(n) be the assumption that 1 + 2 + 3 + ... + n = n(n + 1)/2. Consider the base case, n = 1:

Left-hand side = 1. Right-hand side = 1(1 + 1)/2 = 1
As LHS = RHS, P(1) is true.

Assume that P(k) is true i.e. 1 + 2 + 3 + ... + k = k(k + 1)/2. Consider P(k + 1) [remember we have to use P(k) somewhere here]

1 + 2 + 3 + ... + k + (k + 1) = k(k + 1)/2 + (k + 1) (using P(k))
Taking a factor of (k + 1) from the RHS:
k(k + 1)/2 + (k + 1) = (k + 1)[k/2 + 1] = (k + 1)(k + 2)/2 = (k + 1)((k + 1) + 1)/2 i.e. P(k + 1) is true.

Therefore, as P(1) is true and P(k) true implies P(k + 1) is true, by the principle of mathematical induction, 1 + 2 + 3 + ... + n = n(n + 1)/2

see more

1 year ago

301 views

What is the difference between competitiveness and contestability?

Competitiveness is what is says on the tin really - if there are many firms in an industry each with a similar degree of market power, the market is competitive.  Contestability is something a little more subtle. It is the perceived threat of competition. For example, an industry may be an ol...

Competitiveness is what is says on the tin really - if there are many firms in an industry each with a similar degree of market power, the market is competitive. 

Contestability is something a little more subtle. It is the perceived threat of competition. For example, an industry may be an oligipoly, where there are only a few firms each with a large degree of market power. However, if there are low barriers to entry (i.e. low sunk costs, low costs of red tape) - basically if it's easy for new firms to enter the industry - incumbent firms will act as if there is actual competition. Contestability is all about the perceived threat of new firms entering the market and taking away some of the market power of incumbent firms.

see more

1 year ago

438 views
Send a message

All contact details will be kept confidential.

To give you a few options, we can ask three similar tutors to get in touch. More info.

Contact Shayantan

Still comparing tutors?

How do we connect with a tutor?

Where are they based?

How much does tuition cost?

How do tutorials work?

Cookies:

We use cookies to improve our service. By continuing to use this website, we'll assume that you're OK with this. Dismiss

mtw:mercury1:status:ok