Find a positive integer n such that ⌊ 1 3 2 0 n ⌋ + ⌈ 2 0 1 3 n ⌉ = 2 0 1 3 .
This problem is proposed by Ahaan Rungta .
Details and assumptions:
The function ⌊ x ⌋ : R → Z refers to the greatest integer smaller than or equal to x . For example ⌊ 2 . 3 ⌋ = 2 and ⌊ − 5 ⌋ = − 5 .
The function ⌈ x ⌉ : R → Z refers to the smallest integer that is greater than or equal to to x . For example, ⌈ 2 . 3 ⌉ = 3 and ⌈ − 5 ⌉ = − 5 .
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.
Most solutions were not able to explain why their answer must be close to the approximate value of 5 2 9 2 0 1 3 × 2 6 0 . It does not follow because we 'round off' the value of 9 1 9 . 8 .
Note: There is no integer solution to ⌈ 1 3 2 0 n ⌉ + ⌊ 2 0 1 3 n ⌋ = 2 0 1 3 . This is why it is important to verify that the guess of n = 9 2 0 does indeed satisfy the conditions of the problem.
We find n for the equation 20n/13 + 13n/20 = 2013. In this equation, n is 919.8242..., so we test n = 920, 919 for the problem above and find that n = 920 is correct.
We can approximate a value for the expression, and then use trial and error to find our answer. ⌊ 1 3 2 0 n ⌋ + ⌈ 2 0 1 3 n ⌉ ≈ 1 3 2 0 n + 2 0 1 3 n = 2 6 0 5 6 9 n Since we want the expression approximately 2013, 2 6 0 5 6 9 n = 2 0 1 3 ⇒ n ≈ 9 1 9 . 8 . A quick check shows that the answer is 9 2 0
We have ⌈ x ⌉ = x or ⌈ x ⌉ = ⌊ x ⌋ + 1 ( x is a real number).
Beside we have ⌊ a ⌋ ≤ a ≤ ⌊ a ⌋ + 1 ( a is a real number).
So, we have 2 0 1 3 = ⌊ 1 3 2 0 n ⌋ + ⌈ 2 0 1 3 n ⌉ ≤ ⌊ 1 3 2 0 n ⌋ + ⌊ 2 0 1 3 n ⌋ + 1 ≤ 1 3 2 0 n + ( 2 0 1 3 n + 1 ) ≤ 2 0 1 3 + 1 = 2 0 1 4
So 5 6 9 2 0 1 2 . 2 6 0 ≤ n ≤ 5 6 9 2 0 1 3 . 2 6 0 and n is an integer number, so n = 9 2 0 .
From ⌊ 1 3 2 0 n ⌋ + ⌈ 2 0 1 3 n ⌉ = 2 0 1 3 , we can say
1 3 2 0 n + s + 2 0 1 3 n − t = 2 0 1 3 , where
0 ≤ s < 1 ,
0 ≤ t < 1 ,
and therefore − 1 < ( s − t ) < 1 (we will remember this for later)
1 3 2 0 n + 2 0 1 3 n = 2 0 1 3 + t − s 2 6 0 5 6 9 n = 2 0 1 3 − ( s − t )
n = 5 6 9 2 6 0 × 2 0 1 3 − 5 6 9 2 6 0 ( s − t ) n = 5 6 9 5 2 3 3 8 0 − 5 6 9 2 6 0 ( s − t ) n = 9 1 9 + 5 6 9 4 6 9 − 5 6 9 2 6 0 ( s − t )
After calculating the bounds of n for when ( s − t ) = 1 and − 1 , we find that 9 1 9 . 3 7 < n < 9 2 0 . 2 8 (to 2 decimal places).
∴ n = 9 2 0
Let us consider 4 nos. x,y,r,R.
By Euclid's division lemma,
20n = 13x + r , r<13
13n = 20y - R , R<20
Examining carefully we see that x+y=2013
Now , 1 3 2 0 n − r = x
2 0 1 3 n − R =y
Solving, we get,
569n-20r+13R=(2013)(260)
now for max value of n, r should be max i.e. 12 and R should be minimum i.e 1
max value of n comes out to be approx 920.
for min value of n, r should be min i.e. 1 and R should be max i.e 19
min value of n comes out to be approx 919
checking both 919 and 920 as n we get 920 as solution.
[a] + [b]=[a+b]. This statement is true in most cases. [20n/13 + 13n/20]=2013 [569n/260]=2013 now , this implies that L.H.S is always greater than or equal to R.H.S. n>=2013*260/569 n>=919.8 a positive integer greater than 919.8 is 920.
20n/13+13n/20=2013
400n+169n=2013 13 20
569n=523380
n=919.824
rounding off n we get n=920
First factorize the given equation :
\frac {20n}{13} + \frac {13n}{20} = 2013 n( \frac {20}{13}+\frac {13}{20}) = 2013 n(\frac {400+169}{260}) =2013 n(\frac {569}{260} = 2013 569n = 2013 x 260 n = 523380/569 n=919.82
Now we ceil n Therefore n = 920
Problem Loading...
Note Loading...
Set Loading...
From the properties of floor and ceiling, x − 1 ≤ ⌊ x ⌋ ≤ x , y ≤ ⌈ y ⌉ ≤ y + 1 . So, we see that x + y − 1 ≤ ⌊ x ⌋ ≤ + ⌈ y ⌉ ≤ x + y + 1 .
Thus 1 3 2 0 n + 2 0 1 3 n − 1 ≤ ⌊ 2 0 n / 1 3 ⌋ + ⌈ 1 3 n / 2 0 ⌉ < 1 3 2 0 n + 2 0 1 3 n − 1
i.e. 2 6 0 5 6 9 n − 1 < 2 0 1 3 ≤ ≤ 5 6 9 n 2 6 0 + 1 . Simplifying gives 9 1 9 . 3 < n < 9 2 0 . 2 8 . We then check that n = 9 2 0 works.
[Latex edits]