# Function

166 views
The function defined for positive integers by $F(1)=1,F(2)=1,F(3)=-1$ and by identities F(2k)=F(k),F(2k+1)=F(k) for $k>=2.$The sum $F(1)+F(2)+F(3)+...+F(100)$ is________
0
67.?
1
May u check your question once again because according to F(3) function F(2k+1)  should be equal to -F(k) not F(k).
0
34?
0
$28$ is the right
0
@Lakshman Patel RJIT is question is correct?
0
Yes ,in test series
0
It is not correct question. leave it
0

Let's start series by ignoring first 3 numbers. So F(4)=1,F(5)=1,F(6)=-1,F(7)=-1,F(8)=1,F(9)=1,F(10)=1,F(11)=1,

We observe that +1 and -1 will occur simultaneously as +2,-2,+4,-4,+8,-8,+16,-16,+32 .Now total terms are 92.So,until 97 5 times -1 will be there so,32 -5=27, Now adding +1 as F(0)+F(1)+F(2)=1 So,27+1=28
0
How you got this, So, until 97, 5 times -1 will be there so,32 -5=27?
0
I think from $F(1)$ $to$ $F(95)=32+1=33$

and we find the$:F(96)=F(2.48)=F(48)=F(2.24)=F(24)=F(2.12)=F(12)=F(2.6)=F(6)=F(2.3)=F(3)=-1$

similarly we can find $F(97)=-1,F(98)=-1,F(99)=-1,F(100)=-1$

So,we get $F(1)+F(2)+...........+F(95)+F(96)+F(97)+F(98)+F(99)+F(100)$

$\Rightarrow33-1-1-1-1-1$

$\Rightarrow 28$

1
After 32 +1 there will be 32 -1 .But as we have reached upto 92 (+3 as I stared from 4) already and we need to go upto 97( +3) as we will have only -5. So,32-5=27.
0
Yes, see my comment is also right?

## Related questions

1
77 views
The number of ways possible to form injective function from set A set B where |A| = 3 and |B| = 5 such that pth element of set A cannot match with pthelement of set B are _________.
Let $f(x)$ mean that function $f$ ,applied to $x$,and $f^{n}(x)$ mean $f(f(........f(x)))$,that is $f$ applied to $x$ ,$n$ times.Let $g(x) = x+1$ and $h_{n}(x)=g^{n}(x).$Then what is $h_{9}^{8}(72)?$