Reputation
4,486
Top tag
Next privilege 5,000 Rep.
Approve tag wiki edits
Badges
4 17 47
Impact
~154k people reached

Jan
14
revised Example of two analytic functions that differ at countably infinity many point
edited tags
Jan
14
asked Example of two analytic functions that differ at countably infinity many point
Jan
13
comment Let $f(x) = (x^n-1)/(x-1)$. Why does $f(1)=n$?
@mathjacks : updated my answer, I think you need to look athttps://en.wikipedia.org/wiki/Analytic_continuation
Jan
13
revised Let $f(x) = (x^n-1)/(x-1)$. Why does $f(1)=n$?
added 576 characters in body
Jan
13
answered Let $f(x) = (x^n-1)/(x-1)$. Why does $f(1)=n$?
Jan
12
comment How can an angle be negative?
fyi angles can be complex or even matrix, now get somebody explain that cause I cant.
Jan
10
comment Find the value of the infinite product $\sqrt\frac12\cdot\sqrt{\frac12+\sqrt\frac12}\cdot\sqrt{\frac12+\sqrt{\frac12+\sqrt\frac12}}\cdots$
i am not the down voter, but you can do few more steps in few different ways just to show yourself that you really have tried.
Jan
9
comment example of a function that could only be defined recursively
@mvw : my question is not about computing theory, for example factorial can be defined recursively or as gamma function, can it be shown that Ackerman fuction can not be defined without requiring it's own previous values ?
Jan
7
comment example of a function that could only be defined recursively
Hi Robert, I did not mean to ask a computing question, by recursive I mean something that uses a relation to self similarity in some way. Eg the next Fibonacci number is related to two previous fib numbers, yet it here is a function that generates all the fib numbers without relying on the knowledge of previous numbers. Similar thing for recursive definition of factorial works with gamma function. So it seems that although it might be difficult to have a recursive function defined non recursively with some effort, but is thee a case where it is impossible?
Jan
7
comment example of a function that could only be defined recursively
@NoChance look up gamma function
Jan
7
comment example of a function that could only be defined recursively
@NoChance not really, just multiply the numbers from 1 to n and you have the result. Even Fibonacci can be written as a function of 1 variables. Actually the multiplication of 1 to n is a better implementation of n! Than the recursive definition. The text books use n! As a bad example to introduction into recursion.
Jan
7
asked example of a function that could only be defined recursively
Jan
5
comment How to find the sum of the infinite series whose general term is not easy to visualize
this is not an answerable question
Jan
5
comment How to find the sum of the infinite series whose general term is not easy to visualize
The general term can be made anything we want it to be, this is same as given a finite sequence trying to guess the next term. without the explicit formula for the general term or some recursive way of defining the terms it is just waste of time to guess the general fprm.
Jan
3
comment Behavior of interesting sequence
can you give the calculation for few terms?
Dec
30
revised $\lim\limits_{m\to\infty}\frac{1}{m}\sum_{n=1}^m\cos\left({\frac{2\pi n x}{b}}\right)$ to a definite integral
added 1 character in body; edited title
Dec
24
revised Calculate $\int_{0}^{\pi} \frac{x}{a-\sin{x}}dx , \quad a>1$
edited title
Dec
18
comment Infinite sums of reciprocal power: $\sum\frac1{n^{2}}$ over odd integers
solve? what is the unknown variable to solve for? dont you mean evaluate in closed form?
Dec
18
comment Confused about Maniplating Limits
@just give me the a, b, c ,d,e separately and I put it together, I had the same problem as you, couldnt separate them
Dec
18
comment Confused about Maniplating Limits
please fix the mathjax