Scribd
Upload
4 views

Greatest Integer Function

git

Uploaded by

mohini.k2026
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
4 views

Greatest Integer Function

git

Uploaded by

mohini.k2026
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 45

Given that “x” is not an integer but positive then x must

definitely be more than [x]. Also the difference between x and


[x] can be anything between 0 and 1 (neither 0 nor 1 included)

So y = [x] – x = negative value between o and -1 ( both not


included)

So z = [y] will be -1
Find the value of [√1 ] + [√2 ] + [√3 ] + [√4 ]
+ ..... + [√24 ], where [x] is the greatest integer
less
• Fromthan or[ √3
[ √1 ] to equal to x.
] each term has value 1, as the square root of all these
numbers will be greater than equal to 1 but less than 2. So, the total of these
three terms will be 3.

• The value of each term from [ √4 ] to [ √8 ] is 2 on the base of the same logic
as explained above, so the total of these 5 terms is 10.

• From [√9 ] to [ √15], value of each term is 3 and total of these 7 terms is 21.

• Similarly, the value of each term from [ √16 ] to [ √24 ] is 4 and the sum of
these 9 terms is 36.

So, [√1 ] + [√2 ] + [√3 ] + [√4 ] + ..... + [√24 ] = 3 + 10 + 21 + 36 = 70.


Since question is about cube root. So [] will face abrupt changes at cubic
numbers:
182764125

[] will return same answer


From ( 1 to 7)  [∛ x ] will give answer and that answer will
be 1
From ( 8 to 26)  [∛ x ] will give answer and that answer will
be 2
From ( 27 to 63)  [∛ x ] will give answer and that answer will
be 3
From ( 63 to 124) [∛ x ] will give answer and that answer will
[x] is definitely a natural number.

If [x] is 3 then x can be at most 3.9999999….. So product of x


and [x] can never be exceed (3x4=12) so it can never be equal
to 15.

If [x] is 4 then x can be anything from 4 to 4.999999999. So


product of x and [x] will definitely exceed (4x4=16) so the
product can not be 15.

So no solution possible.
[ ] onwards till [ ] each term is 1
Answer = 16 terms each equal to 1.
Sum =16
Round 1: Both terms are 0  feasible values of x ={1,2,3,4,5,6,7,8}=> 8 solutions found

Round 2: Both terms are 1  feasible values of x ={11,12,13,14,15,16,17}=> 7 solutions found

Round 3: Both terms are 2  feasible values of x ={22,23,24,25,26}=> 5 solutions found

Round 4: Both terms are 3  feasible values of x ={33,34,35}=> 3 solutions found

Round 5: Both terms are 4  feasible values of x ={44}=> 1 solutions found

Total of (8+7+5+3+1 = 24 solutions found)


How many Whole numbers “N” satisfy the
below given equation.

[ 19 ] [ 21]
N = N
Greatest integer function of

A must be a natural number.

If A = 1 then answer is 1 ( values of m and n don’t even matter)

If A is greater than 1 and m>n then Answer is (A (m-n) -1)

If A is greater than 1 and m<n then Answer is 0.

Answer will be 12 -1 = 1728 -1 =


3

1727
Answer will be 9 -1
6
Answer will be (22 -1) + (32 -1) + (42 -1) + (52 -1) + (62 -1)
Lets think about this scenario first.

Suppose there are 10 positive numbers each more


than 0 but less than 1.

If we add these 10 real numbers together their sum will be


definitely more than 0 but definitely less than 10.
Let a1, a2, a3, a4, ….. an be “n” real positive
numbers.

Then the maximum difference between


[a1+ a2+a3 …….. + an ] and [a1]+[ a2]+[a3] ….. +[an]

will be (n-1)
Let a1, a2, a3 be three real positive numbers.
Then the maximum difference between

[a1+ a2+a3] and [a1]+[ a2]+[a3]


will be 2
Let a1, a2, a3, a4, ….. a17 be seventeen real
positive numbers. Then the maximum
difference between
[a1+ a2+a3 …….. + a17 ] and [a1]+[ a2]+[a3] ….. +[a17]

will be 16
How many natural numbers “N” satisfy the
below given inequality.

4< N ≤7
N = 25 to 63 is valid
solution
Super Fact

You might also like