Spoiler:question 8 test 4Show
so there's 0.1 chance of funny face with 1 chance of acceptance
0.8 chance of normal face with 0.5 chance of acceptance
0.1 chance of boring face with 0 chance of acceptance (hence number nine got rejected)
therefore chance of acceptance total is 0.1 from funny face, 0.4 from normal face and 0 from boring face. there's probably a better way to write this but i suck at maths lol
therefore big george's chance of having a funny face is 0.1/(0.1+0.4) = 0.2

second part
there's now 0.1 chance of funny face (1 acceptance chance) and 0.9 chance of normal face (0.5 acceptance chance)
so total is 0.1 from funny face and 0.45 from normal face
so total funny face chance is 0.1/0.55= 2/11 . so yeah it is different
done. i wish step was all this kind of stuff maybe i'd get in then loooooooooooooooooool
You are Here:
Home
> Forums
>< Study Help
>< Maths, science and technology academic help
>< Maths
>< Maths Exams

Trinity Admissions Test Solutions watch

 Follow
 221
 03042016 20:58
Last edited by Mop3476; 03042016 at 21:10. Reason: it said use a spoiler tag didn't it 
error_404_oops
 Follow
 0 followers
 3 badges
 Send a private message to error_404_oops
Offline3ReputationRep: Follow
 222
 27042016 00:01
Hey guys it seems the links to paper 4 and the maths+physics paper are dead. Any chance someone could post them again?

 Follow
 223
 27042016 00:14
(Original post by error_404_oops)
Hey guys it seems the links to paper 4 and the maths+physics paper are dead. Any chance someone could post them again? 
ServantOfMorgoth
 Follow
 38 followers
 2 badges
 Send a private message to ServantOfMorgoth
Offline2ReputationRep: Follow
 224
 27042016 00:22
(Original post by Zacken)
They seem to have been taken down by Trinity themselves and as such, I don't think it'd be okay for me to post them up, sorry! You do have 3 other tests which should prove more than enough. 
error_404_oops
 Follow
 0 followers
 3 badges
 Send a private message to error_404_oops
Offline3ReputationRep: Follow
 225
 27042016 00:22
(Original post by Zacken)
They seem to have been taken down by Trinity themselves and as such, I don't think it'd be okay for me to post them up, sorry! You do have 3 other tests which should prove more than enough. 
ServantOfMorgoth
 Follow
 38 followers
 2 badges
 Send a private message to ServantOfMorgoth
Offline2ReputationRep: Follow
 226
 27042016 00:25
(Original post by error_404_oops)
Afraid of the big bad Trinity mathmo gestapo are we? 
error_404_oops
 Follow
 0 followers
 3 badges
 Send a private message to error_404_oops
Offline3ReputationRep: Follow
 227
 27042016 00:27
Did some digging and found these elsewhere on the internet:
https://www.yumpu.com/en/document/vi...hematicswith
https://www.yumpu.com/en/document/vi...mathematics2
Are these the missing papers? 
error_404_oops
 Follow
 0 followers
 3 badges
 Send a private message to error_404_oops
Offline3ReputationRep: Follow
 228
 27042016 00:34
(Original post by ServantOfMorgoth)
I think with his reasoning for not giving the paper to you, he should also delete it from his computer since it used to be online but they removed it and they want no one to see the paper anymore. 
ServantOfMorgoth
 Follow
 38 followers
 2 badges
 Send a private message to ServantOfMorgoth
Offline2ReputationRep: Follow
 229
 27042016 00:37
(Original post by error_404_oops)
I know haha. I'm not even 'competition' to any of you lot; I'm just a bored PhysNatSci offer holder on an (unplanned) gap year wanting to do some maths!
If you're that bored why don't you start Vector/Multivariable Calculus? It'll be the most useful thing to do because the theorems are all similar and learning them all in a short space of time makes you confuse them. 
error_404_oops
 Follow
 0 followers
 3 badges
 Send a private message to error_404_oops
Offline3ReputationRep: Follow
 230
 27042016 00:46
(Original post by ServantOfMorgoth)
I'm already at uni but I'm just giving my input where I see injustice.
If you're that bored why don't you start Vector/Multivariable Calculus? It'll be the most useful thing to do because the theorems are all similar and learning them all in a short space of time makes you confuse them. 
error_404_oops
 Follow
 0 followers
 3 badges
 Send a private message to error_404_oops
Offline3ReputationRep: Follow
 231
 27042016 00:51
Btw I've posted some links to what could potentially be the missing papers because I might have found them elsewhere on the internet (or I've found some extra ones!). The TSR mafia are presumably still checking that I've not broken any of their stupid rules...

ServantOfMorgoth
 Follow
 38 followers
 2 badges
 Send a private message to ServantOfMorgoth
Offline2ReputationRep: Follow
 232
 27042016 00:52
(Original post by error_404_oops)
I have been, Riley Hobson & Bence's Mathematical Methods textbook has been an absolute godsend!
http://www.thestudentroom.co.uk/show....php?t=3770439
Also Zacken may be doubly mad now that were not talking about the thread title topic so if you wanna say anything more you should PM me. 
error_404_oops
 Follow
 0 followers
 3 badges
 Send a private message to error_404_oops
Offline3ReputationRep: Follow
 233
 27042016 15:57
(Original post by error_404_oops)
Did some digging and found these elsewhere on the internet:
https://www.yumpu.com/en/document/vi...hematicswith
https://www.yumpu.com/en/document/vi...mathematics2
Are these the missing papers? 
 Follow
 234
 12112016 21:42
(Original post by joostan)
Paper 3 Question 1:
Spoiler:Show
Paper 3 Question 2:
Paper 3 Question 6:
x^2=(10^n1)^2=10^{2n}2(10^n)+1= \left( \displaystyle\sum_{r=n+1}^{2n} 9(10)^r \right) + 8(10^n)+1[/latex].
Can anyone explain the last part? Im not sure my decimal expansion understanding is great XD 
 Follow
 235
 12112016 22:33
(Original post by LeopardK)
For Q6 I didn't follow how you got x^2 to equal the last part of this
x^2=(10^n1)^2=10^{2n}2(10^n)+1= \left( \displaystyle\sum_{r=n+1}^{2n} 9(10)^r \right) + 8(10^n)+1[/latex].
Can anyone explain the last part? Im not sure my decimal expansion understanding is great XD
So . But then
We can extend this idea to any .Last edited by joostan; 12112016 at 22:35. 
 Follow
 236
 03122016 14:06
For Test 1 Q9, would it be much easier to calculate the maximum point of f(x) = Mx  exp(x), and show that the maximum point is positive? Because there is a zero point between 0 and 1, if the maximum point's x coordinate is larger than 1, and its y coordinate is larger than 0 then there must be only 1 solution larger than 1.

 Follow
 237
 03122016 15:24
(Original post by Renzhi10122)
Specimen 2, q8
Hint:
Spoiler:Show
Find the area of a fifth of the pentagon, namely a triangle of it
Solution:
Spoiler:Show
Let AC'=a, C'D'=b and CC'=c.We have where O is the center of the pentagon. Then giving by double angle formulae. Also, if then . Noting that , we have .
Now, so .
We have so
We (I) know that so so
EDIT: Just realised that I haven't actually finished the question...
Hence, the area of the pentagon is

YourBoiTudor
 Follow
 0 followers
 1 badge
 Send a private message to YourBoiTudor
Offline1ReputationRep: Follow
 238
 04122016 16:27
(Original post by Euclidean)
Specimen Paper III, Question 8:
Spoiler:Show
In a grid of 8 dots, we have an area of 7 x 7 = 49 unit squares
It follows that there are 49 unit squares (1x1 squares)
There are 6 double squares on each row (2x2 squares) and hence 6x6 = 36 double squares in the whole grid
There are 5 triple squares on each row (3x3 squares) and hence 5x5 = 25 triple squares in the whole grid
There are 4 quadruple squares on each row (4x4 squares) and hence 4x4=16 quadruple squares in the whole grid
There are 3 quintuple squares on each row (5x5 squares) and hence 3x3=9 quintuple squares in the whole grid
There are 2 sixfold squares on each row (6x6 squares) and hence 2x2=4 sixfold squares in the whole grid
There is 1 sevenfold square in the grid only
Hence there are squares in the grid who have sides parallel to the dots in the grid
It's clear that this may be applicable to any grid of n dots such that the number of squares with sides parallel to the dots is equal to the sum of all square numbers less than n
Assuming a square must have dots for all four of it's vertices:
Considering diagonal squares:
When I say a 1x1 diagonal square I mean a x square but have written it this way for simplicity.
1x1 diagonal squares take up a 2x2 parallel area in the grid. Hence there are the same number of 1x1 diagonal squares as 2x2 parallel squares in the grid = 36
2x2 diagonal squares take up a 4x4 parallel area in the grid. Hence there are the same number of 2x2 diagonal squares in the grid as 4x4 parallel squares = 16
3x3 diagonal squares take up a 6x6 parallel area in the grid. Hence there are the same number of 3x3 diagonal squares in the grid as 6x6 parallel squares = 4
There can be no 4x4 diagonal squares contained in the grid.
Therefore there are total squares
It is easy to prove that the vertices of ANY square themselves lie on one of the original 140 squares which are parallel to the axes.
In fact, taking any one of those 140 squares, The number of squares that can be made such that its vertices lie of the original square is equal to the side length of the original square (Try it, too lazy to provide diagram).
Since the solution to part (i) for a lattice with x^2 points is the sum of the squares from 1 to (x1), the solution to the second part is the sum of the CUBES from 1 to (x1). This comes out to be 784 for x = 8. 
Euclidean
 Follow
 22 followers
 10 badges
 Send a private message to Euclidean
Offline10ReputationRep: Follow
 239
 07122016 14:43
(Original post by YourBoiTudor)
You did not count all the squares. Sorry for responding to an old thread but this error must be fixed.
It is easy to prove that the vertices of ANY square themselves lie on one of the original 140 squares which are parallel to the axes.
In fact, taking any one of those 140 squares, The number of squares that can be made such that its vertices lie of the original square is equal to the side length of the original square (Try it, too lazy to provide diagram).
Since the solution to part (i) for a lattice with x^2 points is the sum of the squares from 1 to (x1), the solution to the second part is the sum of the CUBES from 1 to (x1). This comes out to be 784 for x = 8.
Thanks for your response, I hadn't realised that my attempt was flagged as the solution but I have amended it now. As far as I am aware, the number of squares in the grid of size 8 is not the sum of the cubes from 1 to (81) inclusive, and I will explain why by simplifying the problem to a grid of size 3.
Considering a grid of size 3, there are 4 + 1 = 5 squares which are parallel to the grid by part (i) but the square of size 2 can be rotated to give another square inside itself with vertices along it's original edges. In the larger grid, it is clear that for each square of size n by n in the grid itself, there are n squares which have vertices along it's edges as you claim. However, this factor of n only applies to the number of squares of size n which isn't n^{2}. The number of squares of size n is given by (xn)^{2} where x is the grid size.
So represents the number of squares in the grid of size x.Last edited by Euclidean; 07122016 at 14:44. 
YourBoiTudor
 Follow
 0 followers
 1 badge
 Send a private message to YourBoiTudor
Offline1ReputationRep: Follow
 240
 07122016 16:37
(Original post by Euclidean)
Hi
Thanks for your response, I hadn't realised that my attempt was flagged as the solution but I have amended it now. As far as I am aware, the number of squares in the grid of size 8 is not the sum of the cubes from 1 to (81) inclusive, and I will explain why by simplifying the problem to a grid of size 3.
Considering a grid of size 3, there are 4 + 1 = 5 squares which are parallel to the grid by part (i) but the square of size 2 can be rotated to give another square inside itself with vertices along it's original edges. In the larger grid, it is clear that for each square of size n by n in the grid itself, there are n squares which have vertices along it's edges as you claim. However, this factor of n only applies to the number of squares of size n which isn't n^{2}. The number of squares of size n is given by (xn)^{2} where x is the grid size.
So represents the number of squares in the grid of size x.
Sorry, this is what happens when I try to do everything in my head, it appears I multiplied the factors by the wrong squares.
Related discussions
 Oxford Maths Admissions Test 2008
 CSAT For Computer Science Undergrad Admissions 2016 ...
 Cambridge Interview Offers 2016
 Maths Interviews Preparation 2016
 Cambridge 2018 engineering applicants
 ENGAA and Engineering Applicants 2017
 Is applying to Trinity risky?
 Ask an Admissions Tutor  Peterhouse
 Oxford Physics: PAT test discussion
 Oxford MAT Test  5th Nov 2014
see more
Related university courses

Mathematics
University of Birmingham

French and Mathematics
University of Leeds

Mathematics with Actuarial Science
Queen Mary University of London

Mathematics and Meteorology
University of Reading

Mathematics with Statistics
HeriotWatt University

French and Mathematics
University of Stirling

Geography and Mathematics
Keele University

Mathematics
Central Lancashire (UCLan)

Mathematics and Physics
University of Aberdeen

Mathematics and Philosophy
Keele University
see more
We have a brilliant team of more than 60 Support Team members looking after discussions on The Student Room, helping to make it a fun, safe and useful place to hang out.
 Notnek
 charco
 Mr M
 Changing Skies
 F1's Finest
 RDKGames
 davros
 Gingerbread101
 Kvothe the Arcane
 TeeEff
 Protostar
 TheConfusedMedic
 nisha.sri
 claireestelle
 Doonesbury
 furryface12
 Amefish
 Lemur14
 brainzistheword
 Quirky Object
 TheAnxiousSloth
 EstelOfTheEyrie
 CoffeeAndPolitics
 Labrador99
 EmilySarah00
 thekidwhogames
 entertainmyfaith
 Eimmanuel
 Toastiekid
 CinnamonSmol
 Qer
 The Empire Odyssey
 RedGiant
 Sinnoh