We give a new and elementary proof that the equation x 3 &1=31y 2 has only the integral solutions (x, y)=(1, 0), (5, 2), (5, &2).
A New Proof of the Gauss Interlace Conjecture
โ Scribed by Pierre Rosenstiehl
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 116 KB
- Volume
- 23
- Category
- Article
- ISSN
- 0196-8858
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Let P(G, \*) denote the chromatic polynomial of a graph G. It is proved in this paper that for every connected graph G of order n and real number \* n, (\*&2) n&1 P(G, \*)&\*(\*&1) n&2 P(G, \*&1) 0. By this result, the following conjecture proposed by Bartels and Welsh is proved: P(G, n)(P(G, n&1))
A tree T is said to be bad, if it is the vertex-disjoint union of two stars plus an edge joining the center of the first star to an end-vertex of the second star. A tree T is good, if it is not bad. In this article, we prove a conjecture of Alan Hartman that, for any spanning tree T of K 2m , where
The aim of this paper is to show that for any n ยฅ N, n > 3, there exist a, b ยฅ N\* such that n=a+b, the ''lengths'' of a and b having the same parity (see the text for the definition of the ''length'' of a natural number). Also we will show that for any n ยฅ N, n > 2, n ] 5, 10, there exist a, b ยฅ N\