Displaying 781 – 800 of 1120

Showing per page

Some new infinite families of congruences modulo 3 for overpartitions into odd parts

Ernest X. W. Xia (2016)

Colloquium Mathematicae

Let p ̅ o ( n ) denote the number of overpartitions of n in which only odd parts are used. Some congruences modulo 3 and powers of 2 for the function p ̅ o ( n ) have been derived by Hirschhorn and Sellers, and Lovejoy and Osburn. In this paper, employing 2-dissections of certain quotients of theta functions due to Ramanujan, we prove some new infinite families of Ramanujan-type congruences for p ̅ o ( n ) modulo 3. For example, we prove that for n, α ≥ 0, p ̅ o ( 4 α ( 24 n + 17 ) ) p ̅ o ( 4 α ( 24 n + 23 ) ) 0 ( m o d 3 ) .

Some problems in number theory that arise from group theory.

Alexander Moretó (2007)

Publicacions Matemàtiques

In this expository paper, we present several open problerns in number theory that have arisen while doing research in group theory. These problems are on arithmetical functions or partitions. Solving some of these problems would allow to solve some open problem in group theory.[Proceedings of the Primeras Jornadas de Teoría de Números (Vilanova i la Geltrú (Barcelona), 30 June - 2 July 2005)].

Some sufficient conditions for zero asymptotic density and the expression of natural numbers as sum of values of special functions

Pavel Jahoda, Monika Pěluchová (2005)

Acta Mathematica Universitatis Ostraviensis

This paper generalizes some results from another one, namely [3]. We have studied the issues of expressing natural numbers as a sum of powers of natural numbers in paper [3]. It means we have studied sets of type A = { n 1 k 1 + n 2 k 2 + + n m k m n i { 0 } , i = 1 , 2 , m , ( n 1 , n 2 , , n m ) ( 0 , 0 , , 0 ) } , where k 1 , k 2 , , k m were given natural numbers. Now we are going to study a more general case, i.e. sets of natural numbers that are expressed as sum of integral parts of functional values of some special functions. It means that we are interested in sets of natural numbers in the form k = [ f 1 ( n 1 ) ] + [ f 2 ( n 2 ) ] + + [ f m ( n m ) ] .

Currently displaying 781 – 800 of 1120