1
You visited us
1
times! Enjoying our articles?
Unlock Full Access!
Byju's Answer
Standard XII
Mathematics
Factorial
Prove that th...
Question
Prove that the remainder when
1
!
+
2
!
+
.
.
.
.
.
+
1000
!
is divided by
15
be
3
.
Open in App
Solution
We have
5
!
=
5.4.3.2.1
=
120
is perfectly divisible by
15
.
Again
(
5
+
n
)
!
[
n
∈
N
] has a factor
15
, this gives remainder
0
when divided by
15
.
Now reminder will come only from
1
!
+
2
!
+
3
!
+
4
!
=
33
.
This leaves remainder
3
when divided by
15
.
Suggest Corrections
0
Similar questions
Q.
What is the remainder when (1! + 2! + 3!+...1000!) is divided by 5?
Q.
A polynomial
f
(
x
)
leaves remainder
15
when divided by
(
x
−
3
)
and
(
2
x
+
1
)
when divided by
(
x
−
1
)
2
. When
f
is divided by
(
x
−
3
)
(
x
−
1
)
2
,
the remainder is
Q.
W
h
a
t
i
s
t
h
e
r
e
m
a
i
n
d
e
r
w
h
e
n
N
=
(
1
!
+
2
!
+
3
!
+
.
.
.1000
)
40
i
s
d
i
v
i
d
e
d
b
y
10
?
Q.
The remainder when
1
!
+
2
!
+
3
!
+
.
.
.
95
!
is divided by 15 is
Q.
The remainder obtained when 1! + 2! + 3! + . . . + 27! is divided by 15 is
View More
Join BYJU'S Learning Program
Grade/Exam
1st Grade
2nd Grade
3rd Grade
4th Grade
5th Grade
6th grade
7th grade
8th Grade
9th Grade
10th Grade
11th Grade
12th Grade
Submit
Related Videos
Permutations
MATHEMATICS
Watch in App
Explore more
Factorial
Standard XII Mathematics
Join BYJU'S Learning Program
Grade/Exam
1st Grade
2nd Grade
3rd Grade
4th Grade
5th Grade
6th grade
7th grade
8th Grade
9th Grade
10th Grade
11th Grade
12th Grade
Submit
AI Tutor
Textbooks
Question Papers
Install app