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
Related
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.
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
I need to print reports and I'm not able to fit the report in the page. I'm not sure about the units used. I know the default values are width 595 and height 842, but i don't know in what units are this magnitudes. Can someone help me on this or tell me what numbers should I use for Letter, Legal and A4 ??
I've seen those units before in applications like Illustrator and they are in pixels or points. either one yields the same number as far as I've seen.
Letter: 612 pt x 792 pt (w x h)
Legal: 612 pt x 1008 pt
A4: 595.28 pt x 841.89 pt
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?
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.