Skip to main content

Questions tagged [perfect-numbers]

Questions about or involving perfect numbers which are positive integers that are equal to the sum of their proper positive divisors.

1 vote
2 answers
91 views

The problem For each $n\in \mathbb N^*$ determine the first decimal place of the number $a_n = \sqrt{4n^2+13n+10}$. My idea So I tried different values for $n$ and calculated the first decimal, and I ...
Pam Munoz Ryan's user avatar
1 vote
0 answers
176 views

Is $37$ the only prime number $p$ such that the repeating part of $\dfrac{1}{p}$ is one less than an even perfect number? This question was asked in our school contest that ended a few months ago. I ...
Thirdy Yabata's user avatar
5 votes
1 answer
313 views

Consider the sequence defined as follows: Start with a number N. Compute the prime factors of N with multiplicity, and add 1. Then, sum this list together to get N'. Iterate this procedure until you ...
weissguy's user avatar
  • 438
2 votes
0 answers
84 views

TLDR; My question is if this my assumptions regarding convolution steps, etc. are correct, and if there are further asymptotic expansions I could make for $\psi(x)$. I'm almost certain of a mistake in ...
Daniel K's user avatar
  • 345
0 votes
0 answers
76 views

Let $I(a)=\sigma(a)/a$ denote the abundancy index of the positive integer $a$, where $\sigma(a)=\sigma_1(a)$ is the classical sum of divisors of $a$. If $I(a)=b$ where $b$ is an integer, then $a$ is ...
Jose Arnaldo Bebita Dris's user avatar
0 votes
1 answer
228 views

The topic of odd perfect numbers likely needs no introduction. In what follows, we shall denote the classical sum of divisors of the positive integer $x$ by $\sigma(x)=\sigma_1(x)$. Let $q^k n^2$ be ...
Jose Arnaldo Bebita Dris's user avatar
0 votes
1 answer
164 views

In what follows, let $\sigma(x)$ denote the classical sum of divisors of the positive integer $x$, and let $D(x) = 2x-\sigma(x)$ denote the deficiency of $x$. If $p^k m^2$ is an odd perfect number ...
Jose Arnaldo Bebita Dris's user avatar
1 vote
1 answer
77 views

Let $p$ be any prime integer greater than $2$. How might we go about finding the sum of a finite geometric sequence $p^0+p^1+p^2...+p^n$ which is $p$-smooth, i.e. all of its factors are less than $p$ ?...
Older Amateur's user avatar
1 vote
0 answers
45 views

Let $K:=\sum_{k\ge 0}\left(\frac{\sqrt{5}-1}{2}\right)^{2^{k}}$. The observation that the sequence of divisors of a large enough (even) perfect number is "close" to a sequence of consecutive ...
Sylvain Julien's user avatar
-2 votes
1 answer
103 views

I got bored in maths class and came up with this theorem, can someone tell me how to prove it/if it's even possible to prove it at all? Assuming $n$ is a perfect number If you order the divisors of $n$...
Thomas CONNELLY's user avatar
-1 votes
2 answers
107 views

I’ve been delving into an intriguing property related to perfect numbers and their proper divisors. Specifically, I’m investigating numbers $N$ for which the product of their proper divisors equals ...
Fabian Martinez's user avatar
0 votes
1 answer
91 views

Let $p^k m^2$ be an odd perfect number with special prime $p$. Since $p \equiv k \equiv 1 \pmod 4$ must hold, then $m^2 - p^k \equiv 0 \pmod 4$. It follows that $$m^2 - p^k = a^2 - b^2 = (a - b)(a + b)...
Jose Arnaldo Bebita Dris's user avatar
0 votes
0 answers
59 views

The topic of odd perfect numbers likely needs no introduction. In what follows, denote the classical sum of divisors of the positive integer $x$ by $$\sigma(x)=\sigma_1(x).$$ Let $p^k m^2$ be an odd ...
Jose Arnaldo Bebita Dris's user avatar
2 votes
1 answer
133 views

Using the divisor_sigma[n, k] function from the python sympy library where n is the positive integer which is having its divisors added and k is the power each factor is raised to, I was looking for ...
unnamed's user avatar
  • 113
0 votes
1 answer
107 views

where even perfect numbers are of the form $2^{p-1}(2^{p} - 1)$ ( $p$ and $2^{p} - 1$ are prime numbers ) My attempt $\phi(n)$ = ($2^{p - 1} - 2$)($2^{p} - 2$) So, we need to prove that. $2^{p - 1}$($...
Oppenheimer's user avatar

15 30 50 per page
1
2 3 4 5
33