You are not logged in.
Thanks to both of you.
I have found these
f(0)=0
2x^2=f(x)+f(-x)
f(x-y)=f(x)+f(-y)-2xy
f(x+1)=f(x)+f(1)+2x
f(2x)=2( f(x)+x^2 )
f(-2x)=2( f(-x)+x^2 )
what do i do now?
What is the function f(x) if this equation holds for each real x,y: f(x+y)=f(x)+f(y)+2xy [i know f(x) is x^2,but how do i formally obtain it?]
I'm getting 1005,1006,1007,1008,1009.Are these correct?
Urgent help needed,obtain a number n such that n! has exactly 250 0's at right(if any).please show the method how you obtained n (or showed that there is no such n).
I thought of this method too.anyway thanks
Thanks,how did you derive the coordinates?I've thought of a way but it's complex.
Suppose y=2x+1 is a line on xy plane.(2,3) is a point,what are the coordinates of the orthogonal projection of point on the line?
I was trying to memorize and explain the logic gates earlier and i thought of sets.if U={1,0} and 1={{ }},0={ } and A AND B=A intersection B,A OR B=A union B,NOT A=A' then the idea seems to work.are these expressions valid?
Can logic gates be expressed using mathematical operations
Those are series tests i asked for sequence tests,sorry for disturabing.
Are there tests to see if a sequence (not series) converges?
I know that limit of (1+1/n)^n as n approches infinity is e.the limit of (1+1/n)^n as n approches nagetive infinity is also e,but how do i prove that?
Oh yeah,sorry for disturbing
How can i prove this-for all x,y in N, if x^y=y^x then x=y.
When do i use the brackets and what is the meaning of the 2 signs which look like v and upside-down v.
How do i write this using logic symbols "for all natural number x there exists a unique y such that y is twice as x" ?
Thanks,by the way is R constructed the same way?
So,can this axiom be used to prove stuff for integers?
Never mind i found ways to prove commutative and associative law of addition of natural numbers in internet[though i'd appreciate it if anyone tells me how this is extended to Z,Q,R,..]
By (c) i stated that -1,-2,-3,-4,... are in S,the general axiom doesn't state that.
Hi, I think i have found a way to use induction for integer set too (don't know if it was discovered before this post) by extending the axiom of induction we get "if S is a subset of Z and (a) 0 belongs to S,(b) for n belonging to S (n+1) belongs to S,(c)for n belonging to S (n-1) belongs to S ,then S=Z." if I'm wrong I hope others will correct me.
I have a younger cousin who wants to know how to prove addition is commutative and associative for whole numbers .but i don't know how to do that,can anyone help?plus it'd be good if anyone can tell me how the proof is extended to other number sets.
Oh,thanks.
Why isn't nagetive number or fractions<1 allowed?