Table of Contents
Fetching ...

On the number of partitions of a number into distinct divisors

Noah Lebowitz-Lockard, Joseph Vandehey

Abstract

Let $p_{\textrm{dsd}} (n)$ be the number of partitions of $n$ into distinct squarefree divisors of $n$. In this note, we find a lower bound for $p_{\textrm{dsd}} (n)$, as well as a sequence of $n$ for which $p_{\textrm{dsd}} (n)$ is unusually large.

On the number of partitions of a number into distinct divisors

Abstract

Let be the number of partitions of into distinct squarefree divisors of . In this note, we find a lower bound for , as well as a sequence of for which is unusually large.
Paper Structure (3 sections, 8 theorems, 36 equations)

This paper contains 3 sections, 8 theorems, 36 equations.

Key Result

Theorem 1

As $n \to \infty$, we have

Theorems & Definitions (14)

  • Theorem 1
  • Theorem 2: BEO
  • Theorem 3
  • Theorem 4
  • Theorem 5
  • Lemma 6
  • proof
  • proof : Proof of Theorem \ref{['main thm']}
  • Lemma 7
  • proof
  • ...and 4 more