Necessary but insufficient

It would help. It would more than help; I have a hard time imagining them being functional without it. The necklace of natural attacks or scorpion kama are generally necessary for Monks. That said, the necklace of natural attacks does exist (as do similar items in Pathfinder), and it&rsquo;s not nearly enough to make the Monks good.

The Monk&rsquo;s problems are problems of design: the people who wrote it evidently had no clear idea of what a Monk was or should do. Thus it receives a mish-mash of random abilities that do not synergize (and frequently contradict one another, see Flurry of Blows and Fast Movement).

To &ldquo;fix&rdquo; the Monk, one must first come up with a clear vision of what the Monk is supposed to be and do, and then most likely rebuild it from the ground up focused on that vision.

Or simply use one of the many classes that can effectively model one or more possible visions of what a &ldquo;monk&rdquo; should do, without any levels in the &ldquo;Monk&rdquo; class. The Cleric and Psychic Warrior are both Open Game Content and quite capable of fulfilling most roles you could imagine for the Monk, for instance. I&rsquo;d argue that it&rsquo;s entirely reasonable to treat a Barbarian&rsquo;s Rage as &ldquo;Zen Focus&rdquo; and waive the non-lawful requirement (which I&rsquo;d further argue is dumb to begin with). Such a &ldquo;Barbarian&rdquo; multiclassed with Fighter for combat maneuver mastery and perhaps taking Improved Unarmed Strike would make a decent monk. And if you have Tome of Battle, the Swordsage also does an excellent job.

Would magic 'weapons' make the monk more balanced?
I created an array called numbers that will store values of a Fibonacci sequence. 1, 2, 3, 5, etc. 
The problem is that when I try to call the array value at a very high index value, the array value becomes negative. 

numbers[10] = 144 


which is reasonable but 

numbers[9999998] = -1448735941


Any help?

public static void main(String[] args) {

    int[] numbers = new int[10000000];

    numbers[0] = 1;
    numbers[1] = 2;

    for(int x = 2; x&lt;=numbers.length-1; x++)
    {
        numbers[x] = numbers[x-1] + numbers[x-2];
    }

    System.out.println(numbers[9999998]);
    System.out.println(numbers[10]);

