question: public void testCase9 ( ) { byte aBytes [ ] = { 1 , 100 , 56 , 7 , 98 , - 1 , 39 , - 128 , 127 , 5 , 6 , 7 , 8 , 9 } ; byte bBytes [ ] = { 15 , 48 , - 29 , 7 , 98 , - 1 , 39 , - 128 } ; int aSign = - 1 ; int bSign = 1 ; byte rBytes [ ] = { - 24 , - 116 , - 12 , - 79 , - 36 , 11 } ; BigInteger aNumber = new BigInteger ( aSign , aBytes ) ; BigInteger bNumber = new BigInteger ( bSign , bBytes ) ; BigInteger result = aNumber . divide ( bNumber ) ; byte resBytes [ ] = new byte [ rBytes . length ] ; resBytes = result . toByteArray ( ) ; for ( int i = 0 ; i < resBytes . length ; i ++ ) { assertTrue ( resBytes [ i ] == rBytes [ i ] ) ; } assertEquals ( "incorrect sign" , - 1 , result . signum ( ) ) ; }
target:  Divide a negative number by a positive one.