Search Results - "Eggleton, Roger B."

Equisum Partitions of Sets of Positive Integers by Eggleton, Roger B.

“…Let V be a finite set of positive integers with sum equal to a multiple of the integer b . When does V have a partition into b parts so that all parts have…”
Get full text

A Note on Counting Homomorphisms of Paths by Eggleton, Roger B., Morayne, Michał

“…We obtain two identities and an explicit formula for the number of homomorphisms of a finite path into a finite path. For the number of endomorphisms of a…”
Get full text

Chromatic properties of the Euclidean plane by Currie, James D, Eggleton, Roger B

“…Let $G$ be the unit distance graph in the plane. A well-known problem in combinatorial geometry is that of determining the chromatic number of $G$. It is known…”
Get full text

Consecutive Integers with Equally Many Principal Divisors by Eggleton, Roger B., MacDougall, James A.

“…  The Fundamental Theorem of Arithmetic is usually stated in a form emphasizing how primes enter the structure of the positive integers, such as: Every…”
Get full text

Upper Bounds on the Sum of Principal Divisors of an Integer by Eggleton, Roger B., Galvin, William P.

“…  Eggleton and Galvin prove Brian Alspach's observation that any odd integer N greater than 15 that is not a prime-power is greater than twice the sum of its…”
Get full text

10452 by Bang, Seung-Jin, Heuer, Gerald A., Eggleton, Roger B.

Get full text

10406 by Fisher, David C., Eggleton, Roger B., Simpson, R.J., Reid, Michael

Get full text

Unitary Fractions: 10501 by Eggleton, Roger B., Western Maryland College Problems Group

Get full text

Explaining Simple Combinatorial Answers by Eggleton, Roger B.

Get full text

E3302 by Delany, Jim, Douglass, Roger, Breen, Mike, Eggleton, Roger B.

Get full text

Explaining Simple Combinatorial Answers by Eggleton, Roger B.

Get full text

Problems:10501-10507 by Eggleton, Roger B., Deutsch, Emeric, Đoković, Dragomir Ž., Hamming, Richard, Pinkham, Roger, Chang, Fu-Chuen, Callan, David, Reddmann, Hauke

Get full text

E1641 by Waterhouse, W. C., Eggleton, Roger B.

Get full text

Upper Bounds on the Sum of Principal Divisors of an Integer by Eggleton, Roger B., Galvin, William P.

Get full text

Catalan Strikes Again! How Likely Is a Function to Be Convex? by Eggleton, Roger B., Guy, Richard K.

Get full text

Catalan Strikes Again! How Likely Is a Function to Be Convex? by Eggleton, Roger B., Guy, Richard K.

Get full text

Counting by Correspondence by Cormier, Romae J., Eggleton, Roger B.

“…Insight into enumeration may follow from correspondences between sets to be counted and sets whose cardinalities are obvious…”
Get full text

Counting by Correspondence by Cormier, Romae J., Eggleton, Roger B.

Get full text

Problems by Callan, David, Freidkin, Evgenii S., Chao, Wu Wei, Golomb, Michael, Fukuta, Jiro, Just, Erwin, Schaumberger, Norman, Wardlaw, William P., Hoyt, John P., Correll, Bill, Sinefakopoulos, Achilleas, Knox, Stephen W., Eggleton, Roger B., Leong, Thomas, Bloom, David M., Chapman, Robin, Baker, John A., Koh, Sung Eun, Trenkler, G., Byrd, Stan, Smith, Ronald L., Muchlis, Ahmad

Get full text

Problems by Bivens, Irl C., Klein, Benjamin G., Demir, Hüseyin, Schoenberg, Isaac J., Kitchen, Edward, Rao, Vidhyanath K., Klamkin, Murray S., Schaumberger, Norman, Graham, Ronald, Propp, James, Bailey, Craig, Richter, R. Bruce, Stout, Lawrence, Johnson, Bruce R., Christophe, L. Matthew, SUNY, The, Eggleton, Roger B., Riese, Adam, Thompson, Skip

Get full text