Kernel: SageMath (stable)
In [38]:
def HighestEntry(Matrix): List = sorted([Matrix[0,0],Matrix[0,1],Matrix[1,0],Matrix[1,1]]) return List[3] def LowestEntry(Matrix): List = sorted([Matrix[0,0],Matrix[0,1],Matrix[1,0],Matrix[1,1]]) return List[0]
In [46]:
count1 = 0 count2 = 0 for a in [-20..20]: A_1 = matrix(QQ,[[a+0,a+1],[a+2,a+3]]) A_2 = matrix(QQ,[[a+0,a+1],[a+3,a+2]]) A_3 = matrix(QQ,[[a+0,a+2],[a+1,a+3]]) A_4 = matrix(QQ,[[a+0,a+2],[a+3,a+1]]) A_5 = matrix(QQ,[[a+0,a+3],[a+1,a+2]]) A_6 = matrix(QQ,[[a+0,a+3],[a+2,a+1]]) A_7 = matrix(QQ,[[a+1,a+2],[a+3,a+0]]) A_8 = matrix(QQ,[[a+1,a+2],[a+0,a+3]]) A_9 = matrix(QQ,[[a+1,a+3],[a+2,a+0]]) A_10 = matrix(QQ,[[a+1,a+3],[a+0,a+2]]) A_11 = matrix(QQ,[[a+1,a+0],[a+2,a+3]]) A_12 = matrix(QQ,[[a+1,a+0],[a+3,a+2]]) A_13 = matrix(QQ,[[a+2,a+0],[a+1,a+3]]) A_14 = matrix(QQ,[[a+2,a+0],[a+3,a+1]]) A_15 = matrix(QQ,[[a+2,a+1],[a+0,a+3]]) A_16 = matrix(QQ,[[a+2,a+1],[a+3,a+0]]) A_17 = matrix(QQ,[[a+2,a+3],[a+1,a+0]]) A_18 = matrix(QQ,[[a+2,a+3],[a+0,a+1]]) A_19 = matrix(QQ,[[a+3,a+0],[a+2,a+1]]) A_20 = matrix(QQ,[[a+3,a+0],[a+1,a+2]]) A_21 = matrix(QQ,[[a+3,a+1],[a+2,a+0]]) A_22 = matrix(QQ,[[a+3,a+1],[a+0,a+2]]) A_23 = matrix(QQ,[[a+3,a+2],[a+1,a+0]]) A_24 = matrix(QQ,[[a+3,a+2],[a+0,a+1]]) A = [A_1,A_2,A_3,A_4,A_5,A_6,A_7,A_8,A_9,A_10,A_11,A_12,A_13,A_14,A_15,A_16,A_17,A_18,A_19,A_20,A_21,A_22,A_23,A_24] for b in [-20..20]: B_1 = matrix(QQ,[[b+0,b+1],[b+2,b+3]]) B_2 = matrix(QQ,[[b+0,b+1],[b+3,b+2]]) B_3 = matrix(QQ,[[b+0,b+2],[b+1,b+3]]) B_4 = matrix(QQ,[[b+0,b+2],[b+3,b+1]]) B_5 = matrix(QQ,[[b+0,b+3],[b+1,b+2]]) B_6 = matrix(QQ,[[b+0,b+3],[b+2,b+1]]) B_7 = matrix(QQ,[[b+1,b+2],[b+3,b+0]]) B_8 = matrix(QQ,[[b+1,b+2],[b+0,b+3]]) B_9 = matrix(QQ,[[b+1,b+3],[b+2,b+0]]) B_10 = matrix(QQ,[[b+1,b+3],[b+0,b+2]]) B_11 = matrix(QQ,[[b+1,b+0],[b+2,b+3]]) B_12 = matrix(QQ,[[b+1,b+0],[b+3,b+2]]) B_13 = matrix(QQ,[[b+2,b+0],[b+1,b+3]]) B_14 = matrix(QQ,[[b+2,b+0],[b+3,b+1]]) B_15 = matrix(QQ,[[b+2,b+1],[b+0,b+3]]) B_16 = matrix(QQ,[[b+2,b+1],[b+3,b+0]]) B_17 = matrix(QQ,[[b+2,b+3],[b+1,b+0]]) B_18 = matrix(QQ,[[b+2,b+3],[b+0,b+1]]) B_19 = matrix(QQ,[[b+3,b+0],[b+2,b+1]]) B_20 = matrix(QQ,[[b+3,b+0],[b+1,b+2]]) B_21 = matrix(QQ,[[b+3,b+1],[b+2,b+0]]) B_22 = matrix(QQ,[[b+3,b+1],[b+0,b+2]]) B_23 = matrix(QQ,[[b+3,b+2],[b+1,b+0]]) B_24 = matrix(QQ,[[b+3,b+2],[b+0,b+1]]) B=[B_1,B_2,B_3,B_4,B_5,B_6,B_7,B_8,B_9,B_10,B_11,B_12,B_13,B_14,B_15,B_16,B_17,B_18,B_19,B_20,B_21,B_22,B_23,B_24] for i in [0..23]: for j in [0..23]: C = A[i]*B[j] C_List = sorted([C[0,0], C[0,1], C[1,0], C[1,1]]) count1 = count1 + 1 if (C_List[0] +1 == C_List[1]) and (C_List[1] +1 == C_List[2]) and (C_List[2] +1 == C_List[3]): count2 = count2 + 1 show(count2,'.........',A[i],B[j],'=',C)
WARNING: Some output was deleted.
In [40]:
show(count1) show(count2) show(RR(count2/count1))
In [0]:
lowestInA = LowestEntry(A[i]) lowestInB = LowestEntry(B[j]) highestInA = HighestEntry(A[i]) highestInB = HighestEntry(B[j]) if Alowest > lowestInA: count2 = count2 + 1 show(count2,'.........',A[i],B[j],'=',C) Alowest = lowestInA if Blowest > lowestInB: count2 = count2 + 1 show(count2,'.........',A[i],B[j],'=',C) Blowest = lowestInB if Ahighest < highestInA: count2 = count2 + 1 show(count2,'.........',A[i],B[j],'=',C) Alowest = lowestInA if Bhighest < lowestInB:
In [0]: