Related papers: The floor quotient partial order

An approximate divisor order is a partial order on the positive integers $\mathbb{N}^+$ that refines the divisor order and is refined by the additive total order. A previous paper studied such a partial order on $\mathbb{N}^+$, produced…

Fix a positive integer X. We quantify the cardinality of the set $\{\lfloor X/n \rfloor\}_{n=1}^X$. We discuss restricting the set to those elements that are prime, semiprime or similar.

Let $F$ be a number field, $k$ a positive integer. In this paper, we define the Mobius and Liouville functions of order $k$ in $F$. We give a formula about the partial sums of them by using elementary number theory and complex analysis.…

In this paper we are concerned with a family of sums involving the floor function. With $r$ a non negative integer and $n$ and $m$ positive integers we consider the sums…

Given positive coprime integers $a$ and $b$ and a natural number $h$, we obtain reciprocity relations which can be used to quickly evaluate summations like $\sum_{i=1}^{h} \{\frac{ib}{a}\}^2$ and $\sum_{i=1}^{h} \lfloor \frac{ib}{a}…

In this note we will give various exact formulas for functions on integer partitions including the functions $p(n)$ and $p(n,k)$ of the number of partitions of $n$ and the number of such partitions into exactly $k$ parts respectively. For…

Under the fundamental theorem of arithmetic, any integer $n>1$ can be uniquely written as a product of prime powers $p^a$; factoring each exponent $a$ as a product of prime powers $q^b$, and so on, one will obtain what is called the tower…

We study the function M(t,n) = Floor[ 1 / {t^(1/n)} ], where t is a positive real number, Floor[.] and {.} are the floor and fractional part functions, respectively. In a recent article in the Monthly, Nathanson proved that if log(t) is…

Let $x$ be a positive integer. We give an asymptotic formula for the number of primes in the set $\{\fl{x/n}, 1 \le n \le x\}$ and give some related results.

A floorplan is a rectangular dissection which describes the relative placement of electronic modules on the chip. It is called a mosaic floorplan if there are no empty rooms or cross junctions in the rectangular dissection. We study a…

Let $${\mathbb P}^c=(\lfloor p^c\rfloor)_{p\in{\mathbb P}} \qquad (c>1,\ c\not\in {\mathbb N}), $$ where ${\mathbb P}$ is the set of prime numbers, and $\lfloor\cdot\rfloor$ is the floor function. We show that for every such $c$ there are…

Considering Schur positivity of differences of plethysms of homogeneous symmetric functions, we introduce a new relation on integer partitions. This relation is conjectured to be a partial order, with its restriction to one part partitions…

For a fixed positive integer $m$ and any partition $m = m_1 + m_2 + \cdots + m_e$ , there exists a sequence $\{n_{i}\}_{i=1}^{k}$ of positive integers such that $$m=\frac{1}{n_{1}}+\frac{1}{n_{2}}+\cdots+\frac{1}{n_{k}},$$ with the property…

A partition of a positive integer $n$ is a representation of $n$ as a sum of a finite number of positive integers (called parts). A trapezoidal number is a positive integer that has a partition whose parts are a decreasing sequence of…

As a well-known enumerative problem, the number of solutions of the equation $m=m_1+...+m_k$ with $m_1\leqslant...\leqslant m_k$ in positive integers is $\Pi(m,k)=\sum_{i=0}^k\Pi(m-k,i)$ and $\Pi$ is called the additive partition function.…

Let $b$ be a positive integer greater than 1, $N$ a positive integer relatively prime to $b$, $ |b|_{N}$ the order of $b$ in the multiplicative group $% \mathbb{U}_{N}$ of positive integers less than $N$ and relatively primes to $% N,$ and…

We derive new formulas for the number of unordered (distinct) factorizations with $k$ parts of a positive integer $n$ as sums over the partitions of $k$ and an auxiliary function, the number of partitions of the prime exponents of $n$,…

Recently, Merca and Schmidt found some decompositions for the partition function $p(n)$ in terms of the classical M\"{o}bius function as well as Euler's totient. In this paper, we define a counting function $T_k^r(m)$ on the set of…

Let $R$ be an order in an algebraic number field. If $R$ is a principal order, then many explicit results on its arithmetic are available. Among others, $R$ is half-factorial if and only if the class group of $R$ has at most two elements.…

In our work we investigate quotient structures and quotient spaces of a space of orderings arising from subgroups of index two. We provide necessary and sufficient conditions for a quotient structure to be a quotient space that, among other…