✦ LIBER ✦

Proof of a conjecture on Genocchi numbers

✍ Scribed by John Riordan; Paul R. Stein

Publisher: Elsevier Science
Year: 1973
Tongue: English
Weight: 446 KB
Volume: 5
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(73)90131-3

No coin nor oath required. For personal study only.

✦ Synopsis

In [ I ]I, Gandhi has stated the following conjecture on Genocchi numbl:rs:

. z;(t~-I)~ .

The meaning of the odd notation on the 1e:ft of (1) is as follows: write

. . . C(k+n-1)2 ; then

K(n+l,k)=k2K(n,k+lj-(k-l)2~(~~,k~ K(1,k)=k2-(k-1;j2 =2k--1

alId, af course, (1) is restated as

(1') C-1 1" 62, = K(n-R,l) 0 S ated in this way, this result is effectively the sari::: as that of [6] .

📜 SIMILAR VOLUMES

Proof of a conjecture on fractional Rams

Proof of a conjecture on fractional Ramsey numbers

✍ Jason Brown; Richard Hoshino 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB 👁 1 views

## Abstract Jacobson, Levin, and Scheinerman introduced the fractional Ramsey function __r__~__f__~ (__a__~1~, __a__~2~, …, __a__~__k__~) as an extension of the classical definition for Ramsey numbers. They determined an exact formula for the fractional Ramsey function for the case __k__=2. In this

The Proof of a Conjecture of Additive Nu

The Proof of a Conjecture of Additive Number Theory

✍ Alexandru Gica 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 94 KB

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\

Proof of a conjecture on game domination

✍ O. Favaron; H. Karami; R. Khoeilar; S. M. Sheikholeslami; L. Volkmann 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 87 KB 👁 1 views

## Abstract The game domination number of a (simple, undirected) graph is defined by the following game. Two players, \documentclass{article}\usepackage{amssymb}\usepackage{amsbsy}\usepackage[mathscr]{euscript}\footskip=0pc\pagestyle{empty}\begin{document}${\mathcal{A}}$\end{document} and \docume

A proof of Boesch's conjecture

✍ Guifang Wang 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 596 KB

On a conjecture of Aris: Proof and remar

On a conjecture of Aris: Proof and remarks

✍ Dan Luss; Neal R. Amundson 📂 Article 📅 1967 🏛 American Institute of Chemical Engineers 🌐 English ⚖ 428 KB 👁 2 views

Proof of a conjecture on irredundance pe

Proof of a conjecture on irredundance perfect graphs

✍ Lutz Volkmann; Vadim E. Zverovich 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 157 KB 👁 1 views

## Abstract Let __ir__(__G__) and γ(__G__) be the irredundance number and the domination number of a graph __G__, respectively. A graph __G__ is called __irredundance perfect__ if __ir__(__H__)=γ(__H__), for every induced subgraph __H__ of __G__. In this article we present a result which immediatel