Welcome to the US government. How can we secretly piss you off today?

[Asher]

Every quant I'd ever had the displeasure of working with was an arrogant ******* who just followed other people's theories.

[KrazyHorse]

Define decent set of choices for parameters. Cross-reference your requirements with java.util.Random.

No, as I have never coded a line in java.

Just admit that you don't understand RNGs. There's no shame in it, Asher.

[KrazyHorse]

Every quant I'd ever had the displeasure of working with was an arrogant ******* who just followed other people's theories.

You misspelled "for".

It's no wonder they were arrogant. You probably tried to reseed their generators.

[Asher]

No, as I have never coded a line in java.

Just admit that you don't understand RNGs. There's no shame in it, Asher.

Here you go: http://download.oracle.com/javase/1.4.2/docs/api/java/util/Random.html

[Asher]

You misspelled "for"

I never worked for them. The quants got stuff when we had time only.

More often than not they were throwing tantrums to ask for more dev resources. Turns out quants can't code for ****.

[KrazyHorse]

God, this is fun....

[KrazyHorse]

I never worked for them. The quants got stuff when we had time only.

More often than not they were throwing tantrums to ask for more dev resources. Turns out quants can't code for ****.

Some can, some cannot. And I don't doubt you can code and design software better than most of them. And you certainly can better than I.

What you can't do is be trusted to work with numerical routines.

[Asher]

Quants were also the #1 offenders at attaching .BMP files to emails whenever there was a 6-word error popup on one of their screens.

As they had 3 1600x1200 monitors, these files were ****ing massive.

[Asher]

Okay, you're right.

Just whipped up a test app.

[Asher]

import java.util.Calendar;
import java.util.Random;

public class Poly 
{
	private static Random rng;
	private static int[] nums;
	
	public static void main(String[] args)
	{
		rng = new Random(Calendar.getInstance().getTimeInMillis());
		nums = new int[1000000];
		
		for(int i=0; i < 1000000; i++)
		{
			nums[i] = rng.nextInt(99) + 1;
			
			// excluded in one of the runs
			if((i % 6) == 0)
			{
				rng.setSeed(Calendar.getInstance().getTimeInMillis());
			}
		}
		
		System.out.println("Number of occurences:");
		for(int i=1; i <= 99; i++)
		{
			System.out.println(i + ": " + numOccurences(i));
		}
	}

	private static int numOccurences(int num)
	{
		int retVal = 0;
		for(int i=0; i < 1000000; i++)
		{
			if(nums[i] == num)
				retVal++;
		}
		return retVal;
	}
}

No re-seeding:

Number of occurences:
1: 9941
2: 10164
3: 9988
4: 10049
5: 9995
6: 10119
7: 10108
8: 10067
9: 10305
10: 10115
11: 10202
12: 10185
13: 10134
14: 10016
15: 10110
16: 10069
17: 10050
18: 10166
19: 10129
20: 9981
21: 10189
22: 10115
23: 10135
24: 10198
25: 10210
26: 9926
27: 10279
28: 9936
29: 10096
30: 10034
31: 10210
32: 10071
33: 10108
34: 10148
35: 10100
36: 10258
37: 10069
38: 10190
39: 9955
40: 10172
41: 10231
42: 10059
43: 9997
44: 10104
45: 10138
46: 10102
47: 10162
48: 9967
49: 10144
50: 9940
51: 10181
52: 10111
53: 10040
54: 10083
55: 9919
56: 10069
57: 10131
58: 9980
59: 10094
60: 10290
61: 9956
62: 10116
63: 10358
64: 10208
65: 10132
66: 10016
67: 10192
68: 10106
69: 10110
70: 10028
71: 10111
72: 10103
73: 10201
74: 10007
75: 10036
76: 10029
77: 10016
78: 10133
79: 10303
80: 10198
81: 10159
82: 9982
83: 10098
84: 9988
85: 10255
86: 10163
87: 10128
88: 10104
89: 10205
90: 10124
91: 9970
92: 9881
93: 9970
94: 9875
95: 10207
96: 9924
97: 10281
98: 10237
99: 10056

Re-seeding:

Number of occurences:
1: 37331
2: 0
3: 0
4: 1280
5: 1090
6: 1406
7: 0
8: 1176
9: 0
10: 31073
11: 1379
12: 0
13: 30167
14: 1176
15: 1379
16: 55493
17: 0
18: 7369
19: 1176
20: 191
21: 190
22: 0
23: 1371
24: 7559
25: 0
26: 1406
27: 0
28: 2827
29: 1371
30: 0
31: 0
32: 7369
33: 31073
34: 0
35: 0
36: 0
37: 0
38: 0
39: 190
40: 0
41: 0
42: 30168
43: 30167
44: 1379
45: 37331
46: 1379
47: 33900
48: 0
49: 0
50: 0
51: 4198
52: 0
53: 1406
54: 30168
55: 0
56: 88618
57: 0
58: 0
59: 1090
60: 0
61: 0
62: 51287
63: 0
64: 1176
65: 0
66: 2827
67: 0
68: 0
69: 0
70: 0
71: 0
72: 0
73: 2582
74: 0
75: 7369
76: 0
77: 31073
78: 31257
79: 37331
80: 1176
81: 1371
82: 51287
83: 37331
84: 0
85: 52666
86: 32444
87: 1406
88: 0
89: 0
90: 0
91: 83450
92: 32995
93: 0
94: 1371
95: 1280
96: 7369
97: 1406
98: 7369
99: 37331

I bow to your math wisdom.

[KrazyHorse]

Wow, didn't think it would be that bad.

[Asher]

Here's Java's SecureRandom. Looks better.

Number of occurences:
1: 9993
2: 10239
3: 10022
4: 10067
5: 10044
6: 10135
7: 10025
8: 10003
9: 10057
10: 10082
11: 10157
12: 10050
13: 10216
14: 10023
15: 10047
16: 10262
17: 9995
18: 10136
19: 9996
20: 10220
21: 10065
22: 10168
23: 10260
24: 10027
25: 9949
26: 10124
27: 10050
28: 10132
29: 10100
30: 10021
31: 10121
32: 10240
33: 10257
34: 10051
35: 10242
36: 10065
37: 10103
38: 10019
39: 10030
40: 10181
41: 10130
42: 10233
43: 10090
44: 10271
45: 10150
46: 10000
47: 10185
48: 10089
49: 10251
50: 10231
51: 10179
52: 10219
53: 10074
54: 10246
55: 10193
56: 10089
57: 9999
58: 10127
59: 10139
60: 9986
61: 10036
62: 10232
63: 10048
64: 10133
65: 10180
66: 10116
67: 10008
68: 10130
69: 10058
70: 10036
71: 10080
72: 10047
73: 10193
74: 9884
75: 10011
76: 10072
77: 10054
78: 9945
79: 10098
80: 10027
81: 9968
82: 10092
83: 10133
84: 10007
85: 9884
86: 10174
87: 10289
88: 10053
89: 10187
90: 10021
91: 10146
92: 9968
93: 9994
94: 10206
95: 10133
96: 10313
97: 10076
98: 9912
99: 10201

[Kuciwalker]

I hear you talking theory again. I don't see you testing your theory. Stop wasting time.

And java.util.Random is a LCG with a 48-bit seed, so you're in luck.

That's why I brought it up, Asher. I even mentioned it in the last thread...

[Kuciwalker]

Ah, I see the issue has been resolved properly

[Asher]

Now that the coding is done, you return.