LongSequence function ( long arg0 ) { LongSequence loc0 = new LongSequence ( ) ; for ( long loc1 = 1 , loc2 = ( long ) Math . sqrt ( arg0 ) ; loc1 <= loc2 ; loc1 ++ ) { if ( arg0 % loc1 == 0 ) { loc0 . add ( loc1 ) ; if ( loc1 * loc1 != arg0 ) loc0 . add ( arg0 / loc1 ) ; } } loc0 . sort ( ) ; return loc0 ; }
list all divisors of a number in ascending order concode_field_sep int[] diff concode_field_sep int gcdInt concode_elem_sep long gcdLong concode_elem_sep int findDivisor concode_elem_sep long findDivisor concode_elem_sep long lcmLong concode_elem_sep int lcm concode_elem_sep long lcm concode_elem_sep boolean isAbundant concode_elem_sep int lcmInt concode_elem_sep boolean isPerfect concode_elem_sep int gcd concode_elem_sep long gcd concode_elem_sep int sum concode_elem_sep long sum concode_elem_sep boolean isDeficient