Guest Zero Posted May 27, 2004 Posted May 27, 2004 what? Share this post Link to post Share on other sites More sharing options...
RGone Posted May 27, 2004 Posted May 27, 2004 ...said it is a lot when doing statistical probabilities. RGone... Share this post Link to post Share on other sites More sharing options...
MasterAtArms Posted May 27, 2004 Posted May 27, 2004 I know this. 2^n - give the number of possible combinations when using binary (2 is from the fact that binary digits can only be a 0 or a 1) ^ - this means to the power of 1000 = 1 * 10^3 = 1^3 So for a two digit binary code: 2^2 = 4 00 01 10 11 For a three digit binary code: 2^3 = 8 000 001 010 011 100 101 110 111 For the alpha timings, not binary but a digit of 10 possible values (0-9) and 7 alpha timings 10^7 = 10 000 000:nod: So to make form any possible plan to logically test these settings requires a knowledge of how the nforce2 chip uses these timings. An exhaustive test would be lludicrous. Share this post Link to post Share on other sites More sharing options...
Guest Zero Posted May 27, 2004 Posted May 27, 2004 but, for every NUMERICAL timing, lower is suposed to be faster? Share this post Link to post Share on other sites More sharing options...
Recommended Posts
Please sign in to comment
You will be able to leave a comment after signing in
Sign In Now