⌊ 2 0 1 6 ! + 2 0 1 5 ! 2 0 1 7 ! + 2 0 1 4 ! ⌋ = ?
(Note that ⌊ x ⌋ denotes the greatest integer less than or equal to x .)
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Good approach..appreciate that...
Why is 1/2017x2015 not counted ? Is it because of its extremely tiny value that makes it excluded ?
Log in to reply
Because it's less than one, and we are taking the greatest integer less than or equal to 2016+x, and x < 1 so it's 2016
this is the best method... I did in the same way...Well done
Let n = 2 0 1 6
n ! + ( n − 1 ) ! ( n + 1 ) ! + ( n − 2 ) !
= n ( n − 1 ) + ( n − 1 ) ( n + 1 ) n ( n − 1 ) + 1
= n 2 − 1 n ( n 2 − 1 ) + 1 = n + n 2 − 1 1
Then the answer is 2 0 1 6
Your taking n = 2016 was the trick to make the sum shorter. Excellent method.
[(2014!(2017x2016x2015+1/(2015!(2016+1))] =[(2017x2016x2015+1)/2015x2017 =[2016+1/(2015x2016)] which is very close to 2016
A four line java program can be used to do it much faster. Can anyone please suggest any method to do the sum mentally ?
Yes! You can generalize the solution for these problems with the form (n!+(n-3)!)/((n-1)!+(n-2)!) as (n-1)+(1/((n-1)(n-2)+(n-2)))
What is the java program?
Problem Loading...
Note Loading...
Set Loading...
⌊ ( ( 2 0 1 6 × 2 0 1 5 ) + 2 0 1 5 ) 2 0 1 4 ( ( 2 0 1 7 × 2 0 1 6 × 2 0 1 5 ) + 1 ) 2 0 1 4 ⌋ = ⌊ ( 2 0 1 7 × 2 0 1 5 ) ( ( 2 0 1 7 × 2 0 1 6 × 2 0 1 5 ) + 1 ) ⌋ = ⌊ 2 0 1 6 + 2 0 1 7 × 2 0 1 5 1 ⌋ = 2 0 1 6