中文
相关论文

相关论文: Additive bases and Niven numbers

200 篇论文

In this work initial numbers and repunit numbers have been studied. All numbers have been considered in a decimal notation. The problem of simplicity of initial numbers has been studied. Interesting properties of numbers repunit are proved:…

综合数学 · 数学 2007-05-23 Boris V. Tarasov

A perfect number is a positive integer n such that n equals the sum of all positive integer divisors of n that are less than n. That is, although n is a divisor of n, n is excluded from this sum. Thus 6 = 1 + 2 + 3 is perfect, but 12 < 1 +…

计算机科学中的逻辑 · 计算机科学 2015-09-22 John Cowles , Ruben Gamboa

It is shown that every sufficiently large even integer is a sum of two primes and exactly 13 powers of 2. Under the Generalized Rieman Hypothesis one can replace 13 by 7. Unlike previous work on this problem, the proof avoids numerical…

数论 · 数学 2007-05-23 D. R. Heath-Brown , J. -C. Puchta

Let $A$ be a set of natural numbers. A set $B$, a set of natural numbers, is an additive complement of the set $A$ if all sufficiently large natural numbers can be represented in the form $x+y$, where $x\in A$ and $y\in B$. Erd\H{o}s…

数论 · 数学 2026-01-14 Bhuwanesh Rao Patil , Mohan

The aim of the present article is to explore the possibilities of representing positive integers as sums of other positive integers and highlight certain fundamental connections between their multiplicative and additive properties. In…

综合数学 · 数学 2008-06-30 Dimitris Sardelis

This paper introduces permutation-invariant Niven numbers--a novel class of Niven numbers where all digit permutations (with leading zeros automatically ignored) must retain the Niven property. We demonstrate that there exist infinitely…

组合数学 · 数学 2026-02-17 Hui-Ling Wu , S. Y. Lou

Let $m$ and $n$ be positive integers. For the quantum integer $[n]_q = 1 + q + ... + q^{n-1}$ there is a natural polynomial addition such that $[m]_q \oplus_q [n]_q = [m+n]_q$ and a natural polynomial multiplication such that $[m]_q…

数论 · 数学 2007-05-23 Melvyn B. Nathanson

A perfect number is a number whose divisors add up to twice the number itself. The existence of odd perfect numbers is a millennia-old unsolved problem. This note proposes a proof of the nonexistence of odd perfect numbers. More generally,…

综合数学 · 数学 2011-03-04 N. A. Carella

Let $A$ be a set of natural numbers. A set $B$, a set of natural numbers, is said to be an additive complement of the set $A$ if all sufficiently large natural numbers can be represented in the form $x+y$, where $x\in A$ and $y\in B$. This…

数论 · 数学 2024-02-06 Mohan , Bhuwanesh Rao Patil , Ram Krishna Pandey

It is proved that given any three conditionally convergent series of real numbers, there is a single sequence of natural numbers such that each of the corresponding three subseries sums to either $\infty$ or $-\infty$. An example is…

经典分析与常微分方程 · 数学 2018-12-05 Will Brian

A natural number $n$ is called {\it multiperfect} or {\it$k$-perfect} for integer $k\ge2$ if $\sigma(n)=kn$, where $\sigma(n)$ is the sum of the positive divisors of $n$. In this paper, we establish the structure theorem of odd multiperfect…

数论 · 数学 2011-02-23 Shi-Chao Chen , Hao Luo

The greatest power of a prime $p$ dividing the natural number $n$ will be denoted by $n_p$. Let $Ind_G(g)=|G:C_G(g)|$. Suppose that $G$ is a finite group and $p$ is a prime. We prove that if there exists an integer $\alpha>0$ such that…

群论 · 数学 2023-06-22 Ilya Gorshkov

Let $(T,\langle \cdot, \cdot, \cdot \rangle)$ be a Leibniz triple system of arbitrary dimension, over an arbitrary base field ${\mathbb F}$. A basis ${\mathcal B} = \{e_{i}\}_{i \in I}$ of $T$ is called multiplicative if for any $i,j,k \in…

We consider numbers formed by concatenating some of the base b digits from additive functions f(n) that closely resemble the prime counting function \Omega(n). If we concatenate the last \lceil y \frac{\log \log \log n}{\log b} \rceil…

数论 · 数学 2012-06-07 Joseph Vandehey

A positive integer $n$ is said to be a practical number if every integer in $[1,n]$ can be represented as the sum of distinct divisors of $n$. In this article, we consider practical numbers of a given polynomial form. We give a necessary…

数论 · 数学 2022-12-08 Sai Teja Somu , Ting Hon Stanford Li , Andrzej Kukla

We consider the positive divisors of a natural number that do not exceed its square root, to which we refer as the {\it small divisors\/} of the natural number. We determine the asymptotic behavior of the arithmetic function that adds the…

数论 · 数学 2019-10-28 Douglas E. Iannucci

For an integer $b\geq 2$, we call a positive integer $b$-anti-Niven if it is relatively prime to the sum of the digits in its base-$b$ representation. In this article, we investigate the maximum lengths of arithmetic progressions of…

We call a set of positive integers closed under taking unitary divisors a unitary ideal. It can be regarded as a simplicial complex. Moreover, a multiplicative arithmetical function on such a set corresponds to a function on the simplicial…

组合数学 · 数学 2007-05-23 Jan Snellman

We prove that if $G$ is an Abelian group and $A_1,\ldots,A_k \subseteq G$ satisfy $m A_i=G$ (the $m$-fold sumset), then $A_1+\ldots+A_k=G$ provided that $k \ge c_m \log n$. This generalizes a result of Alon, Linial, and Meshulam [Additive…

组合数学 · 数学 2016-07-05 Hamed Hatami , Victoria de Quehen

Goldbach`s Conjecture, "every even number greater than 2 can be expressed as the sum of two primes" is renamed Goldbach`s Rule for it can not be otherwise. The conjecture is proven by showing that the existence of prime pairs adding to any…

综合数学 · 数学 2007-05-23 Metin Aktay