中文
相关论文

相关论文: The family of $a$-floor quotient partial orders

200 篇论文

A positive integer $d$ is a floor quotient of $n$ if there is a positive integer $k$ such that $d = \lfloor n/k \rfloor$. The floor quotient relation defines a partial order on the positive integers. This paper studies the internal…

数论 · 数学 2025-09-03 Jeffery C. Lagarias , David Harry Richman

For a nonempty finite set $A$ of positive integers, let $\gcd\left(A\right)$ denote the greatest common divisor of the elements of $A$. Let $f\left(n\right)$ and $\Phi\left(n\right)$ denote, respectively, the number of subsets $A$ of…

数论 · 数学 2013-06-21 Prapanpong Pongsriiam

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.

数论 · 数学 2019-05-17 Randell Heyman

We call positive integer n a near-perfect number, if it is sum of all its proper divisors, except of one of them ("redundant divisor"). We prove an Euclid-like theorem for near-perfect numbers and obtain some other results for them.

数论 · 数学 2012-02-20 Vladimir Shevelev

We develop a theory of ordered *-vector spaces with an order unit. We prove fundamental results concerning positive linear functionals and states, and we show that the order (semi)norm on the space of self-adjoint elements admits multiple…

算子代数 · 数学 2009-06-10 Vern Paulsen , Mark Tomforde

We pursue the question how integers can be ordered or partitioned according to their divisibility properties. Based on pseudometrics on $\mathbb{Z}$, we investigate induced preorders, associated equivalence relations, and quotient sets. The…

数论 · 数学 2026-04-16 Mario Ziller

Let n be a non-null positive integer and $d(n)$ is the number of positive divisors of n, called the divisor function. Of course, $d(n) \leq n$. $d(n) = 1$ if and only if $n = 1$. For $n > 2$ we have $d(n) \geq 2$ and in this paper we try to…

综合数学 · 数学 2019-02-20 Sayak Chakrabarty , Arghya Dutta

For each positive integer $n$, we define the divisibility relation graph $D_n$ whose vertex set is the set of divisors of $n$, and in which two vertices are adjacent if one is a divisor of the other. This type of graph is a special case of…

组合数学 · 数学 2025-07-10 Jonathan L. Merzel , Ján Mináč , Tung T. Nguyen , Nguyen Duy Tân

The main goal of this paper is to develop a concept of approximate differentiability of higher order for subsets of the Euclidean space that allows to characterize higher order rectifiable sets, extending somehow well known facts for…

经典分析与常微分方程 · 数学 2020-07-20 Mario Santilli

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…

数论 · 数学 2025-07-17 Steven Brown

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…

数论 · 数学 2020-04-22 Melvyn B. Nathanson

This short note provides a sharper upper bound of a well known inequality for the sum of divisors function. This is a problem in pure mathematics related to the distribution of prime numbers. Furthermore, the technique is completely…

数论 · 数学 2023-09-18 N. A. Carella

Let $X$ be a positive integer and $t$ a real number great than 1. The family of sets $\left\{\big\lfloor\frac{X}{n^t}\big\rfloor ~:~ 1\leq n\leq X\right\}$ have an interesting prime distribution property. We give an exact formula for the…

数论 · 数学 2024-07-18 Randell Heyman , MD Rahil Miraj

The divisor function $\sigma(n)$ sums the divisors of $n$. We call $n$ abundant when $\sigma(n) - n > n$ and perfect when $\sigma(n) - n = n$. I recently introduced the recursive divisor function $a(n)$, the recursive analog of the divisor…

数论 · 数学 2020-08-25 Thomas Fink

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…

数论 · 数学 2015-08-18 William D. Banks , Victor Z. Guo , Igor E. Shparlinski

The integer division of a numerator n by a divisor d gives a quotient q and a remainder r. Optimizing compilers accelerate software by replacing the division of n by d with the division of c * n (or c * n + c) by m for convenient integers c…

数据结构与算法 · 计算机科学 2021-11-16 Daniel Lemire , Colin Bartlett , Owen Kaser

We give an overview of combinatoric properties of the number of ordered $k$-factorizations $f_k(n,l)$ of an integer, where every factor is greater or equal to $l$. We show that for a large number $k$ of factors, the value of the cumulative…

组合数学 · 数学 2016-10-18 Jacob Sprittulla

The concept of proximate order is widely used in the theories of entire, meromorphic, subharmonic and plurisubharmonic functions. We give a general interpretation of this concept as a proximate growth function relative to a model growth…

复变函数 · 数学 2019-12-03 Bulat N. Khabibullin

A quotient of a poset $P$ is a partial order obtained on the equivalence classes of an equivalence relation $\theta$ on $P$; $\theta$ is then called a congruence if it satisfies certain conditions, which vary according to different…

组合数学 · 数学 2025-08-20 Nicholas J. Williams

Let $d_1 = 1 < d_2 < d_3 < \cdots < d_{\tau(n)} = n$ denote the increasing sequence of the divisors of a positive integer $n$. In this paper, for real or complex values of $\alpha$, we define and study some properties of two new divisor…

综合数学 · 数学 2025-09-16 Brahim Mittou
‹ 上一页 1 2 3 10 下一页 ›