125 reputation
4
bio website about.me/clschnei
location Belleville, MI
age 25
visits member for 2 years, 5 months
seen Dec 5 '11 at 20:45

Developer at Agrisight, Inc. (www.farmlogs.com)


Dec
5
comment How many strings are there of $4$ or fewer lower case letters that have the letter '$x$' in them?
Thank you, I know this is a relatively facile for you guys so I appreciate the explanation.
Dec
5
accepted How many strings are there of $4$ or fewer lower case letters that have the letter '$x$' in them?
Dec
5
comment How many strings are there of $4$ or fewer lower case letters that have the letter '$x$' in them?
Shouldn't the 2 letter calculation be 26^2 - 25^2 (top solution for repeating x being allow)?
Dec
5
comment How many strings are there of $4$ or fewer lower case letters that have the letter '$x$' in them?
Yes repeating x is allowed.
Dec
5
asked How many strings are there of $4$ or fewer lower case letters that have the letter '$x$' in them?
Nov
14
awarded  Supporter
Nov
14
comment Show that $f_0 - f_1 + f_2 - \cdots - f_{2n-1} + f_{2n} = f_{2n-1} - 1$ when $n$ is a positive integer
Thank you for the prompt answer, by the way.
Nov
14
accepted Show that $f_0 - f_1 + f_2 - \cdots - f_{2n-1} + f_{2n} = f_{2n-1} - 1$ when $n$ is a positive integer
Nov
14
comment Show that $f_0 - f_1 + f_2 - \cdots - f_{2n-1} + f_{2n} = f_{2n-1} - 1$ when $n$ is a positive integer
They only can help if they would respond to their emails. Otherwise, I wait until tomorrow. Yet another case where math professors at my university are essentially useless. haha
Nov
14
comment Show that $f_0 - f_1 + f_2 - \cdots - f_{2n-1} + f_{2n} = f_{2n-1} - 1$ when $n$ is a positive integer
Yes, it is Fibonacci. Doesn't claim on the assinment, but does reference a set of problems from the book. My mistake, I apologize.
Nov
14
comment Show that $f_0 - f_1 + f_2 - \cdots - f_{2n-1} + f_{2n} = f_{2n-1} - 1$ when $n$ is a positive integer
It doesn't say...so I have no answer for that.
Nov
14
asked Show that $f_0 - f_1 + f_2 - \cdots - f_{2n-1} + f_{2n} = f_{2n-1} - 1$ when $n$ is a positive integer
Oct
31
awarded  Scholar
Oct
31
comment Use congruences to show that $6$ divides $n^3 – n$ for every integer $n$
Thanks guys. This discrete math...nothing but hard times.
Oct
31
accepted Use congruences to show that $6$ divides $n^3 – n$ for every integer $n$
Oct
31
awarded  Student
Oct
31
asked Use congruences to show that $6$ divides $n^3 – n$ for every integer $n$
Oct
31
awarded  Autobiographer