Closed. This question is not about programming or software development. It is not currently accepting answers.
This question does not appear to be about a specific programming problem, a software algorithm, or software tools primarily used by programmers. If you believe the question would be on-topic on another Stack Exchange site, you can leave a comment to explain where the question may be able to be answered.
Closed 6 days ago.
Improve this question
I'm new to solving big -O and analysis questions and I'm slightly confused on this problem. excuse me if my math is wrong but f(n) <= Cg(n) in this case n(2^n) = f(n) and 2^2n = g(n)
boiling it down I get n/2^n <= C after working it out.
im lost on how to find n0 and C, I assume n0 is 1 as it is usually the case, but im uncertain of C, i assume its 2 but im not sure how to show so.
Related
Closed. This question is not about programming or software development. It is not currently accepting answers.
This question does not appear to be about a specific programming problem, a software algorithm, or software tools primarily used by programmers. If you believe the question would be on-topic on another Stack Exchange site, you can leave a comment to explain where the question may be able to be answered.
Closed 5 days ago.
Improve this question
Find A^50 using matrix
I couldn't understand how to prove the first part
Closed. This question is not about programming or software development. It is not currently accepting answers.
This question does not appear to be about a specific programming problem, a software algorithm, or software tools primarily used by programmers. If you believe the question would be on-topic on another Stack Exchange site, you can leave a comment to explain where the question may be able to be answered.
Closed last month.
Improve this question
Using the fact that Gaussian(λ=σ) is an approximation of Poisson(λ), I want to compute an approximation of Poisson noise using only uniform random numbers without using factorials.
There are two things I have no clue.
How to approximate gaussian noise from uniform noise.
How to approximate Poisson noise with Gaussian noise when λ is small.
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
Closed 9 years ago.
Questions asking for code must demonstrate a minimal understanding of the problem being solved. Include attempted solutions, why they didn't work, and the expected results. See also: Stack Overflow question checklist
This question does not appear to be about a specific programming problem, a software algorithm, or software tools primarily used by programmers. If you believe the question would be on-topic on another Stack Exchange site, you can leave a comment to explain where the question may be able to be answered.
Improve this question
I have this function with R.
immediate.amput.EV <- function(Dead.prob=.010,Dead.cost=40000,Alive.prob=.0990,Alive.cost=50000,high=100,p.payoff=1) {
return((Dead.prob * Dead.cost) + (Alive.prob * Alive.cost))
}
immediate.amput.EV()
It's supposed to output : (0.010 * 40000) + (0.990 * 50000) = 400 + 49500 = 49900
Instead it gives me: 5350
Could you please tell me why?
Thanks..
As Brian Hannays says: Change the definition of Alive.prob to 1-Dead.prob. A good programming habit is to try to avoid redundant (and then possibly conflicting) definitions...
function(Dead.prob=.010,Dead.cost=40000,Alive.prob=1-Dead.prob,Alive.cost=50000,high=100,p.payoff=1) {
return((Dead.prob * Dead.cost) + (Alive.prob * Alive.cost))
}
your math is wrong. In your comments, you added an extra 0
400 + 4950 NOT 49500
.01 *40000 =400 and .099*50000= 4950 and 400+4950 =5350
accept the answer or delete your question.
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
This question does not appear to be about a specific programming problem, a software algorithm, or software tools primarily used by programmers. If you believe the question would be on-topic on another Stack Exchange site, you can leave a comment to explain where the question may be able to be answered.
Closed 7 years ago.
Improve this question
Suppose I have an Arabic character hand-drawn in Thuluth font, as in:
http://arabicletters.info/wp-content/uploads/1.jpg
I was thinking of a way I can recreate the same shape but at a much greater height, whilst leaving the other characteristics intact (stroke width, thickness, the relation of where the curving starts to happen to the height) which then got me curious about a way of finding its mathematical representation and play with it until I can get what I want or any other shape for that matter. Is there a math sub-specialty that can help with this? and for this particular problem, can it be solved using programs like Adobe Illustrator or AutoCAD?
Forgive the noobness.
I don't think deduce is the right word.
You can get what you want if you add sufficient points and do Bezier spline fits to match the letters.
There might be a way to automate the process of adding points, but the "sufficient" criterion is tricky. And then you'd have to tell how to connect points with splines.
Sounds like you're trying to reproduce optical character recognition in Arabic.
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
This question does not appear to be about a specific programming problem, a software algorithm, or software tools primarily used by programmers. If you believe the question would be on-topic on another Stack Exchange site, you can leave a comment to explain where the question may be able to be answered.
Closed 8 years ago.
Improve this question
in model casio fx-82ms i must do some scientific calculations with logaritm functions but the calculator calculates all problem base of ten(10) but i need base of two.
anyone can help me?
Always remember, you may use the natural logarithm to solve for any base: i.e., for any arbitrary base b, the logarithm of x to the base b is: ln(x)/ln(b)
/Try it!
Convert between bases:
http://www.equationsheet.com/eqninfo/Equation-0043.html
You can convert a log of x in base a to log of x in base b, divide by the log of a in base b.
This could be better answered on the math site, but is easy enough to just answer here.