' Generates Prime Number Bordered Magic Squares of order 7
' Optimized for Sophie Germain Primes
' Tested with Office 2007 under Windows 7
Sub Priem7a2()
Dim a1(2448), a(169), a7(100), b1(50000), b(50000), c(100)
y = MsgBox("Locked", vbCritical, "Routine Priem7a2")
End
Sheets("Klad1").Select
n5 = 0: n9 = 0: k1 = 1: k2 = 1
ShtNm1 = "Pairs1"
ShtNm2 = "Lines5"
t1 = Timer
For j100 = 2 To 81
' Start Reading Data ShtNm2
Rcrd1a = Sheets(ShtNm2).Cells(j100, 27).Value
MC5 = Sheets(ShtNm2).Cells(j100, 26).Value
' Read Prime Numbers From Sheet ShtNm1
Pr3 = Sheets(ShtNm1).Cells(Rcrd1a, 1).Value 'PairSum
Cntr3 = Pr3 / 2
s3 = 3 * Cntr3 'MC3
s4 = 2 * Pr3 'MC4
s5 = 5 * Cntr3 'MC5
s1 = 7 * Cntr3 'MC7
nVar = Sheets(ShtNm1).Cells(Rcrd1a, 9).Value
If nVar < 49 Then GoTo 1000
If MC5 <> s5 Then
y = MsgBox("Conflict in Data", vbCritical, "Read " + ShtNm2)
End
End If
Erase b1
For j1 = 1 To nVar
x = Sheets(ShtNm1).Cells(Rcrd1a, 9 + j1).Value
b1(x) = x
Next j1
pMax = Sheets(ShtNm1).Cells(Rcrd1a, 9 + nVar).Value
' Read Concentric Square 5 x 5
For i1 = 1 To 25
a(i1) = Sheets(ShtNm2).Cells(j100, i1).Value
Next i1
n32 = 25: GoSub 950 'Remove used primes from available primes
Erase a7
a7(9) = a(1): a7(10) = a(2): a7(11) = a(3): a7(12) = a(4): a7(13) = a(5):
a7(16) = a(6): a7(17) = a(7): a7(18) = a(8): a7(19) = a(9): a7(20) = a(10):
a7(23) = a(11): a7(24) = a(12): a7(25) = a(13): a7(26) = a(14): a7(27) = a(15):
a7(30) = a(16): a7(31) = a(17): a7(32) = a(18): a7(33) = a(19): a7(34) = a(20):
a7(37) = a(21): a7(38) = a(22): a7(39) = a(23): a7(40) = a(24): a7(41) = a(25):
Erase a
' Restore available pairs in a1()
n10 = 0
For j1 = 1 To pMax
If b1(j1) <> 0 Then
n10 = n10 + 1
a1(n10) = b1(j1)
End If
Next j1
m1 = 1: m2 = n10: n10 = 0
If m2 < 24 Then GoTo 1000
' Generate Border
For j1 = m1 To m2
If b1(a1(j1)) = 0 Then GoTo 10
If b(a1(j1)) = 0 Then b(a1(j1)) = a1(j1): c(1) = a1(j1) Else GoTo 10
a(1) = a1(j1)
a(5) = Pr3 - a(1): If b(a(5)) = 0 Then b(a(5)) = a(5): c(5) = a(5) Else GoTo 50
For j2 = m1 To m2
If b1(a1(j2)) = 0 Then GoTo 20
If b(a1(j2)) = 0 Then b(a1(j2)) = a1(j2): c(2) = a1(j2) Else GoTo 20
a(2) = a1(j2)
a(6) = Pr3 - a(2): If b(a(6)) = 0 Then b(a(6)) = a(6): c(6) = a(6) Else GoTo 60
For j3 = m1 To m2
If b1(a1(j3)) = 0 Then GoTo 30
If b(a1(j3)) = 0 Then b(a1(j3)) = a1(j3): c(3) = a1(j3) Else GoTo 30
a(3) = a1(j3)
a(7) = Pr3 - a(3): If b(a(7)) = 0 Then b(a(7)) = a(7): c(7) = a(7) Else GoTo 70
a(4) = s4 - a(3) - a(2) - a(1)
If a(4) < a1(m1) Or a(4) > a1(m2) Then GoTo 40:
If b1(a(4)) = 0 Then GoTo 40
If b(a(4)) = 0 Then b(a(4)) = a(4): c(4) = a(4) Else GoTo 40
a(8) = Pr3 - a(4): If b(a(8)) = 0 Then b(a(8)) = a(8): c(8) = a(8) Else GoTo 80
For j9 = m1 To m2
If b1(a1(j9)) = 0 Then GoTo 90
If b(a1(j9)) = 0 Then b(a1(j9)) = a1(j9): c(9) = a1(j9) Else GoTo 90
a(9) = a1(j9)
a(12) = Pr3 - a(9): If b(a(12)) = 0 Then b(a(12)) = a(12): c(12) = a(12) Else GoTo 120
For j10 = m1 To m2
If b1(a1(j10)) = 0 Then GoTo 100
If b(a1(j10)) = 0 Then b(a1(j10)) = a1(j10): c(10) = a1(j10) Else GoTo 100
a(10) = a1(j10)
a(13) = Pr3 - a(10): If b(a(13)) = 0 Then b(a(13)) = a(13): c(13) = a(13) Else GoTo 130
a(11) = s4 - a(10) - a(9) - a(1)
If a(11) < a1(m1) Or a(11) > a1(m2) Then GoTo 110:
If b1(a(11)) = 0 Then GoTo 110
If b(a(11)) = 0 Then b(a(11)) = a(11): c(11) = a(11) Else GoTo 110
a(14) = Pr3 - a(11): If b(a(14)) = 0 Then b(a(14)) = a(14): c(14) = a(14) Else GoTo 140
a7(4) = a(4): a7(5) = a(3): a7(6) = a(2): a7(7) = a(1):
a7(43) = a(5): a7(46) = a(8): a7(47) = a(7): a7(48) = a(6):
a7(8) = a(12): a7(14) = a(9):
a7(15) = a(13): a7(21) = a(10):
a7(22) = a(14): a7(28) = a(11):
GoSub 2000 'Complete Border with remaining segments (3 x 1)
If fl1 = 1 Then Erase b1, b, c: GoTo 1000 'Print only one solution
b(c(14)) = 0: c(14) = 0
140 b(c(11)) = 0: c(11) = 0
110 b(c(13)) = 0: c(13) = 0
130 b(c(10)) = 0: c(10) = 0
100 Next j10
b(c(12)) = 0: c(12) = 0
120 b(c(9)) = 0: c(9) = 0
90 Next j9
b(c(8)) = 0: c(8) = 0
80 b(c(4)) = 0: c(4) = 0
40 b(c(7)) = 0: c(7) = 0
70 b(c(3)) = 0: c(3) = 0
30 Next j3
b(c(6)) = 0: c(6) = 0
60 b(c(2)) = 0: c(2) = 0
20 Next j2
b(c(5)) = 0: c(5) = 0
50 b(c(1)) = 0: c(1) = 0
10 Next j1
Erase b1, b, c
1000 Next j100
t2 = Timer
t10 = Str(t2 - t1) + " sec., " + Str(n9) + " Solutions"
y = MsgBox(t10, 0, "Routine Priem7a2")
End
' Complete Border with remaining segments (3 x 1)
2000 fl1 = 1
For j15 = m1 To m2
If b1(a1(j15)) = 0 Then GoTo 150
If b(a1(j15)) = 0 Then b(a1(j15)) = a1(j15): c(15) = a1(j15) Else GoTo 150
a(15) = a1(j15)
a(18) = Pr3 - a(15): If b(a(18)) = 0 Then b(a(18)) = a(18): c(18) = a(18) Else GoTo 180
For j16 = m1 To m2
If b1(a1(j16)) = 0 Then GoTo 160
If b(a1(j16)) = 0 Then b(a1(j16)) = a1(j16): c(16) = a1(j16) Else GoTo 160
a(16) = a1(j16)
a(19) = Pr3 - a(16): If b(a(19)) = 0 Then b(a(19)) = a(19): c(19) = a(19) Else GoTo 190
a(17) = s3 - a(16) - a(15)
If a(17) < a1(m1) Or a(17) > a1(m2) Then GoTo 170:
If b1(a(17)) = 0 Then GoTo 170
If b(a(17)) = 0 Then b(a(17)) = a(17): c(17) = a(17) Else GoTo 170
a(20) = Pr3 - a(17): If b(a(20)) = 0 Then b(a(20)) = a(20): c(20) = a(20) Else GoTo 200
For j21 = m1 To m2
If b1(a1(j21)) = 0 Then GoTo 210
If b(a1(j21)) = 0 Then b(a1(j21)) = a1(j21): c(21) = a1(j21) Else GoTo 210
a(21) = a1(j21)
a(23) = Pr3 - a(21): If b(a(23)) = 0 Then b(a(23)) = a(23): c(23) = a(23) Else GoTo 230
a(22) = s3 - a(21) - a(20)
If a(22) < a1(m1) Or a(22) > a1(m2) Then GoTo 220:
If b1(a(22)) = 0 Then GoTo 220
If b(a(22)) = 0 Then b(a(22)) = a(22): c(22) = a(22) Else GoTo 220
a(24) = Pr3 - a(22): If b(a(24)) = 0 Then b(a(24)) = a(24): c(24) = a(24) Else GoTo 240
a7(1) = a(17): a7(2) = a(16): a7(3) = a(15):
a7(44) = a(19): a7(45) = a(18): a7(49) = a(20):
a7(29) = a(24): a7(35) = a(22):
a7(36) = a(23): a7(42) = a(21):
GoSub 800: 'Back Check Identical Numbers a10()
If fl1 = 1 Then
n9 = n9 + 1: GoSub 2650 'Print results (squares)
' n9 = n9 + 1: GoSub 2645 'Print results (lines)
End If
Return
b(c(24)) = 0: c(24) = 0
240 b(c(22)) = 0: c(22) = 0
220 b(c(23)) = 0: c(23) = 0
230 b(c(21)) = 0: c(21) = 0
210 Next j21
b(c(20)) = 0: c(20) = 0
200 b(c(17)) = 0: c(17) = 0
170 b(c(19)) = 0: c(19) = 0
190 b(c(16)) = 0: c(16) = 0
160 Next j16
b(c(18)) = 0: c(18) = 0
180 b(c(15)) = 0: c(15) = 0
150 Next j15
fl1 = 0
Return
' Double Check Identical Numbers a7()
800 fl1 = 1
For i1 = 1 To 49
a20 = a7(i1): If a20 = 0 Then GoTo 810
For i2 = (1 + i1) To 49
If a20 = a7(i2) Then fl1 = 0: Return
Next i2
810 Next i1
Return
' Remove used pairs from b1()
950 For i1 = 1 To n32
b1(a(i1)) = 0
b1(Pr3 - a(i1)) = 0
Next i1
Return
' Print results (selected numbers)
2645 For i1 = 1 To 49
Cells(n9, i1).Value = a7(i1)
Next i1
Cells(n9, 50).Select
Cells(n9, 50).Value = s1
Cells(n9, 51).Value = Rcrd1a
Return
' Print results (squares)
2650 n2 = n2 + 1
If n2 = 3 Then
n2 = 1: k1 = k1 + 8: k2 = 1
Else
If n9 > 1 Then k2 = k2 + 8
End If
Cells(k1, k2 + 1).Select
Cells(k1, k2 + 1).Font.Color = -4165632
Cells(k1, k2 + 1).Value = "MC = " + CStr(s1)
i3 = 0
For i1 = 1 To 7
For i2 = 1 To 7
i3 = i3 + 1
Cells(k1 + i1, k2 + i2).Value = a7(i3)
Next i2
Next i1
Return
End Sub
