Re: [algogeeks] Needed recursive sol
F(0)+F(2)+...+F(2n) = F(2n+1) - 1 Wladimir Araujo Tavares *Federal University of Ceará http://lia.ufc.br/%7Ewladimir/ Homepage http://lia.ufc.br/%7Ewladimir/ | Maratonahttps://sites.google.com/site/quixadamaratona/| * On Sat, Oct 1, 2011 at 1:40 PM, rahul sharma rahul23111...@gmail.comwrote: nyone provide me with recursive sol of the following prob. find the sum of all even nos. in the fibbonacci series upto 1000thnx in davance -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Needed recursive sol
PLZ EXPLAIN A BIT MORE On Sat, Oct 1, 2011 at 10:46 PM, Wladimir Tavares wladimir...@gmail.comwrote: F(0)+F(2)+...+F(2n) = F(2n+1) - 1 Wladimir Araujo Tavares *Federal University of Ceará http://lia.ufc.br/%7Ewladimir/ Homepage http://lia.ufc.br/%7Ewladimir/ | Maratonahttps://sites.google.com/site/quixadamaratona/| * On Sat, Oct 1, 2011 at 1:40 PM, rahul sharma rahul23111...@gmail.comwrote: nyone provide me with recursive sol of the following prob. find the sum of all even nos. in the fibbonacci series upto 1000thnx in davance -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Needed recursive sol
I am I not wrong, the problem asks for fib numbers which are even, not fib numbers with even index...? On Sat, Oct 1, 2011 at 10:16 PM, Wladimir Tavares wladimir...@gmail.comwrote: F(0)+F(2)+...+F(2n) = F(2n+1) - 1 Wladimir Araujo Tavares *Federal University of Ceará http://lia.ufc.br/%7Ewladimir/ Homepage http://lia.ufc.br/%7Ewladimir/ | Maratonahttps://sites.google.com/site/quixadamaratona/| * On Sat, Oct 1, 2011 at 1:40 PM, rahul sharma rahul23111...@gmail.comwrote: nyone provide me with recursive sol of the following prob. find the sum of all even nos. in the fibbonacci series upto 1000thnx in davance -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- Shuaib -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Needed recursive sol
yeah like0 1 1 3 5 8 .only even shpuld be added 0+8..u r ryt On Sat, Oct 1, 2011 at 10:56 PM, Shuaib Khan aries.shu...@gmail.com wrote: I am I not wrong, the problem asks for fib numbers which are even, not fib numbers with even index...? On Sat, Oct 1, 2011 at 10:16 PM, Wladimir Tavares wladimir...@gmail.comwrote: F(0)+F(2)+...+F(2n) = F(2n+1) - 1 Wladimir Araujo Tavares *Federal University of Ceará http://lia.ufc.br/%7Ewladimir/ Homepage http://lia.ufc.br/%7Ewladimir/ | Maratonahttps://sites.google.com/site/quixadamaratona/| * On Sat, Oct 1, 2011 at 1:40 PM, rahul sharma rahul23111...@gmail.comwrote: nyone provide me with recursive sol of the following prob. find the sum of all even nos. in the fibbonacci series upto 1000thnx in davance -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- Shuaib -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Needed recursive sol
Sorry! you want to find the following sum: F (0) + F (3) + F (6) + ... + F (3n) =? I do not know any formula for this sum. This formula may help here: F (0) + F (1) + F (2) + F (3 )+...+ F (n) = F (n +2) - 1 F (3n) = 3F (n) ^ 3 + 3 (-1) ^ nF (n) You can prove this by induction! Wladimir Araujo Tavares *Federal University of Ceará http://lia.ufc.br/%7Ewladimir/ Homepage http://lia.ufc.br/%7Ewladimir/ | Maratonahttps://sites.google.com/site/quixadamaratona/| * On Sat, Oct 1, 2011 at 2:29 PM, rahul sharma rahul23111...@gmail.comwrote: yeah like0 1 1 3 5 8 .only even shpuld be added 0+8..u r ryt On Sat, Oct 1, 2011 at 10:56 PM, Shuaib Khan aries.shu...@gmail.comwrote: I am I not wrong, the problem asks for fib numbers which are even, not fib numbers with even index...? On Sat, Oct 1, 2011 at 10:16 PM, Wladimir Tavares wladimir...@gmail.comwrote: F(0)+F(2)+...+F(2n) = F(2n+1) - 1 Wladimir Araujo Tavares *Federal University of Ceará http://lia.ufc.br/%7Ewladimir/ Homepage http://lia.ufc.br/%7Ewladimir/ | Maratonahttps://sites.google.com/site/quixadamaratona/| * On Sat, Oct 1, 2011 at 1:40 PM, rahul sharma rahul23111...@gmail.comwrote: nyone provide me with recursive sol of the following prob. find the sum of all even nos. in the fibbonacci series upto 1000thnx in davance -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- Shuaib -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Needed recursive sol
check dis out
int fibbevensum()
{
static int a=0,b=1;
static int c,sum;
c=a+b;
if(c1000)
return sum;
if(c%2==0)
sum=sum+c;
a=b;
b=c;
fibbevensum();}
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this discussion on the web visit
https://groups.google.com/d/msg/algogeeks/-/D7zy55yu6ZEJ.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Needed recursive sol
its giving 16384???
On Sat, Oct 1, 2011 at 11:29 PM, geeks ankurshukla.h...@gmail.com wrote:
check dis out
int fibbevensum()
{
static int a=0,b=1;
static int c,sum;
c=a+b;
if(c1000)
return sum;
if(c%2==0)
sum=sum+c;
a=b;
b=c;
fibbevensum();}
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this discussion on the web visit
https://groups.google.com/d/msg/algogeeks/-/D7zy55yu6ZEJ.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Needed recursive sol
it looks ok but not working
On Sat, Oct 1, 2011 at 11:37 PM, rahul sharma rahul23111...@gmail.comwrote:
its giving 16384???
On Sat, Oct 1, 2011 at 11:29 PM, geeks ankurshukla.h...@gmail.com wrote:
check dis out
int fibbevensum()
{
static int a=0,b=1;
static int c,sum;
c=a+b;
if(c1000)
return sum;
if(c%2==0)
sum=sum+c;
a=b;
b=c;
fibbevensum();}
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this discussion on the web visit
https://groups.google.com/d/msg/algogeeks/-/D7zy55yu6ZEJ.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Needed recursive sol
@rahul:
here is the full working codE:
#includestdio.h
int fibbevensum()
{
static int a=0,b=1;
static int c=0,sum=0;
// printf(\nHi %d %d %d\n,a,b,sum);
c=a+b;
if(c8)
return sum;
if(c%2==0)
sum=sum+c;
a=b;
b=c;
int d=fibbevensum();
return d;}
int main(){
int ans;
ans=fibbevensum();
printf(%d,ans);
return 0;
}
On Sat, Oct 1, 2011 at 11:42 PM, rahul sharma rahul23111...@gmail.comwrote:
it looks ok but not working
On Sat, Oct 1, 2011 at 11:37 PM, rahul sharma rahul23111...@gmail.comwrote:
its giving 16384???
On Sat, Oct 1, 2011 at 11:29 PM, geeks ankurshukla.h...@gmail.comwrote:
check dis out
int fibbevensum()
{
static int a=0,b=1;
static int c,sum;
c=a+b;
if(c1000)
return sum;
if(c%2==0)
sum=sum+c;
a=b;
b=c;
fibbevensum();}
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this discussion on the web visit
https://groups.google.com/d/msg/algogeeks/-/D7zy55yu6ZEJ.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
Shashank Verma
:-)
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
