All Questions
5 questions
15
votes
0
answers
365
views
Do primes of the form $4k+1$ ever lead the greatest prime factor race?
Analogous to Chebyshev's race between primes, I examined the race between primes in the greatest prime factors, GPF, of natural numbers. Similar to the regular prime race, in the GPF race, the ...
9
votes
1
answer
858
views
Prove that there are no composite integers $n=am+1$ such that $m \ | \ \phi(n)$
Let $n=am+1$ where $a $ and $m>1$ are positive integers and let $p$ be the least prime divisor of $m$. Prove that if $a<p$ and $ m \ | \ \phi(n)$ then $n$ is prime.
This question is a ...
6
votes
1
answer
242
views
Inductively computing Mersenne primes / perfect numbers?
For two sets $A,B$ set $A+B = \{a +b | a \in A,b \in B\}$.
Let $(x_n)_{n \in \mathbb{N}}$ be independent variables. Let $\sigma(n)$ be the sum of divisors of $n$.
Set $\hat{\phi}(1) = \{x_1\}$ and ...
2
votes
0
answers
300
views
How soon can we represent a number as the sum of two primes?
Posting in MO since it was unanswered in MSE.
Goldbach's conjecture says that every even number can be represented as the sum of two primes. But how soon can we find such a representation. Taking $20 =...
1
vote
0
answers
123
views
Testing polynomials irreducible over the integers
Let $f\in\operatorname{int}(\mathbb Z)$, the ring of integer-valued rational polynomials. Define $\operatorname{P}^+(f)$ as the number of primes $>0$ that $f$ assumes at distinct integral arguments....