中文
相关论文

相关论文: On Amicable Numbers With Different Parity

200 篇论文

We adapt (over $\mathbb{F}_2$) the general notions of multiplicative function, Dirichlet convolution and Inverse. We get some interesting results, namely necessary conditions for an odd binary polynomial to be perfect. Note that we are…

数论 · 数学 2023-01-16 Luis H. Gallardo , Olivier Rahavandrainy

We define an extension of parity from the integers to the rational numbers. Three parity classes are found -- even, odd and `none'. Using the 2-adic valuation, we partition the rationals into subgroups with a rich algebraic structure. The…

数论 · 数学 2022-05-03 Peter Lynch , Michael Mackey

An additive-multiplicative magic square is a square grid of numbers whose rows, columns, and long diagonals all have the same sum (called the magic sum) and the same product (called the magic product). There are numerous open problems about…

综合数学 · 数学 2023-11-14 Desmond Weisenberg

Magic squares have been an enthralling topic in mathematics for centuries. They are formed by filling in all the cells of a square matrix with the numbers starting from one so that the sum of all rows, columns, and diagonals is the same.…

历史与综述 · 数学 2014-02-14 Grasha Jacob , A. Murugan

Translated from the Latin original, "De numeris amicabilibus" (1747). E100 in the Enestroem index. Euler starts by saying that with the success of mathematical analysis, number theory has been neglected. He argues that number theory is…

历史与综述 · 数学 2009-08-11 Leonhard Euler , Jordan Bell

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…

数论 · 数学 2017-08-28 Jose Arnaldo B. Dris

Recently, Hirschhorn and the first author considered the parity of the function $a(n)$ which counts the number of integer partitions of $n$ wherein each part appears with odd multiplicity. They derived an effective characterization of the…

组合数学 · 数学 2022-04-05 James A. Sellers , Fabrizio Zanello

We prove that every sufficiently large odd integer is a sum of two positive squares and a prime. Let R(n) be the number of representations n = x^2 + y^2 + p with x, y >= 1 and p prime. We show that R(n) > 0 for all odd n >= n0 and obtain…

综合数学 · 数学 2025-09-19 Ricardo Adonis Caraccioli Abrego

We study pairs and triples consisting of triangular numbers such that the product of any two distinct elements decreased by 1 is a perfect square. For a positive integer $n$, we establish a necessary condition for the $n$-th triangular…

数论 · 数学 2026-04-01 Marija Bliznac Trebješanin

A Parity Alternating Permutation of the set $[n] = \{1, 2,\ldots, n\}$ is a permutation with even and odd entries alternatively. We deal with parity alternating permutations having an odd entry in the first position, PAPs. We study the…

组合数学 · 数学 2022-04-04 Frether Getachew Kebede , Fanja Rakotondrajao

We will show the two following results: If there existe an odd perfect number $n$ of prime decomposition $n=p_1^{\alpha_1} \ldots p_k^{\alpha_k}q^\beta$, where the $\alpha_i$ are even, the $\beta$ are odd and $q \equiv 5 \mod 8$. Then there…

历史与综述 · 数学 2016-10-04 Nancy Wallace

The aim of this note is to show that any even perfect number, other than $6$, can be written as the sum of 5 cubes of natural numbers. We also conjecture that any even perfect number, other than $6$, can be written as the sum of only 3…

数论 · 数学 2015-04-29 Bakir Farhi

The number of tuples with positive integers pairwise relatively prime to each other with product at most $n$ is considered. A generalization of $\mu^{2}$ where $\mu$ is the M\"{o}bius function is used to formulate this divisor sum and…

综合数学 · 数学 2021-08-24 Masum Billal

If $N = {p^k}{m^2}$ is an odd perfect number with special prime factor $p$, then it is proved that ${p^k} < (2/3){m^2}$. Numerical results on the abundancy indices $\frac{\sigma(p^k)}{p^k}$ and $\frac{\sigma(m^2)}{m^2}$, and the ratios…

数论 · 数学 2012-06-18 Jose Arnaldo B. Dris

We consider the number of various partitions of $n$ with parts separated by parity and prove combinatorially several inequalities between these numbers. For example, we show that for $n\geq 5$ we have $p_{od}^{eu}(n)<p_{ed}^{ou}(n)$, where…

组合数学 · 数学 2024-06-04 Cristina Ballantine , Amanda Welch

Let $G$ be a group of odd order and $\chi$ be a complex irreducible character. Then there exists a unique character $\chi^{(2)}\in\Irr(G)$ such that $[\chi^2,\chi^{(2)}]$ is odd. Also, there exists a unique character $\psi\in \Irr(G)$ such…

群论 · 数学 2007-05-23 Edith Adan-Bante

Does $14$ have a friend? Until now, this has been an open question. In this note, we prove that a potential friend $F$ of $14$ is an odd, non-square positive integer. $7$ appears in the prime factorization of $F$ with an even exponent while…

综合数学 · 数学 2025-09-17 Sagar Mandal

A Heron triangle is a triangle whose side lengths and area are integers. Two Heron triangles are amicable if the perimeter of one is the area of the other. We show, using elementary techniques, that there is only one pair of amicable Heron…

度量几何 · 数学 2021-01-26 Iwan Praton , Nart Shalqini

Euler showed that if an odd perfect number exists, it must be of the form $N = p^\alpha q_{1}^{2\beta_{1}}$ $\ldots$ $q_{k}^{2\beta_{k}}$, where $p, q_{1}, \ldots, q_k$ are distinct odd primes, $\alpha$, $\beta_{i} \geq 1$, for $1 \leq i…

数论 · 数学 2015-12-07 Patrick Brown

We prove that an odd number is an Euler pseudoprime for exactly one half of the admissible bases if and only if it is a special Carmichael number.

数论 · 数学 2011-09-19 Lorenzo Di Biagio