C#

int[,] result = new int[2,array.GetLength(0)/2];
for (int i = 0; i < array.GetLength(0); i++)
{
   result[i&1,i/2] = array[1,i];
}

List<int> temp = new List<int>;
foreach (int i in array)
   temp.Add(i);
int[,] result = new int[2,tmp.Count/2];
for (int i = 0; i < temp.Count; i++)
  result[i&1,i/2] = temp[i];

List<int[]> temp = new List<int[]>();
for (int i = 0; i < array.GetLength(1); i++)
{
   if (array[0,i] != 1)
      temp.Add(new int[] { array[0,i], array[1,i] });
}
int[,] result = new int[2,temp.Count];
for (int i = 0; i < temp.Count; i++)
{
   result[0,i/2] = temp[i][0];
   result[1,i/2] = temp[i][1];
}

harold aptroot wrote:

There is no opportunity to divide by zero

//original = the original 2D array
//numberToRemove = the number to look for to remove entries, in your case should be 1
int[,] RemoveEntries(int[,] original, int numberToRemove)
{
    System.Collections.ObjectModel.Collection<int> newVals = new System.Collections.ObjectModel.Collection<int>();

for(int i = 0; i < orignal.GetLength(0); i++)
{
  if(original[i, 0] != numberToRemove)
  {
    newVals.Add(original[i, 0]);
    newVals.Add(original[i, 1]);
  }
}

int[,] result = new int[newVals.Length/2, 2];
int count = 0;
for(int i = 0; i < newVals.length; i+=2)
{
   result[count, 0] = newVals[i];
   result[count, 1] = newVals[i+1];
   count++;
}

return result;
}</int></int>