Let a and be be integers that are not both zero and let d be their greatest common divisor. Prove...?

D has all the smaller prime power factors of a and be M has all the larger ones. Together, DM = ab, so DM divides ab (you get 1).

I cant really gove you an answer,but what I can give you is a way to a solution, that is you have to find the anglde that you relate to or peaks your interest. A good paper is one that people get drawn into because it reaches them ln some way.As for me WW11 to me, I think of the holocaust and the effect it had on the survivors, their families and those who stood by and did nothing until it was too late.