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 have a float number that I would like to display in a string way.
E.g.
0.33 should be displayed as 1/3
0.5 should be displayed as 1/2
How can I do it in objective-c with no switch? (as I could have 3/4, 2/5 etc)
There's no objective-c way to do this, you'll have to implemente it yourself and find an algorightm.
What about trying combinations of A/B where A,B from 0 to 10, until you reach the number?
Related
Closed. This question needs debugging details. It is not currently accepting answers.
Edit the question to include desired behavior, a specific problem or error, and the shortest code necessary to reproduce the problem. This will help others answer the question.
Closed 4 years ago.
Improve this question
I don't know what kind of algorithm it runs in the background but it seems that it cannot handle matrices which contain elements on the order of 10^-5.
It can handle upto 16 digits. Type:
format long;
a = 1.234567890123456;
in your MATLAB code or command window.
4 decimal places is the limit of format short.
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 5 years ago.
Improve this question
I am confused about a situation which is presented on the following slide:
Last sentences says that:
It is important to note that deterministic does not mean that
xt is non-random. What does this mean? If A and B are random variable, then x must be random right?
I think the point may be that nature may choose randomly among different paths, but once you know which path has been chosen you can predict future values of x_t on the path from past values x_{t-1}, etc. So e.g. nature may flip a coin to choose between the following two paths: x_t=0 for all t, and x_t=1 for all t. Then if you don't know the path, x_t is indeed random. But once you know x_{t-1}, you know x_t.
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
Closed 8 years ago.
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.
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
Improve this question
I've got a computer generated sha256 hash of which I need the original value.
I know the value is a random 64 character string of alphanumerical, lower and uppercase, numbers and underscores + dots.
Would it be possible in a reasonable amount of time to bruteforce this?
There are 64 possibilities in 64 positions giving a total or 64 to the power of 64 combinations which is 3.9402006196394479212279040100143613805079739270 × 10^115
So no. Even if you had every computer on earth working on it for 1,000,000 years you still wouldn't be close
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 11 years ago.
Improve this question
I need a list of Large Carmichael numbers( 10 to 100 digits ). Is there any website which provides such data. It would be more helpful if i can get a list of large odd composite numbers and primes as well.
Did you already try The On-Line Encyclopedia of Integer Sequences? Carmichael numbers are sequence A002997, and from there you can find a link to a Table of n, a(n) for n = 1..10000.
Here's the first 33: http://oeis.org/search?q=carmichael&language=english&go=Search.
This is generally a good site for sequences.
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
So, I'm attempting to access an array of length 165888. I'm looping through, calculating my index as I go. At one point, I get to 110689, and this, for some reason, throws the following error:
Attempted to access buf(110689); index must be a positive integer or logical.
Any ideas?
It was a rounding thing. I was doing a calculation, and forgetting to round.