Closed. This question is not reproducible or was caused by typos. It is not currently accepting answers.
This question was caused by a typo or a problem that can no longer be reproduced. While similar questions may be on-topic here, this one was resolved in a way less likely to help future readers.
Closed 11 months ago.
Improve this question
I'm a bit confused with this simple MATLAB script.
If n = 480 , 1/n should be 0.0020833. How is len_F1 325.63?
Am i missing something here? MATLAB version 2020b
I think that's a lowercase L not a 1. You have defined lowercase L means l somewhere.
Related
Closed. This question needs to be more focused. It is not currently accepting answers.
Want to improve this question? Update the question so it focuses on one problem only by editing this post.
Closed 8 years ago.
Improve this question
How should I solve my equations in Perl?
I know binary search is one solution (and perhaps pretty fast for my equations) but I would like to know if there is a ready to use solutions such as math packages or libraries so that I can use them instead of implementing my own solver?
NOTE:
This is, find x for a given y.
The functions are strictly increasing
The equations usually look like: y = a + b*sqrt(x) + b*x or y = sqrt(a*(x-b)**2*(x-c)/(x-d))
Please don't complain that "this is off topic" or "you should ask this in http://math.stackexchange.com". I want to see this problem from the programming point of view, particularly in Perl!
Have you considered using libraries? There's Math::LP, for instance.
See the Perl and Math tutorial from PerlMonks for more info.
Search for symbolic math on MetaCPAN. Lots of interesting looking options.
https://metacpan.org/search?q=symbolic+math
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 10 years ago.
Improve this question
I was doing this question of boolean algebra, Simplify f=Σ(8,12,13,14)+dΣ(3,7,9,10) using karnaugh map.. can anyone please tell me what is d in this question? I know its a stupid question but i couldn't find it on google. And please tell me what this question means? i mean like straight away simplifying without the d expression is okay but what does the d expression signify in here ?
d stands for 'don't care'. Cells 3,7,8,10 do not affect the value of F.
This helps because you might be able to get a simpler expression if you ignore those cells.
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.