Related papers: Even and odd compositions with restricted parts

Building on a bijection of Vandervelde, we enumerate certain unimodal sequences whose alternating sum equals zero. This enables us to refine the enumeration of strict partitions with respect to the number of parts and the BG-rank.

We present several sequences of Euler sums involving odd harmonic numbers. The calculational technique is based on proper two-valued integer functions, which allow to compute these sequences explicitly in terms of zeta values only.

Ozeki and Prodinger showed that the odd power sum of the first several consecutive Fibonacci numbers of even order is equal to a polynomial evaluated at certain Fibonacci number of odd order. We prove that this polynomial and its derivative…

Using as the working hypothesis of an evaluation of the difference between primes $p_{n+1} - p_n = O(\sqrt{p_n})$ we represent in detail the proofs of Legendre's and Oppermann's conjectures.

Andrews and El Bachraoui recently studied integer partitions where the smallest part is repeated a specified number of times and any other parts are distinct. Their results included two ``surprising identities'' for which they requested…

We investigate compositions of a positive integer with a fixed number of parts, when there are several types of each natural number. These compositions produce new relationships among binomial coefficients, Catalan numbers, and numbers of…

Motivated by two Legendre-type formulas for overpartitions, we derive a variety of their companions as Legendre theorems for overpartition pairs. This leads to equalities of subclasses of overpartitions and overpartition pairs.

An odd perfect number $N$ is said to be given in Eulerian form if $N = {q^k}{n^2}$ where $q$ is prime with $q \equiv k \equiv 1 \pmod 4$ and $\gcd(q,n) = 1$. Similarly, an even perfect number $M$ is said to be given in Euclidean form if $M…

Given a positive rational number $n/d$ with $d$ odd, its odd greedy expansion starts with the largest odd denominator unit fraction at most $n/d$, adds the largest odd denominator unit fraction so the sum is at most $n/d$, and continues as…

We study compositions of a positive integer $n$ in which the occurrence of even parts larger than a fixed threshold $k$ is controlled. More precisely, for each composition $m=(m_1,\dots,m_r)$ we consider the number of even parts strictly…

We give bounds on the number of distinct differences $N_a-a$ as $a$ varies over all elements of a given finite set $A$, and $N_a$ is a nearest neighbour to $a$.

It is well-known that any sequence of at least N integers contains a subsequence whose sum is 0 (mod N). However, there can be very few subsequences with this property (e.g. if the initial sequence is just N 1's, then there is only one…

A method of determining two factors of an odd integer without need of multiplication or division operation in iterative portion of computation is presented. It is feasible for an implementing algorithm to use only integer addition and…

In this paper, we give a bijective proof of the reduced lecture hall partition theorem. It is possible to extend this bijection in lecture hall partition theorem. And refined versions of each theorems are also presented.

In a recent article on overpartitions, Merca considered the auxiliary function $a(n)$ which counts the number of partitions of $n$ where odd parts are repeated at most twice (and there are no restrictions on the even parts). In the course…

We present lower bounds on the sum and product of the distinct prime factors of an odd perfect number, which provide a lower bound on the size of the odd perfect number as a function of the number of its distinct prime factors.

We introduce a discrete-time fractional calculus of variations. First and second order necessary optimality conditions are established. Examples illustrating the use of the new Euler-Lagrange and Legendre type conditions are given. They…

We discuss a new companion to Capparelli's identities. Capparelli's identities for m=1,2 state that the number of partitions of $n$ into distinct parts not congruent to m, -m modulo $6$ is equal to the number of partitions of n into…

In this work we state a Theorem on number theory and apply it to solve some ordinary and partial differential equations.

For each positive integer $n$, we construct a bijection between the odd partitions and the distinct partitions of $n$ which extends Bressoud's bijection between the odd-and-distinct partitions of $n$ and the splitting partitions of $n$. We…