busy,busy,busy...

could someone help me out?
i need a sub written up that will take a 2 dimensional matrix of user defined data {2 integers representing fractions}, build a new matrix from the rows that contain only those elements where the denominators are 3, then simultaneously solveing that matrix to determine the most minimal set of equations that require the sequence of integer elements to be divisible by 3.

I'll be in the MAC room working on 27 xerox jobs. Get me when its ready.

:wave:
-Lou

All you matricies are belong to us.

Quote:

---

Originally posted by Something Else
could someone help me out?
i need a sub written up that will take a 2 dimensional matrix of user defined data {2 integers representing fractions}, build a new matrix from the rows that contain only those elements where the denominators are 3, then simultaneously solveing that matrix to determine the most minimal set of equations that require the sequence of integer elements to be divisible by 3.

I'll be in the MAC room working on 27 xerox jobs. Get me when its ready.

:wave:
-Lou

---

Yes.

trying out a progrm to determine which jobs get printed first?

How's This:

VB Code:

_____________FIN SOLS___________
c_0 ::  + c_0 - F_0
c_1 ::  Control
c_2 ::  Control
c_3 ::  Control
c_4 ::  Control
c_5 ::  + c_1 + c_3 + c_5 - sf_1
c_6 ::  + c_2 + c_4 + c_6 + sf_1 + 2*F_0 - T
c_7 ::  + c_4 + c_7 + (1/3)*sf_1 - (1/3)*sf_3 + (2/3)*F_0 - (1/3)*T
c_8 ::  + c_1 + c_3 - c_4 + c_8 - sf_1 - F_0
c_9 ::  - c_1 - c_3 + c_9 + (2/3)*sf_1 + (1/3)*sf_3 + (1/3)*F_0 - (2/3)*T
c_10 ::  + c_1 + c_2 + c_3 + c_4 + c_10 + F_0 - T
c_11 ::  - c_2 - c_4 + c_11 - (2/3)*sf_1 - (1/3)*sf_3 - (4/3)*F_0 + (2/3)*T
c_12 ::  - c_1 + c_2 + c_4 + c_12 + sf_1 + F_0 - T
c_13 ::  + c_1 + c_13 - (1/3)*sf_1 + (1/3)*sf_3 + (1/3)*F_0 - (2/3)*T
c_14 ::  - c_1 - c_2 + c_14 - F_0
c_15 ::  + c_2 + c_15 + (1/3)*sf_1 - (1/3)*sf_3 + (2/3)*F_0 - (1/3)*T
c_16 ::  - c_2 - c_3 + c_16 - F_0
c_17 ::  + c_3 + c_17 - (1/3)*sf_1 + (1/3)*sf_3 + (1/3)*F_0 - (2/3)*T
c_18 ::  - c_3 - c_4 + c_18 - F_0
sf_0 ::  + sf_0 - F_0
sf_1 ::  Control
sf_2 ::  + sf_1 + sf_2 + 2*F_0 - T
sf_3 ::  Control
sf_4 ::  + sf_3 + sf_4 + F_0 - 2*T
sf_5 ::  + sf_5 - F_0 - T
sf_6 ::  + sf_6 - F_0 - T
F_0 ::  Control
F_1 ::  + 2*F_0 + F_1 - T
F_2 ::  + F_0 + F_2 - 2*T
F_3 ::  - 2*F_0 + F_3 - 2*T
T ::  Control

becomes a more manageable

VB Code:

_____________DIV_3_SOLS___________
sf_1 ::  + sf_1 - sf_3 - F_0 - T
    
 
Now, substitute  {+ sf_1 - sf_3 - F_0 - T + 3*PHI(1) = 0} into final sols:::
 
_____________TRULY_FINAL_SOLUTIONS___________
c_0 ::  + c_0 - F_0
c_1 ::  Control
c_2 ::  Control
c_3 ::  Control
c_4 ::  Control
c_5 ::  + c_1 + c_3 + c_5 - sf_3 - F_0 - T + 3*PHI(1)
c_6 ::  + c_2 + c_4 + c_6 + sf_3 + 3*F_0 - 3*PHI(1)
c_7 ::  + c_4 + c_7 + F_0 - PHI(1)
c_8 ::  + c_1 + c_3 - c_4 + c_8 - sf_3 - 2*F_0 - T + 3*PHI(1)
c_9 ::  - c_1 - c_3 + c_9 + sf_3 + F_0 - 2*PHI(1)
c_10 ::  + c_1 + c_2 + c_3 + c_4 + c_10 + F_0 - T
c_11 ::  - c_2 - c_4 + c_11 - sf_3 - 2*F_0 + 2*PHI(1)
c_12 ::  - c_1 + c_2 + c_4 + c_12 + sf_3 + 2*F_0 - 3*PHI(1)
c_13 ::  + c_1 + c_13 - T + PHI(1)
c_14 ::  - c_1 - c_2 + c_14 - F_0
c_15 ::  + c_2 + c_15 + F_0 - PHI(1)
c_16 ::  - c_2 - c_3 + c_16 - F_0
c_17 ::  + c_3 + c_17 - T + PHI(1)
c_18 ::  - c_3 - c_4 + c_18 - F_0
sf_0 ::  + sf_0 - F_0
sf_1 ::  + sf_1 - sf_3 - F_0 - T + 3*PHI(1)
sf_2 ::  + sf_2 + sf_3 + 3*F_0 - 3*PHI(1)
sf_3 ::  Control
sf_4 ::  + sf_3 + sf_4 + F_0 - 2*T
sf_5 ::  + sf_5 - F_0 - T
sf_6 ::  + sf_6 - F_0 - T
F_0 ::  Control
F_1 ::  + 2*F_0 + F_1 - T
F_2 ::  + F_0 + F_2 - 2*T
F_3 ::  - 2*F_0 + F_3 - 2*T
T ::  Control

:)

Quote:

---

Originally posted by Something Else
How's This:

VB Code:

_____________FIN SOLS___________
c_0 ::  + c_0 - F_0
c_1 ::  Control
c_2 ::  Control
c_3 ::  Control
c_4 ::  Control
c_5 ::  + c_1 + c_3 + c_5 - sf_1
c_6 ::  + c_2 + c_4 + c_6 + sf_1 + 2*F_0 - T
c_7 ::  + c_4 + c_7 + (1/3)*sf_1 - (1/3)*sf_3 + (2/3)*F_0 - (1/3)*T
c_8 ::  + c_1 + c_3 - c_4 + c_8 - sf_1 - F_0
c_9 ::  - c_1 - c_3 + c_9 + (2/3)*sf_1 + (1/3)*sf_3 + (1/3)*F_0 - (2/3)*T
c_10 ::  + c_1 + c_2 + c_3 + c_4 + c_10 + F_0 - T
c_11 ::  - c_2 - c_4 + c_11 - (2/3)*sf_1 - (1/3)*sf_3 - (4/3)*F_0 + (2/3)*T
c_12 ::  - c_1 + c_2 + c_4 + c_12 + sf_1 + F_0 - T
c_13 ::  + c_1 + c_13 - (1/3)*sf_1 + (1/3)*sf_3 + (1/3)*F_0 - (2/3)*T
c_14 ::  - c_1 - c_2 + c_14 - F_0
c_15 ::  + c_2 + c_15 + (1/3)*sf_1 - (1/3)*sf_3 + (2/3)*F_0 - (1/3)*T
c_16 ::  - c_2 - c_3 + c_16 - F_0
c_17 ::  + c_3 + c_17 - (1/3)*sf_1 + (1/3)*sf_3 + (1/3)*F_0 - (2/3)*T
c_18 ::  - c_3 - c_4 + c_18 - F_0
sf_0 ::  + sf_0 - F_0
sf_1 ::  Control
sf_2 ::  + sf_1 + sf_2 + 2*F_0 - T
sf_3 ::  Control
sf_4 ::  + sf_3 + sf_4 + F_0 - 2*T
sf_5 ::  + sf_5 - F_0 - T
sf_6 ::  + sf_6 - F_0 - T
F_0 ::  Control
F_1 ::  + 2*F_0 + F_1 - T
F_2 ::  + F_0 + F_2 - 2*T
F_3 ::  - 2*F_0 + F_3 - 2*T
T ::  Control

becomes a more manageable

VB Code:

_____________DIV_3_SOLS___________
sf_1 ::  + sf_1 - sf_3 - F_0 - T
    
 
Now, substitute  {+ sf_1 - sf_3 - F_0 - T + 3*PHI(1) = 0} into final sols:::
 
_____________TRULY_FINAL_SOLUTIONS___________
c_0 ::  + c_0 - F_0
c_1 ::  Control
c_2 ::  Control
c_3 ::  Control
c_4 ::  Control
c_5 ::  + c_1 + c_3 + c_5 - sf_3 - F_0 - T + 3*PHI(1)
c_6 ::  + c_2 + c_4 + c_6 + sf_3 + 3*F_0 - 3*PHI(1)
c_7 ::  + c_4 + c_7 + F_0 - PHI(1)
c_8 ::  + c_1 + c_3 - c_4 + c_8 - sf_3 - 2*F_0 - T + 3*PHI(1)
c_9 ::  - c_1 - c_3 + c_9 + sf_3 + F_0 - 2*PHI(1)
c_10 ::  + c_1 + c_2 + c_3 + c_4 + c_10 + F_0 - T
c_11 ::  - c_2 - c_4 + c_11 - sf_3 - 2*F_0 + 2*PHI(1)
c_12 ::  - c_1 + c_2 + c_4 + c_12 + sf_3 + 2*F_0 - 3*PHI(1)
c_13 ::  + c_1 + c_13 - T + PHI(1)
c_14 ::  - c_1 - c_2 + c_14 - F_0
c_15 ::  + c_2 + c_15 + F_0 - PHI(1)
c_16 ::  - c_2 - c_3 + c_16 - F_0
c_17 ::  + c_3 + c_17 - T + PHI(1)
c_18 ::  - c_3 - c_4 + c_18 - F_0
sf_0 ::  + sf_0 - F_0
sf_1 ::  + sf_1 - sf_3 - F_0 - T + 3*PHI(1)
sf_2 ::  + sf_2 + sf_3 + 3*F_0 - 3*PHI(1)
sf_3 ::  Control
sf_4 ::  + sf_3 + sf_4 + F_0 - 2*T
sf_5 ::  + sf_5 - F_0 - T
sf_6 ::  + sf_6 - F_0 - T
F_0 ::  Control
F_1 ::  + 2*F_0 + F_1 - T
F_2 ::  + F_0 + F_2 - 2*T
F_3 ::  - 2*F_0 + F_3 - 2*T
T ::  Control

:)

---

Yes.