How can I find the fifth last digit of $5^{5^{5^{5^5}}}$? I tried to evaluate $5^{5^{5^{5^5}}}\pmod {100000}$. But the exponent is so huge that I'm unable to evaluate it. Also, $(5,100000)=5$ , so $5$ and $100000$ are not coprime, so Euler's totient theorem seems to be useless.
2026-03-27 09:48:14.1774604894
Fifth last digit of a huge number
2.4k 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 EXPONENTIATION
- exponential equation with different bases; no logarithms
- Is square root of $y^2$ for every $y>0,y\in\mathbb{R}$?
- Definite sum for $(1+a)^n$
- Fractional exponents definition and the additive law of exponents
- Fourth term in the expansion of $(1-2x)^{3/2}$
- Why is $\int_{0}^{t} e^{nt} \mathrm{\ dt} = \frac{1}{n} \left(e^{nt} - 1\right)$? [solved; notation is also faulty in the first place]
- Exponentiation property of the modulo operator
- When are $\left(\frac{a}{b}\right)^c$ and $\frac{a^c}{b^c}$ equivalent?
- How can I rewrite expression to get log out of exponent
- Compare $2^{2016}$ and $10^{605}$ without a calculator
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 POWER-TOWERS
- The sequence satisfying $a_2^{a_3^{\dots^{a_n}}} = n $
- $f(x) = \sqrt x^{{\sqrt[3]{x}}^{\sqrt[4]{x},\cdots}}$ asymptotic?
- Area under the infinite tetration curve
- The Tower of 5 5s
- What's a general algorithm/technique to find the last digit of a nested exponential?
- Dividing power towers by exponents
- Solve $i^{i^{i^\ldots}}$
- $2^{3^{4^{...^{n}}}} \equiv 1$ (mod $n+1$)
- Is $i = e^{\frac{\pi}{2}e^{\frac{\pi}{2}^{.^{.^.}}}}$?
- Why is $x=4$ as a fixed point of a map $\sqrt{2}^{x}$ unstable?
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?
Your title asks one question ("fifth last digit") and the body of your question asks a different one ("number modulo 10,000"), which is a bit confusing. Fortunately the same answer applies to both.
The last five digits of the 5th, 6th, 7th,... 13th powers of 5 are 03125, 15625,78125, 90625, 53125, 65625, 28125, 40625, 03125, at which point the sequence obviously repeats. Thus the last 5 digits of $5^n$ (for $n\ge 5$) depend only on the value of $n\pmod 8$.
Your number, $5^{5^{5^{5^5}}}$, is $5^n$ where $n=5^{5^{5^5}}$. To know its last five digits, we need to work out the value of $n\pmod 8$. The remainders after dividing the 0th, 1st and 2nd powers of 5 by 8 are 1, 5, 1, after which the sequence obviously repeats. Thus odd powers of 5 equal 5 modulo 8 and even powers of 5 equal 1 modulo 8.
$n=5^{5^{5^5}}$ is an odd power of 5, so $n\pmod{8}=5$. Consequently the last 5 digits of $5^{5^{5^{5^5}}}=5^n$ are 03125. Therefore: