✦ LIBER ✦

A Conjecture on Consecutive Composite Numbers

✍ Scribed by Grimm, C. A.

Book ID: 127033318
Publisher: Mathematical Association of America
Year: 1969
Tongue: English
Weight: 366 KB
Volume: 76
Category: Article
ISSN: 0002-9890
DOI: 10.2307/2317188

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Proof of a conjecture on Genocchi number

Proof of a conjecture on Genocchi numbers

✍ John Riordan; Paul R. Stein 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 446 KB

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')

On Spieß’s conjecture on harmonic number

On Spieß’s conjecture on harmonic numbers

✍ Jin, Hai-Tao; Sun, Lisa H. 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 342 KB

Note on Consecutive Abundant Numbers

✍ Erdos, P. 📂 Article 📅 1935 🏛 Oxford University Press 🌐 English ⚖ 107 KB

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

On a conjecture on the balanced decompos

On a conjecture on the balanced decomposition number

✍ Chang, Gerard Jennhwa; Narayanan, N. 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 374 KB

On consecutive quadratic non-residues: a

On consecutive quadratic non-residues: a conjecture of Issai Schur

✍ Patrick Hummel 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 212 KB

Issai Schur once asked if it was possible to determine a bound, preferably using elementary methods, such that for all prime numbers p greater than the bound, the greatest number of consecutive quadratic non-residues modulo p is always less than p 1=2 : This paper uses elementary methods to prove th