SOLUTION: Prove or Disprove: For all integers a and n, if (a divides n�) and a < n, then (a divides n).

SOLUTION: Prove or Disprove: For all integers a and n, if (a divides n�) and a < n, then (a divides n).

Algebra.Com

Question 911219: Prove or Disprove: For all integers a and n, if (a divides n�) and a < n, then (a divides n).
Answer by richard1234(7193) (Show Source): You can put this solution on YOUR website!
False.

e.g. let a = 4, n = 10. 4 divides 100, but 4 does not divide 10.
RELATED QUESTIONS
Prove or Disprove: For all integers a and n, if a│n� and a < n, then... (answered by richard1234)

Define a relation R on the set of integers by mRn if and only if 3 divides m - n. Prove (answered by jim_thompson5910)

Prove or disprove: i divides n^3(in otherwords n^3/i is an integer), then i divides... (answered by richard1234)

This is a Number Theory proof: If N = abc + 1, prove that (N, a) = (N, b) = (N, c) =... (answered by KMST)

Suppose that a and d are integers. m and n are natural numbers such that d divides... (answered by richard1234)

Determine all integers n, with 100 < n < 200, such that 16 | (n^2 + 2n)... (answered by richard1234)

How do i show for integers m and n and a natural number k that is greator and equal to 1. (answered by venugopalramana)

I am having a lot of trouble with these proofs; I get so far and alskdjfl.... prove or (answered by khwang)

Prove or disprove the following: The expression n2 � n +41 produces a prime number for... (answered by richard1234)