If $p$ is prime, for what values of $p$ is $(p-2)!-1$ a power of $p$? I know how to solve that when $p<5$ then $(p-1)!+1$ can be written as power of $p$.
2026-03-31 07:57:18.1774943838
When is $(p-2)!-1$ power of $p$ if $p$ is prime?
957 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in ELEMENTARY-NUMBER-THEORY
- Maximum number of guaranteed coins to get in a "30 coins in 3 boxes" puzzle
- Interesting number theoretical game
- How do I show that if $\boldsymbol{a_1 a_2 a_3\cdots a_n \mid k}$ then each variable divides $\boldsymbol k $?
- Using only the digits 2,3,9, how many six-digit numbers can be formed which are divisible by 6?
- Algebra Proof including relative primes.
- How do I show that any natural number of this expression is a natural linear combination?
- Counting the number of solutions of the congruence $x^k\equiv h$ (mod q)
- algebraic integers of $x^4 -10x^2 +1$
- What exactly is the definition of Carmichael numbers?
- Number of divisors 888,888.
Related Questions in PRIME-NUMBERS
- New prime number
- Confirmation of Proof: $\forall n \in \mathbb{N}, \ \pi (n) \geqslant \frac{\log n}{2\log 2}$
- How do I prove this question involving primes?
- What exactly is the definition of Carmichael numbers?
- I'm having a problem interpreting and starting this problem with primes.
- Decimal expansion of $\frac{1}{p}$: what is its period?
- Multiplying prime numbers
- Find the number of relatively prime numbers from $10$ to $100$
- A congruence with the Euler's totient function and sum of divisors function
- Squares of two coprime numbers
Related Questions in CONGRUENCES
- How do I find the least x that satisfies this congruence properties?
- Counting the number of solutions of the congruence $x^k\equiv h$ (mod q)
- Considering a prime $p$ of the form $4k+3$. Show that for any pair of integers $(a,b)$, we can get $k,l$ having these properties
- Congruence equation ...
- Reducing products in modular arithmetic
- Can you apply CRT to the congruence $84x ≡ 68$ $(mod$ $400)$?
- Solving a linear system of congruences
- Computing admissible integers for the Atanassov-Halton sequence
- How to prove the congruency of these triangles
- Proof congruence identity modulo $p$: $2^2\cdot4^2\cdot\dots\cdot(p-3)^2\cdot(p-1)^2 \equiv (-1)^{\frac{1}{2}(p+1)}\mod{p}$
Related Questions in PRIME-FACTORIZATION
- For which natural numbers are $\phi(n)=2$?
- Fractions of the form $\frac{a}{k}\cdot\frac{b}{k}\cdot\frac{c}{k}\cdots=\frac{n}{k}$
- (Number of perfect powers ≤ n) ∼ $\sqrt{n}$?
- How do I solve complicated prime factorization problems? (Ex: 20711)
- Is there a pattern to addition of primesFactored numbers?
- Proof of Fundamental Theorem of Arithmetic: Uniqueness Part of Proof
- Find a prime factor of $7999973$ without a calculator
- Proof verification: Let $gcd(x,y)=1$. If $xy$ is a perfect square, then $x$ and $y$ are perfect squares.
- An idea for approaching Brocard's problem ($n!+1=m^2$)
- Looking for complex roots of unity which also happen to be complex primes
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
More generally: if $n\in\mathbb Z_{\ge 2}$, $k\in\mathbb Z_{\ge 0}$:
then all the solutions of $(n-2)!-1=n^k$ are $(n,k)=(4,0),(5,1)$.
Checking $n\in\{2,3,4,5\}$ gives those solutions. Let $n\ge 6$; then $k\ge 1$.
Clearly $n$ is odd; also $2<\frac{n-1}{2}\le n-2$, so $n-1\mid (n-2)!=n^k+1$.
But also $n-1\mid n^k-1=(n-1)\left(n^{k-1}+n^{k-2}+\cdots+1\right)$.
Therefore $n-1\mid \left(n^k+1\right)-\left(n^k-1\right)=2$, so $n-1\le 2$, contradiction.