Papers
Topics
Authors
Recent
Search
2000 character limit reached

Ramanujan-type congruences for $2$-color partition triples

Published 18 Jun 2017 in math.NT and math.CO | (1706.05667v2)

Abstract: Let ${p}{3,3}(n)$ denote the number of $2$-color partition triples of $n$ where one of the colors appears only in parts that are multiples of $3$. In this paper, we shall establish some interesting Ramanujan-type congruences for ${p}{3,3}(n)$.

Summary

No one has generated a summary of this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Sign Up to Summarize

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Generate Now

Authors (2)

  1. Shane Chern 
  2. Chun Wang 

Collections

Sign up for free to add this paper to one or more collections.

User Circle Single Streamline Icon: https://streamlinehq.com Sign Up