On a Combinatorial Expression Concerning Fermat's Last Theorem
✍ Scribed by L.C. Hsu; Peter Jau-Shyong Shiue
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 85 KB
- Volume
- 18
- Category
- Article
- ISSN
- 0196-8858
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
A conjecture concerning the Crame r Wold device is answered in the negative by giving a Fourier-free, probabilistic proof using only elementary techniques. It is also shown how a geometric idea allows one to interpret the Crame r Wold device as a special case of a more general concept.
proved that if G is a 2-connected graph with n vertices such that d(u)+d(v)+d(w) n+} holds for any triple of independent vertices u, v, and w, then G is hamiltonian, where } is the vertex connectivity of G. In this note, we will give a short proof of the above result.