Page 1 Next

Displaying 1 – 20 of 1124

Showing per page

A combinatorial approach to partitions with parts in the gaps

Dennis Eichhorn (1998)

Acta Arithmetica

Many links exist between ordinary partitions and partitions with parts in the “gaps”. In this paper, we explore combinatorial explanations for some of these links, along with some natural generalizations. In particular, if we let p k , m ( j , n ) be the number of partitions of n into j parts where each part is ≡ k (mod m), 1 ≤ k ≤ m, and we let p * k , m ( j , n ) be the number of partitions of n into j parts where each part is ≡ k (mod m) with parts of size k in the gaps, then p * k , m ( j , n ) = p k , m ( j , n ) .

A diophantine equation involving special prime numbers

Stoyan Dimitrov (2023)

Czechoslovak Mathematical Journal

Let [ · ] be the floor function. In this paper, we prove by asymptotic formula that when 1 < c < 3441 2539 , then every sufficiently large positive integer N can be represented in the form N = [ p 1 c ] + [ p 2 c ] + [ p 3 c ] + [ p 4 c ] + [ p 5 c ] , where p 1 , p 2 , p 3 , p 4 , p 5 are primes such that p 1 = x 2 + y 2 + 1 .

Currently displaying 1 – 20 of 1124

Page 1 Next