If sequence { a n } satisfies the property: ∀ n ∈ N + , there exists finite number of positive integers m such that a m < n . Then for any given n , if we count the corresponding number of solutions for m , and take note of the value at the same indices, then we will generate a new sequence { ( a n ) ∗ } .
For example, if { a n } is 1 , 2 , 3 , ⋯ , n , then { ( a n ) ∗ } will be: 0 , 1 , 2 , ⋯ , n − 1 .
Given that ∀ n ∈ N + , a n = n 2 . If we define sequence { b n } as { ( ( a n ) ∗ ) ∗ } , find b 2 0 2 0 .
Have a look at my problem set: SAT 1000 problems
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.
It's pretty obvious that { ( a n ) ∗ } is a monotonous sequence because if a m < n then a m < n + 1 . Moreover, { ( a n ) ∗ } rises either by 1 or 0 since { a n = n 2 } is strictly monotonous. That means that b n is one less than the index of the first ( a n ) ∗ ≥ 2 0 2 0 . So we need a number that is bigger than the first 2020 a n which is obviously is 2 0 2 0 2 + 1 . Then b n = 2 0 2 0 2 = 4 0 8 0 4 0 0
Problem Loading...
Note Loading...
Set Loading...
We are given that a n = n 2 .
Let c n = { ( a n ) ∗ } be a sequence. Then,
c n = No. of m 's such that a m < n .
So solving for given n ,
a m < n ⇒ m 2 < n ⇒ m < n ⇒ 1 ≤ m ≤ ⌈ n ⌉ − 1 where ⌈ . ⌉ is ceiling function.
So, no. of m 's for given n is ⌈ n ⌉ − 1
Hence we get,
c n = ⌈ n ⌉ − 1
Now we are given that b n = { ( ( a n ) ∗ ) ∗ } . So b n = { ( c n ) ∗ } .
Solving similarly for no. of m 's such that c m < n for given n,
c m < n ⇒ ⌈ m ⌉ − 1 < n ⇒ ⌈ m ⌉ < n + 1 ⇒ ⌈ m ⌉ ≤ n ⇒ m ≤ n ⇒ 1 ≤ m ≤ n 2 .
So, no. of m 's for given n is n 2
Hence we get,
b n = n 2
So, b 2 0 2 0 = 2 0 2 0 2 = 4 0 8 0 4 0 0