static public boolean parsable(String root){
		//first check for the subscript and radical sign
		int i = 0;
		while(i < root.length() && Util.isSubscript(Character.toString(root.charAt(i)))) i++;
		//remove the subscript
		root = root.substring(i,root.length());
		//remove the radical sign, making sure not to throw and exception
		if(root.length() < 1 || root.charAt(0) != '√') return false;
		//remove the radical sign
		root = root.substring(1);
		//now make sure the rest is an expression that either has only one term
		//or has parentheses around it
		//if it's not the same after removing parentheses
		if (Util.removePar(root).equals(root)){
			return false;
		}
		//it has parentheses
		else {
			//if it's an algebraic particle
			return AlgebraicParticle.parsable(root, Root.class);
		}
		
	}