The most elementary proof that ?

2016 ◽  
Vol 100 (549) ◽  
pp. 429-434
Author(s):  
Nick Lord

Here we present a simplification of one of the standard proofs that . We then look at extensions of the new approach, and add comments on the nature of the simplification (which relates to Step 1 below) and finally on the literature.As in most proofs of the result, we shall actually prove that ; becausethis is equivalent to the result sought.

1935 ◽  
Vol 4 (3) ◽  
pp. 112-117
Author(s):  
A. J. Macintyre ◽  
R. Wilson

Attention has recently been drawn to the obscurity of the usual presentations of Mayer's method of solution of the total differential equationThis method has the practical advantage that only a single integration is required, but its theoretical discussion is usually based on the validity of some other method of solution. Mayer's method gives a result even when the equation (1) is not integrable, but this cannot of course be a solution. An examination of the conditions under which the result is actually an integral of equation (1) leads to a proof of the existence theorem for (1) which is related to Mayer's method of solution in a natural way, and which moreover appears to be novel and of value in the presentation of the subject.


1989 ◽  
Vol 105 (3) ◽  
pp. 459-462 ◽  
Author(s):  
Hitoshi Kaneta ◽  
Tatsuya Maruta

Let q be the finite field of q elements. Denote by Sr q the projective space of dimension r over q. In Sr,q, where r ≥ 2, a k-arc is defined (see [4]) as a set of k points such that no j + 2 lie in a Sj,q, for j = 1,2,…, r−1. (For a k-arc with k > r, this last condition holds for all j when it holds for j = r−1.) A rational curve Cn of order n in Sr,q, is the set


1943 ◽  
Vol 33 ◽  
pp. 17-18
Author(s):  
C. E. Walsh

Numerous proofs have been given of this familiar theorem, which states that if a1, a2, …, an are positive, and not all equal, thenThe following is an elementary proof by induction, which I have not seen used before. It is, of course, not claimed to be novel, and not likely to be so.


1999 ◽  
Vol 59 (3) ◽  
pp. 495-508
Author(s):  
Kevin Callahan ◽  
Kathy Hann

In this paper we present an elementary proof of a congruence by subtraction relation. In order to prove congruence by subtraction, we produce a dissection relating equal sub-polytopes. An immediate consequence of this relation is an Euler-type volume identity in ℝ3 which appeared in the Unsolved Problems section of the December 1996 MAA Monthly.This Euler-type volume identity relates the volumes of subsets of a polytope called wedges that correspond to its faces, edges, and vertices. A wedge consists of the inward normal chords of the polytope emanating from a face, vertex, or edge. This identity is stated in the theorem below.Euler Volume Theorem. For any three dimensional convex polytope PThis identity follows immediately from


Author(s):  
F. W. J. Olver

In a recent paper (1) I described a method for the numerical evaluation of zeros of the Bessel functions Jn(z) and Yn(z), which was independent of computed values of these functions. The essence of the method was to regard the zeros ρ of the cylinder functionas a function of t and to solve numerically the third-order non-linear differential equation satisfied by ρ(t). It has since been successfully used to compute ten-decimal values of jn, s, yn, s, the sth positive zeros* of Jn(z), Yn(z) respectively, in the ranges n = 10 (1) 20, s = 1(1) 20. During the course of this work it was realized that the least satisfactory feature of the new method was the time taken for the evaluation of the first three or four zeros in comparison with that required for the higher zeros; the direct numerical technique for integrating the differential equation satisfied by ρ(t) becomes unwieldy for the small zeros and a different technique (described in the same paper) must be employed. It was also apparent that no mere refinement of the existing methods would remove this defect and that a new approach was required if it was to be eliminated. The outcome has been the development of the method to which the first part (§§ 2–6) of this paper is devoted.


Antiquity ◽  
2015 ◽  
Vol 89 (347) ◽  
pp. 1174-1188 ◽  
Author(s):  
Rowena Y. Banerjea ◽  
Michael Fulford ◽  
Martin Bell ◽  
Amanda Clarke ◽  
Wendy Matthews

Abstract


1949 ◽  
Vol 14 (3) ◽  
pp. 159-166 ◽  
Author(s):  
Leon Henkin

Although several proofs have been published showing the completeness of the propositional calculus (cf. Quine (1)), for the first-order functional calculus only the original completeness proof of Gödel (2) and a variant due to Hilbert and Bernays have appeared. Aside from novelty and the fact that it requires less formal development of the system from the axioms, the new method of proof which is the subject of this paper possesses two advantages. In the first place an important property of formal systems which is associated with completeness can now be generalized to systems containing a non-denumerable infinity of primitive symbols. While this is not of especial interest when formal systems are considered as logics—i.e., as means for analyzing the structure of languages—it leads to interesting applications in the field of abstract algebra. In the second place the proof suggests a new approach to the problem of completeness for functional calculi of higher order. Both of these matters will be taken up in future papers.The system with which we shall deal here will contain as primitive symbolsand certain sets of symbols as follows:(i) propositional symbols (some of which may be classed as variables, others as constants), and among which the symbol “f” above is to be included as a constant;(ii) for each number n = 1, 2, … a set of functional symbols of degree n (which again may be separated into variables and constants); and(iii) individual symbols among which variables must be distinguished from constants. The set of variables must be infinite.


1939 ◽  
Vol 6 (1) ◽  
pp. 17-18 ◽  
Author(s):  
R. Wilson

This note contains an elementary proof of the well-known result that every solution of Besse's equationwith a real parameter n has an infinite number of real positive zeros.


1975 ◽  
Vol 18 (1) ◽  
pp. 155-156 ◽  
Author(s):  
William A. Webb

Problems involving Egyptian fractions (rationals whose numerator is 1 and whose denominator is a positive integer) have been extensively studied. (See [1] for a more complete bibliography). Some of the most interesting questions, many still unsolved, concern the solvability ofwhere k is fixed.In [2] Rav proved necessary and sufficient conditions for the solvabilty of the above equation, as a consequence of some other theorems which are rather complicated in their proofs. In this note we give a short, elementary proof of this theorem, and at the same time generalize it slightly.


Author(s):  
E. T. Copson

SynopsisIn 1932, Hardy and Littlewood [1] proved the inequalityThe constant 4 is best possible; equality occurs when f(x) = A Y(Bx), wherey(x) = e−½x sin (x sin y−y) (y = ⅓π), (x ≧ o)and A and B (>0) are constants. In [2], three proofs are given. The inequality has also been discussed in [3, 4]. A very elementary proof in which the function Y(x) emerges naturally is given in this paper.


Sign in / Sign up

Export Citation Format

Share Document