中文
相关论文

相关论文: Unitary super perfect numbers

200 篇论文

It is shown that the set of decimal palindromes is an additive basis for the natural numbers. Specifically, we prove that every natural number can be expressed as the sum of forty-nine (possibly zero) decimal palindromes.

数论 · 数学 2015-08-20 William D. Banks

The main purpose of this paper is to find all the prime numbers p for which whenever we add to p an odd square less than p we obtain a number which has at most two different prime factors. We solve completely the cases $p\equiv 1,3,5 \pmod…

数论 · 数学 2024-01-30 Alexandru Gica

Let $N$ be an odd perfect number. Let $\omega(N)$ be the number of distinct prime factors of $N$ and let $\Omega(N)$ be the total number of prime factors of $N$. We prove that if $(3,N)=1$, then $ \frac{302}{113}\omega - \frac{286}{113}…

数论 · 数学 2019-10-22 Joshua Zelinsky

In this paper, we revisit the theory of perfect unary forms over real quadratic fields. Specifically, we deduce an infinite family of real quadratic fields $\mathbb{Q}(\sqrt{d})$ when $d=2$ or $3$ mod $4$, such that there are three classes…

数论 · 数学 2024-04-03 Christian Porter

If $N={q^k}{n^2}$ is an odd perfect number given in Eulerian form, then Sorli's conjecture predicts that $k=\nu_{q}(N)=1$. In this article, we give some further results related to this conjecture and those contained in the papers…

数论 · 数学 2022-02-09 Jose Arnaldo B. Dris

We say a natural number~$n$ is abundant if $\sigma(n)>2n$, where $\sigma(n)$ denotes the sum of the divisors of~$n$. The aliquot parts of~$n$ are those divisors less than~$n$, and we say that an abundant number~$n$ is pseudoperfect if there…

数论 · 数学 2015-04-13 Douglas E. Iannucci

We define a multiplication on the surreal numbers as higher inductive-inductive types.

逻辑 · 数学 2018-12-04 Jean S. Joseph

We prove a conjecture that classifies exceptional numbers. This conjecture arises in two different ways, from cryptography and from coding theory. An odd integer $t\geq 3$ is said to be exceptional if $f(x)=x^t$ is APN (Almost Perfect…

信息论 · 计算机科学 2024-05-01 Fernando Hernando , Gary McGuire

In this paper, we proved a theorem that every large enough odd number can be represented as the sum of three almost equal Piatetski-Shapiro primes.

数论 · 数学 2020-12-14 Yanbo Song

Let $P$ and $Q$ be two orthogonal projections on a separable Hilbert space, $\calH$. Wang, Du and Dou proved that there exists a unitary, $U$, with $UPU^{-1} =Q, \quad UQU^{-1} = P$ if and only if $\dim(\ker P \cap \ker(1-Q)) = \dim(\ker Q…

泛函分析 · 数学 2017-03-28 Barry Simon

We adress the problem of the reasons for the existence of 12 symmetric spaces with the exceptional Lie groups. The 1+2 cases for $G_2$ and $F_4$ respectively are easily explained from the octonionic nature of these groups. The 4+3+2 cases…

数学物理 · 物理学 2008-11-05 Luis J. Boya

The number of primes of a kind x^2+1 is infinite.

综合数学 · 数学 2008-02-12 V. Govorov

In this work, we established symmetric representation of numbers where one can use any of 9 digits giving the same number. The representations of natural numbers from 0 to 1000 are given using only single digit in all the nine cases, i.e.,…

历史与综述 · 数学 2015-02-13 Inder J. Taneja

The main result of D. Archdeacon, M. Conder and J. \v{S}ir\'a\v{n} [Trans. Amer. Math. Soc. 366 (2014) 8, 4491-4512] implies existence of a regular, self-dual and self-Petrie dual map of any given even valency. In this paper we extend this…

组合数学 · 数学 2018-08-01 Jay Fraser , Olivia Jeans , Jozef Širáň

The Delannoy numbers and Schr\"oder numbers are given by \begin{align*} D_n=\sum_{k=0}^n{n\choose k}{n+k\choose k}\quad \text{and}\quad S_n=\sum_{k=0}^n{n\choose k}{n+k\choose k}\frac{1}{k+1}, \end{align*} respectively. Let $p>3$ be a…

数论 · 数学 2017-08-31 Ji-Cai Liu

In this article, based on ideas and results by J. S\'andor (2001, 2004), we define $k$-multiplicatively $e$-perfect numbers and $k$-multiplicatively $e$-superperfect numbers and prove some results on them. We also characterize the…

数论 · 数学 2016-06-01 Alexandre Laugier , Manjil P. Saikia , Upam Sarmah

Let $\mathcal{P}_s(n)$ denote the $n$th $s$-gonal number. We consider the equation \[\mathcal{P}_s(n) = y^m, \] for integers $n,s,y,$ and $m$. All solutions to this equation are known for $m>2$ and $s \in \{3,5,6,8,20 \}$. We consider the…

数论 · 数学 2023-06-22 Philippe Michaud-Rodgers

We prove a curious identity for the Bernoulli numbers.

数论 · 数学 2013-08-16 Daniel B. Grunberg , Hao Pan , Zhi-Wei Sun

The central Delannoy numbers $D_n=\sum_{k=0}^{n}\binom{n}{k}\binom{n+k}{k}$ and the little Schr\"oder number $s_n=\sum_{k=1}^{n}\frac{1}{n}\binom{n}{k}\binom{n}{k-1}2^{n-k}$ are important quantities. In this paper, we confirm…

数论 · 数学 2024-10-24 Chen-Bo Jia , Jia-Qing Huang

We give, in this paper, all bi-unitary perfect polynomials over the prime field $\mathbb{F}_2$, with at most four irreducible factors.

数论 · 数学 2022-05-24 Olivier Rahavandrainy