Assertion: sum | /r/HasProperty | divisible
Facets:
value: by conjecture
type: MANNER
value: by 5
type: OTHER
value: by k.
type: OTHER
value: by 3
type: OTHER
value: by 9
type: OTHER
value: by 3 4
type: OTHER
Source sentences:
text: The rules for some other numbers are 2 all even numbers are divisible by 2 3 The sum of the digits is divisible by 3 4 The last 2 numbers are divisible by 4 5
text: The sum of the digits is divisible by 3 and is even 7 no easy method 8
text: The sum of the digits is divisible by 9
text: Because of the above we now know that if we have the sum of five consecutive numbers, that sum is divisible by 5 and if we have a number that is divisible by 5, but not 5 or 10, then it can be expressed as the sum of five numbers.
text: By Conjecture 20, the sum of that string would have to be divisible by k.