We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
To save this undefined to your undefined account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your undefined account.
Find out more about saving content to .
To send this article to your Kindle, first ensure [email protected] is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
Mr J. F. Cameron of Gonville and Caius College, Cambridge, has suggested the use of factorial functions such as or n! to solve Whewell's problem. I had excluded them as beyond the bounds of ordinary arithmetic. I append half a score of my attempts with the factorials; they could be easily increased.
A system of n non-homogeneous linear equations in n variables has one and only one solution if the homogeneous system obtained from the given system by putting all the constant terms equal to zero has no solution except the null solution.
This may be proved independently by similar reasoning to that given for Theorem I., or it may be deduced from that theorem. We follow the latter method.
For n = 1, the theorem is that, if a = 0, the equation ax = 0 has a solution for which x is not zero. This is obviously true. And the case of n variables can easily be made to depend on that of n – 1 variables. For brevity we show the method by taking n = 3.
Let z1, z2, z3, … be a, sequence of quantities, real or complex, such that, corresponding to any arbitrary small positive quantity ∈, we can find a positive integer n such that | zn+p – zn | < ∈ for all positive integral values of p.