1. The problem statement, all variables and given/known data Show that negative divisors of an integer, are just the negatives of the positive divisors. 3. The attempt at a solution having an integer [itex]n[/itex] and a negative divisor [itex]k[/itex], we get the positive divisor by multiplying [itex](-1)k[/itex], thus each negative divisor of an integer, is the negative of the positive divisor of [itex]n[/itex]. I have the idea but don't know if this kind of proof is correct.