Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
This question does not appear to be about programming within the scope defined in the help center.
Closed 6 years ago.
Improve this question
((A*55)/(A+1815))+4=B
eg.:
((1000*55)/(1000+1815))+4=23.53819
How can i calculate from
23.53819 1000?
A and B are variables.
Sry for my bad english ;)
Thanks any help!
Just follow the steps described before. The goal is to manipulate the expression to get all terms containing the variable to be solved for on one side.
You Have to First do what ever present in Brackets then Division, Multiplication and then Addition and Subtraction.
For any equation you have to follow the sequence.
Hope this helps
Related
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
This question does not appear to be about programming within the scope defined in the help center.
Closed 6 years ago.
Improve this question
I want to understand the physical significance of n raise to some decimal power.
Like when i say 2^5. I understand that it means 2 multiplied 5 times. But how do i analyse 2^0.1.
Please suggest.
2^0.1 is the tenth root of 2. For rational powers, x^(p/q)=(x^p)^(1/q) is a combination of powers and roots.
For general real numbers,
x^y = exp(log(x)*y).
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
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
Closed 8 years ago.
Improve this question
I have found this formula for computing Pi value:
But I need to compute only(for example - 1000th) number of Pi value. How I can do it with provided formula?
Thanks.
What you want is called a "spigot algorithm". Take a look at [1] in the section "BBP digit-extraction algorithm for pi". Good luck and have fun.
[1] http://en.wikipedia.org/wiki/Bailey%E2%80%93Borwein%E2%80%93Plouffe_formula
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
This question does not appear to be about programming within the scope defined in the help center.
Closed 9 years ago.
Improve this question
For my theory of computation class, we are supposed to do some review/practice problems to work off the rust and make sure we are ready for the course. Some of the problems are induction proofs. I did this at one time, but apparently it has completely escaped me. I've watched a couple tutorials, but still can't do problem 'a'. If anyone can walk me through the first problem I'm pretty sure I could figure out the second one on my own. Any help would be appreciated!
First verify it holds for n = 1.
Then assume it is true for n = x ( the sum of the first x squares ) and then try to compute the sum of the the first x + 1 squares. You know the result for the first x, you just add the last square to that sum. From there it should be easy.
And you posted on the wrong site.
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
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
Closed 9 years ago.
Improve this question
I'm a student just learning how to use R and thus far I've made a bit of progress. I'm snagging at a question which asks: For what values of i does Y equal 3?
the data set: c(3,5,2,3,5,4,4,2,3,5)
If I understand your question correctly, you want the index, i inside the data set (in this case, a vector) Y such that Y[i]=3?
Then you just need to use the which function. For more information, make sure you try reading the help files, which you can invoke using the command ?which or help(which)
Now, some code:
# Your data
Y <- c(3,5,2,3,5,4,4,2,3,5)
# Find the index where Y is equal to 3
which(Y==3, arr.ind=TRUE)
And welcome to SO. This is a pretty common question for beginners, so next time, make sure you Google or search around for a solution to elementary problems such as these. Have a good day.
Closed. This question is off-topic. It is not currently accepting answers.
Want to improve this question? Update the question so it's on-topic for Stack Overflow.
Closed 10 years ago.
Improve this question
I've never seen this notation for complexity: Õ(n).
It comes up in the context of learning in stochastic algorithms.
Anyone know this notation? You can't exactly google this...
EDIT: SOLVED
I think people have pointed out the right answer below. In my case Õ() is used to hide an exponential growth of a tree.
It is shorthand for O(g(n) log^k g(n))
Actually, you can google this!
It is a variant of big-O that ignores logarithmic factors. See this wikipedia entry, which I found simply by googling that character and looking at the top entry.