Skip to main content

All Questions

Filter by
Sorted by
Tagged with
2 votes
0 answers
157 views

Conjecture: $x^4+1$ is never Wieferich prime

Related to this question and Alexander Kalmynin's answer. For natural $n$ define $J(n)=(2^{n-1}-1) \bmod n^2$ and if $n$ is power of two define $J(2^n)=1$ (this is artificial, just to avoid triviality ...
joro's user avatar
  • 25.4k
0 votes
0 answers
110 views

What will be the set of non-Wieferich numbers if the set of non-Wieferich primes is finite?

Integer $n$ is Wieferich number if $2^{\phi(n)}-1 \equiv 0 \pmod {n^2}$. Wieferich prime is Wieferich number with $n$ prime. It is an open problem if there are infinitely many Wieferich primes and ...
joro's user avatar
  • 25.4k
1 vote
1 answer
594 views

Polynomials, $3^x$ and the Collatz conjecture

$\DeclareMathOperator\Orb{Orb}\newcommand\abs[1]{\lvert#1\rvert}$The Collatz or the $3n+1$ conjecture is open. Are there non-trivial polynomials $f(x)\in\mathbb Z[x]$ and $g(x)\in\mathbb R[x]$ having ...
Turbo's user avatar
  • 13.9k
8 votes
0 answers
1k views

Is the Collatz conjecture known to be true for interesting unbounded classes of numbers?

The Collatz or the $3n+1$ conjecture is open. Is there a specific polynomial $f(x)\in\mathbb Z[x]$ whose range is unbounded for which every integer of form $|f(m)|$ at $m\in\mathbb Z$ satisfies $3n+1$...
Turbo's user avatar
  • 13.9k