2010 Paper 2 Q10

Year: 2010
Paper: 2
Question Number: 10

Course: UFM Mechanics
Section: Momentum and Collisions 1

Difficulty: 1600.0 Banger: 1516.0

Problem

  1. In an experiment, a particle \(A\) of mass \(m\) is at rest on a smooth horizontal table. A particle \(B\) of mass \(bm\), where \(b >1\), is projected along the table directly towards \(A\) with speed \(u\). The collision is perfectly elastic. Find an expression for the speed of \(A\) after the collision in terms of \(b\) and \(u\), and show that, irrespective of the relative masses of the particles, \(A\) cannot be made to move at twice the initial speed of \(B\).
  2. In a second experiment, a particle \(B_1\) is projected along the table directly towards \(A\) with speed \(u\). This time, particles \(B_2\), \(B_3\), \(\ldots\,\), \(B_n\) are at rest in order on the line between \(B_1\) and \(A\). The mass of \(B_i\) (\(i=1\), \(2\), \(\ldots\,\), \(n\)) is \(\lambda^{n+1-i}m\), where \(\lambda>1\). All collisions are perfectly elastic. Show that, by choosing \(n\) sufficiently large, there is no upper limit on the speed at which \(A\) can be made to move. In the case \(\lambda=4\), determine the least value of \(n\) for which \(A\) moves at more than \(20u\). You may use the approximation \(\log_{10}2 \approx 0.30103\).

Solution

  1. TikZ diagram
    Since the collision is perfectly elastic, the speed of approach and separation are equal, ie \(v_B = v_A - u\) \begin{align*} \text{COM}: && bmu &= bm(v_A - u) + mv_A \\ \Rightarrow && (b+1)v_A &= 2bu \\ \Rightarrow && v_A &= \frac{2b}{b+1} u \end{align*} Since \(0 < \frac{b}{b+1} < 1\), the largest \(0 < v_A < 2u\)
  2. After the first collision with each \(B_i\) we will have \(\displaystyle v_{i+1} = \frac{2\lambda}{\lambda + 1}v_i\), ie \(\displaystyle v_{i+1} = \left (\frac{2\lambda}{\lambda + 1} \right)^i u\) and so \(\displaystyle v_A = \left (\frac{2\lambda}{\lambda + 1} \right)^n u\) which can be arbitrarily large. Suppose \(\lambda = 4\), then \begin{align*} && 20u &< v_A \\ &&&= \left (\frac{8}{5} \right)^n u \\ \Rightarrow && \log_{10} 20 < n \log_{10}(16/10) \\ && \log_{10} 2 + 1 < n 4\log_{10} 2 - n \\ \Rightarrow && n &> \frac{ \log_{10} 2 + 1}{ 4\log_{10} 2 - 1} \\ &&&\approx \frac{0.30103+1}{4 \times 0.30103 -1}\\ &&&= \frac{1.30103}{0.20412} \\ &&&>6 \end{align*} So \(n =7\) is the smallest possible
Examiner's report
— 2010 STEP 2, Question 10
Mean: ~7.5 / 20 (inferred) ~15.3% attempted (inferred) Inferred ~7.5/20: 'a little easier' than Q9 (6.5) → +1.0. Inferred ~15.3% from 'exactly the same number of responses as Q9' (153).

Eliciting exactly the same number of responses as Q9, this question was found a little easier, but only because the first part was very standard A-level "collisions" work. Applying this first result repeatedly required only clear thinking and clear presentation, and those who persevered generally scored quite highly and opened up the prospect of some straightforward log. work in the final part of (ii). The biggest hurdle to a completely successful solution usually arose in poor numerical justification of the final answer.

There were just under 1000 entries for paper II this year, almost exactly the same number as last year. Of this number, more than 60 scored over 90% while, at the other end of the scale, almost 200 failed to score more than 40 marks. In hindsight, many of the pure maths questions were a little too accessible and lacked a sufficiently tough 'difficulty gradient', so that scores were slightly higher than anticipated. This was reflected in the grade boundaries for the "1" and the "2" (around ten marks higher than is generally planned) in particular. Next year's questions may be expected to be a little bit more demanding, but only in the sense that the final 5 or 6 marks on each question should have rather more bite to them: it should certainly not be the case that all questions are tougher to get into at the outset. Most candidates attempted the requisite number of questions (six), although many of the weaker brethren made seven or eight attempts, most of which were feeble at best and they generally only picked up a maximum of 5 or 6 marks per question. It is a truth universally acknowledged that practice maketh if not perfect then at least a whole lot better prepared, and choosing to waste time on a couple of extra questions is not a good strategy on the STEPs. The major down-side of the present modular examination system is that students are not naturally prepared to approach the subject holistically; ally this to the current practice of setting highly-structured, fully-guided questions requiring no imagination, insight, depth or planning from A-level candidates in a system that fails almost nobody and rewards even the most modestly able with high grades in a manner reminiscent of a dentist giving lollipops to kids who have done little more than been brave and seen the course through, it is even more important to ensure a full and thorough preparation for these papers. The 20% of the entry who seem to be either unprepared for the rigours of a STEP, or unwittingly possessed of only a smattering of basic advanced-level skills, seems to be remarkably steady year-on-year, even in a year when their more suitably prepared compatriots found the paper appreciably easier than usual. As in previous years, the pure maths questions provided the bulk of candidates' work, with relatively few efforts to be found at the applied ones.

Source: Cambridge STEP 2010 Examiner's Report · 2010-full.pdf
Rating Information

Difficulty Rating: 1600.0

Difficulty Comparisons: 0

Banger Rating: 1516.0

Banger Comparisons: 1

Show LaTeX source
Problem source
\begin{questionparts}
\item
In an experiment, a particle $A$ of mass $m$ is at rest on a smooth horizontal table. A particle $B$ of mass $bm$, where $b >1$, is projected along the table directly towards $A$ with speed $u$. The collision is perfectly elastic. 
Find an expression for the speed of $A$ after the collision in terms of $b$ and $u$, and show that, irrespective of the relative masses of the particles,  $A$ cannot be made to move at twice the initial speed of $B$. 
\item 
In a second experiment, a particle $B_1$ is projected along the table directly towards $A$ with speed $u$. This time,  particles $B_2$, $B_3$, $\ldots\,$, $B_n$ are at rest in order on the line between $B_1$ and $A$. The mass of $B_i$ ($i=1$, $2$, $\ldots\,$, $n$) is $\lambda^{n+1-i}m$, where $\lambda>1$. All collisions are perfectly elastic. Show that, by choosing $n$ sufficiently large, there is no upper limit on the speed at which $A$ can be made to move. In the case $\lambda=4$, determine the least value of $n$ for which $A$ moves at more than $20u$. You may use the approximation $\log_{10}2 \approx 0.30103$.
\end{questionparts}
Solution source
\begin{questionparts}
\item \begin{center}
    \begin{tikzpicture}[scale=0.7]
        \def\h{2.75};
        \def\arrowheight{1.5};
        \def\arrowwidth{0.4};
        \def\massa{$bm$};
        \def\massb{$m$};
        \def\velocityua{$u$};
        \def\velocityub{$0$};
        \def\velocityva{$v_B$};
        \def\velocityvb{$v_A$};


        \draw (0,0) circle (1);
        \draw (2.5,0) circle (1);

        \draw (8,0) circle (1);
        \draw (10.5,0) circle (1);
        
        
        \node at (1.25, \h) {before collision};
        \node at (9.25, \h) {after collision};

        \draw[dashed] (5.25,-\arrowheight) -- (5.25, \arrowheight);

            \node at (0,0) {\massa};
            \draw[->, thick, red] (-\arrowwidth, \arrowheight) -- (\arrowwidth, \arrowheight);
            \node[above, red] at (0, \arrowheight) {\velocityua};
            \node at (2.5,0) {\massb};
            \draw[->, thick, red] (2.5-\arrowwidth, \arrowheight) -- (2.5+\arrowwidth, \arrowheight);  \node[above, red] at (2.5, \arrowheight) {\velocityub};
            \node at (8,0) {\massa};
            \draw[->, thick, red] (8-\arrowwidth, \arrowheight) -- (8+\arrowwidth, \arrowheight);  
            \node[red,above] at (8, \arrowheight) {\velocityva};
            \node at (10.5,0 ) {\massb};
            \draw[->, thick, red] (10.5-\arrowwidth, \arrowheight) -- (10.5+\arrowwidth, \arrowheight);  
            \node[red,above] at (10.5, \arrowheight) {\velocityvb};
    \end{tikzpicture}
\end{center}

Since the collision is perfectly elastic, the speed of approach and separation are equal, ie $v_B = v_A - u$

\begin{align*}
\text{COM}: && bmu &= bm(v_A - u) + mv_A \\
\Rightarrow && (b+1)v_A &= 2bu \\
\Rightarrow && v_A &= \frac{2b}{b+1} u
\end{align*}

Since $0 < \frac{b}{b+1} < 1$, the largest $0 < v_A < 2u$

\item After the first collision with each $B_i$ we will have $\displaystyle  v_{i+1} = \frac{2\lambda}{\lambda + 1}v_i$, ie $\displaystyle v_{i+1} = \left (\frac{2\lambda}{\lambda + 1} \right)^i u$ and so $\displaystyle v_A = \left (\frac{2\lambda}{\lambda + 1} \right)^n u$ which can be arbitrarily large. Suppose $\lambda = 4$, then

\begin{align*}
&& 20u &< v_A \\
&&&= \left (\frac{8}{5} \right)^n u \\
\Rightarrow && \log_{10} 20 < n \log_{10}(16/10) \\
&& \log_{10} 2 + 1 < n 4\log_{10} 2 - n \\
\Rightarrow && n &> \frac{ \log_{10} 2 + 1}{ 4\log_{10} 2 - 1} \\
&&&\approx \frac{0.30103+1}{4 \times 0.30103 -1}\\
&&&= \frac{1.30103}{0.20412} \\
&&&>6
\end{align*}

So $n =7$ is the smallest possible
\end{questionparts}