TNDOT Friday 12: Algebra

Ok, this is the final TNDOT on the 1911 pass Algebra Matric exam, consisting of the final three questions. The previous parts are TNDOT 10 and TNDOT 11, both of which have now been updated with solutions.

These last three questions don’t seem to me so interesting, except for pondering the way they were asked and what was expected. In any case, I’ll be interested in people’s thoughts.

9. Find the value of \color{blue}\boldsymbol{_nC_r} without assuming the value of \color{blue}\boldsymbol{_nP_r}.

In how many ways can n different letters be arranged in a row, 3 specified letters not being permitted to stand at either end of the row ?

 

10. Prove the Binomial Theorem for a positive integral exponent. 

Shew that the coefficient of the \color{Blue}\boldsymbol{(r+1)^{th}} term of \color{Blue}\boldsymbol{(1+x)^{n+1}} is equal to the sum of the coefficient of the \color{Blue}\boldsymbol{r^{th}} term and \color{Blue}\boldsymbol{(r+1)^{th}} terms of \color{Blue}\boldsymbol{(1+x)^{n}}.

Give a reason why this is necessarily the case.

 

11. Define a logarithm ; and prove that 

\color{blue}\boldsymbol{\log_cb\cdot\log_ac\cdot\log_ba=1.}

 Given \color{blue}\boldsymbol{\log 7 = .8450980}, and \color{blue}\boldsymbol{\log 9.824394 = .9923057}, find the 540th root of .00007.

Visited 39 times, 1 visit(s) today

14 Replies to “TNDOT Friday 12: Algebra”

  1. OK, no one is answering, so I will offer a suggestion for Q10.

    An induction proof for the binomial theorem would likely have been a standard proof to know in 1911.

    Explaining the second part is easy for anyone sufficiently familiar with Pascal’s triangle.

    1. Thanks, RF. I’m not expecting too many responses on this one. I doubt that induction was expected for Q110. What makes you think so? Also, I think the second part is probably intended to be done directly by enumerating the number of ways of choosing by two different methods.

      1. I suppose induction just came to mind as the “natural” way to prove the binomial theorem.

        As to the second part, writing each out as a binomial coefficient and then simplifying the algebra would be my first thought – but I’m not sure if it is the only approach that would have been taught in 1911.

        I agree though that these are not the most interesting questions on the paper.

        1. No big deal. I decided it was worth doing full papers, in chunks like I’m doing it. So I’ll complete the papers already begun. I don’t expect people to work on questions of little interest. I’ll still try to supply good solutions, with some thought on how the questions were expected to be tackled at the time.

  2. For Q11, I have seen textbooks from the 1940s that define a logarithm as the area under a y=\frac{1}{t} graph from t=1 to t=x. I assume this is what they wanted.

    For the second part, writing \log_a{b} as \frac{\log{b}}{\log{a}} etc gives \log_c{b} \times \log_a{c} \times \log_b{a}=\frac{\log{b}}{\log{c}} \times \frac{\log{c}}{\log{a}} \times \frac{\log{a}}{\log{c}} which then becomes \frac{\log{b} \times \log{c} \times \log{a}}{\log{c} \times \log{a} \times \log{b}}=1

      1. Unless you have any textbooks from 1911, we may never know.

        I think it is more likely to NOT be what I suggested given this was the pass exam and they probably wanted the logarithm-exponential relationship definition.

  3. If we go back to 1202, in Liber Abaci, Fibonacci expected the reader to be able to multiply 8 digit numbers by 8 digit numbers essentially as an exercise in mental arithmetic – and this was only chapter 2.

  4. For the second part of Q11, it helps to imagine a draft version of the question being simply phrased without the “hints”: Find the 540th root of .00007. How do you answer that with 1911 technology? Logarithm tables.

    Take the log of .00007, divide it by 540, then take the antilog.

    The log of .00007 won’t be in your table (which runs from log 1 = 0 to log 10 = 1 in increments of .0001 or so), but the log of 7 will be, so you look that up and add the log of .00001 which is obviously -5, yielding -4.154902 as your estimate of the log of .00007.

    Next you divide by 540 (the most tedious part, I think, using plain old long division). Now you have the log of the 540th root of .00007, and you want to take the antilog, which means finding your number in the “log” column of the log table. But it isn’t in range so you have to add an integer to make something between 0 and 1, look up the antilog of that, and divide by a power of 10 to cancel the effect of the integer you added.

    But during an exam, you don’t want people referencing huge tables, so you include in the question the exact 2 log table entries they’re going to need, in a similar form to how they would be found in a book, requiring the same amount of “compensate for adding an integer to the log by shifting a decimal point” logic. That’s an important calculator skill, from when people were the calculators, and testing that skill seems to be the main point of the question.

    Giving just those 2 log table entries, with no added decoys, made the question a little easier. If you know the outline of the solution, you can skip a lot of steps, guess that the answer is 9.824394 times some power of 10, and only one choice of power of 10 makes the answer remotely plausible.

Leave a Reply

Your email address will not be published. Required fields are marked *

The maximum upload file size: 128 MB. You can upload: image, audio, video, document, spreadsheet, interactive, text, archive, code, other. Links to YouTube, Facebook, Twitter and other services inserted in the comment text will be automatically embedded. Drop file here