n ! = 2 0 1 5 2 0 1 3 ! + 2 0 1 4 ! , n = ?
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. Can you generalize this?
Here's a generalized form:
∀ n , a , m ∈ Z + , n ! = 1 + k = 1 ∏ m ( a + k ) a ! + ( a + m ) ! ⟹ n = a
For the problem here, take a = 2 0 1 3 , m = 1 .
Log in to reply
Can you plz explain how to generalize ? I really love to know this stuff.
Wow, this is fun!
perfect solution.. Gooooooooood
We know the permutation 2013! = 2013 × 2012 × 2011 × 2010 × 2009 × 2008 ... × 1 and we know 2014! = 2014 × 2013 × 2012 × 2011 × 2010 × 2009 × 2008 ... × 1 so because of our knowledge with algebra we can isolate a 2014 and multiply that by 2013! to get 2014 × 2013! which in its natural permutation is 2014!. Then, factor out as shown:
n! = 2013! ( 1 + 2014 ) --> Notice that 1 + 2014 = 2015 and 2015 is in the denominator of the original equation so the ( 1 + 2014 ) on top and the 2015 on bottom cancel out. This then leaves us with:
n! = 2013!
OR
n = 2013
2015n!= 2013!+2014!
2015n!=2013!(2014+1)
2015n!=2013!(2015)
n!=2013!
n=2013
This actually works out by that taking out the common factor method, as well as other numbers.... like.... x!+ (x+1)!/(x+2) = x! I tried this out with 3,4,5 and 4,5,6 ....it was right ....
Problem Loading...
Note Loading...
Set Loading...
n ! = 2 0 1 5 2 0 1 3 ! ( 1 + 2 0 1 4 ) = 2 0 1 5 2 0 1 3 ! ⋅ 2 0 1 5 = 2 0 1 3 !
So n = 2 0 1 3