Find the last three digits of the following: $$1!+3!+5!+7!+\ldots+2013!+2015!+2016!$$ I have tried to divide by $1000$ up to $15!$, but the number is too high and confused. So I wanna know if there is other way to solve this problem. Thanks in advance!
2026-04-07 14:40:29.1775572829
Last $3$ digits of addition, Olympiad problem.
211 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in REAL-ANALYSIS
- how is my proof on equinumerous sets
- Finding radius of convergence $\sum _{n=0}^{}(2+(-1)^n)^nz^n$
- Optimization - If the sum of objective functions are similar, will sum of argmax's be similar
- On sufficient condition for pre-compactness "in measure"(i.e. in Young measure space)
- Justify an approximation of $\sum_{n=1}^\infty G_n/\binom{\frac{n}{2}+\frac{1}{2}}{\frac{n}{2}}$, where $G_n$ denotes the Gregory coefficients
- Calculating the radius of convergence for $\sum _{n=1}^{\infty}\frac{\left(\sqrt{ n^2+n}-\sqrt{n^2+1}\right)^n}{n^2}z^n$
- Is this relating to continuous functions conjecture correct?
- What are the functions satisfying $f\left(2\sum_{i=0}^{\infty}\frac{a_i}{3^i}\right)=\sum_{i=0}^{\infty}\frac{a_i}{2^i}$
- Absolutely continuous functions are dense in $L^1$
- A particular exercise on convergence of recursive sequence
Related Questions in MODULAR-ARITHMETIC
- 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)
- Remainder of $22!$ upon division with $23$?
- Does increasing the modulo decrease collisions?
- Congruence equation ...
- Reducing products in modular arithmetic
- Product of sums of all subsets mod $k$?
- Lack of clarity over modular arithmetic notation
- How to prove infinitely many integer triples $x,y,z$ such that $x^2 + y^2 + z^2$ is divisible by $(x + y +z)$
- Can $\mathbb{Z}_2$ be constructed as the closure of $4\mathbb{Z}+1$?
Related Questions in CONTEST-MATH
- Solution to a hard inequality
- Length of Shadow from a lamp?
- All possible values of coordinate k such that triangle ABC is a right triangle?
- Prove that $1+{1\over 1+{1\over 1+{1\over 1+{1\over 1+...}}}}=\sqrt{1+\sqrt{1+\sqrt{1+\sqrt{1+...}}}}$
- Lack of clarity over modular arithmetic notation
- if $n\nmid 2^n+1, n|2^{2^n+1}+1$ show that the $3^k\cdot p$ is good postive integers numbers
- How to prove infinitely many integer triples $x,y,z$ such that $x^2 + y^2 + z^2$ is divisible by $(x + y +z)$
- Proving that $b-a\ge \pi $
- Volume of sphere split into eight sections?
- Largest Cube that fits the space between two Spheres?
Related Questions in FACTORIAL
- How is $\frac{\left(2\left(n+1\right)\right)!}{\left(n+1\right)!}\cdot \frac{n!}{\left(2n\right)!}$ simplified like that?
- Remainder of $22!$ upon division with $23$?
- What is the name of this expression?
- How to compute $\left(\frac{n-1}{2}\right)!\pmod{n}$ fast?
- Proving $\sum_{k=1}^n kk!=(n+1)!−1$
- How do we know the Gamma function Γ(n) is ((n-1)!)?
- Approximate value of $15!$
- Limit of a Sequence involving factorials
- How to understand intuitively the fact that $\log(n!) = n\log(n) - n + O(\log(n))$?
- Deriving the fact that the approximation $\log(n!) \approx n\log(n) - n + \frac{1}{2}\log(2\pi n)$ is $O(1/n)$.
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?
You can work via modular arithmetic, simplifying mod $1000$ after each step.
$1! = 1, 3! = 6, 5! =120$.
$7! = 7 \times 6 \times 5! = 5040 \equiv 40 \mod 100$ (by computation)
$9! = 9 \times 8 \times 40 \equiv 880$ (here we do not have to compute $9!$).
$11! = 11 \times 10 \times 880 = 11 \times 800 \equiv 800 $
$13! = 13 \times 12 \times 800 = 13*600 \equiv 800$
$15!$ is a multiple of $1000$, and so are the others after this, so the answer would be $800 + 800 + 880 + 40 + 120+6+1 = 647 $ modulo $1000$. Important to note that no factorial above $7!$ was computed explicitly.
Note : You cannot avoid simple computations. All the above computations were atmost of four-digit complexity.
Wolfram verifies the the sum up to $13!$ as $6267305647$, so the above answer is correct.
EDIT : About the question asked in the comments, we have to essentially compute $1! + ... + 14!$ modulo $1000$. Again, we can work by hand :
You will get, by hand, the sum up to $6!$, as $720 + 120 + 24 + 6 + 2 +1 = 873$.
Now, it is a question of computation and reduction:
$7! = 7\times 6! = 5040 = 40$
$8! = 8 \times 40 = 320$
$9! = 9 \times 320 = 2880 = 880$
$10! = 10 \times 880 = 8800 = 800$
$11! = 800 \times 11 = 8800 = 800$
$12! = 800 \times 12 = 9600 = 600$
$13! = 600 \times 13 = 7800 = 800$
$14! = 800 \times 14 = 11200 = 200$
Now, add these up : $100(8+8+8+2+6) + 880 + 320+40+873 = 273$ (after reduction).
However, I would feel sympathetic if you were allotted four minutes for this question. Probably it is worth more marks than the others, but that is scant consolation for a problem nearly involving outright computation.
Furthermore, there isn't any sum of factorials formula, by my reckoning, that is capable of producing the remainder mod $1000$ (and if there is some complicated formula involving exponentials and gamma functions, then that is a roof too high for tenth grade, certainly). Hence (unfortunately) this problem is done only by computation.