### Abstract

This chapter discusses the study of R (n, a) number of partitions of n for a depending on n, and smaller than λ_{0}, where λ_{0} is a small positive constant. The tools for that are an estimation for r (n, A), and inequalities involving R (n, a). The following theorem is proved: There exists λ_{0} > 0, such that uniformly for 1 ≤ a ≤ λ_{0}, one has, when n goes to infinity.

Original language | English |
---|---|

Pages (from-to) | 155-166 |

Number of pages | 12 |

Journal | Annals of Discrete Mathematics |

Volume | 43 |

Issue number | C |

DOIs | |

Publication status | Published - Jan 1 1989 |

### ASJC Scopus subject areas

- Discrete Mathematics and Combinatorics

## Fingerprint Dive into the research topics of 'On The Number of Partitions of N Without a Given Subsum (I)'. Together they form a unique fingerprint.

## Cite this

Erdõs, P., Nicolas, J. L., & Sárkõzy, A. (1989). On The Number of Partitions of N Without a Given Subsum (I).

*Annals of Discrete Mathematics*,*43*(C), 155-166. https://doi.org/10.1016/S0167-5060(08)70574-0