PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
March 7, 20240 citationsOpen Access

High order congruences for M-ary partitions

View Full Paper
BŻBłażej Żmija

Key Points

  • The finding establishes that for all positive integers, the partition function exhibits a specific congruence property.
  • Specifically, the partition count aligns to zero modulo a particular product, revealing structured behavior.
  • Analysis involves integer sequences and employs GCD and LCM to derive the congruence relation efficiently in theoretical frameworks in number theory and combinatorics. This expands upon previously known results in the field, addressing earlier conjectures.

Abstract

For a sequence M= (m₈) ₈=₀^ of integers such that m₀=1, m₈ 2 for i 1, let p₌ (n) denote the number of partitions of n into parts of the form m₀m₁ mₑ. In this paper we show that for every positive integer n the following congruence is true: align* p₌ (m₁m₂ mₑn-1) 0\ \ (mod\ ₓ=₂^rM (mₓ, t-1) ), align* where M (m, r): =m (m, { lcm (1, , r) ) }. Our result answers a conjecture posed by Folsom, Homma, Ryu and Tong, and is a generalisation of the congruence relations for m-ary partitions found by Andrews, Gupta, and Rdseth and Sellers.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Błażej Żmija (2024) studied this question.

synapsesocial.com/papers/68e7567db6db6435876cdda4https://doi.org/10.48550/arxiv.2403.04495
Ask AI
Helpful
Bookmark
Share
View Full Paper