User talk:Hido2020

http://www.turkiyehaberajansi.com/haberdetay/43044/Matematik-Dahisi-%C3%96%C4%9Fretmen-Ethem-Deynek 'DEYNEK'S SEVEN' Deynek stated that he called the new rule he improved "Deynek's Seven". He mentioned that the advantage of the improved formula, which deviated from the former formula, was deriving it from +,-,+,-,+,... pattern of divisibility rule for 11, which is easier to remember and the he explained the Divisibility Rule for 7 as:

1, 4, 2 are written as long as the number starting from right and then the number is coded as +,-,+,-,... again starting from the right. In the event that the result of 1.g -4.f +2.e -1.d +4.c -2.b +1.a is equal to 0 or a multiplication of 7, then the number abcdefg is divisible by 7. In the event that the result is not 0 or a multiplication of 7, then this means the number is not divisible by 7. In order to find the remainder of a number that is not divisible by 7, the result's equivalent in mode 7 is considered. Example 1: Let's review 232869

9-24+16-2+12-4=7 The result 7 is divisible by 7; so 232869 is divisible by 7. Example 2: Let's review 62051829

9-8+16-1+20-0+2-24=14 The result 14 is divisible by 7; so 62051829 is divisible by 7.

http://www.turkiyehaberajansi.com/haberdetay/43044/Matematik-Dahisi-%C3%96%C4%9Fretmen-Ethem-Deynek

'DEYNEK'S SEVEN' Deynek stated that he called the new rule he improved "Deynek's Seven". He mentioned that the advantage of the improved formula, which deviated from the former formula, was deriving it from +,-,+,-,+,... pattern of divisibility rule for 11, which is easier to remember and the he explained the Divisibility Rule for 7 as:

1, 4, 2 are written as long as the number starting from right and then the number is coded as +,-,+,-,... again starting from the right. In the event that the result of 1.g -4.f +2.e -1.d +4.c -2.b +1.a is equal to 0 or a multiplication of 7, then the number abcdefg is divisible by 7. In the event that the result is not 0 or a multiplication of 7, then this means the number is not divisible by 7. In order to find the remainder of a number that is not divisible by 7, the result's equivalent in mode 7 is considered. Example 1: Let's review 232869 9-24+16-2+12-4=7 The result 7 is divisible by 7; so 232869 is divisible by 7. Example 2: Let's review 62051829 9-8+16-1+20-0+2-24=14 The result 14 is divisible by 7; so 62051829 is divisible by 7. — Preceding unsigned comment added by 85.109.55.227 (talk) 21:31, 8 November 2014 (UTC)

www.turkiyehaberajansi.com/haberdetay/43044/Matematik-Dahisi-Öğretmen-Ethem-Deynek 'DEYNEK'S SEVEN' Deynek stated that he called the new rule he improved "Deynek's Seven". He mentioned that the advantage of the improved formula, which deviated from the former formula, was deriving it from +,-,+,-,+,... pattern of divisibility rule for 11, which is easier to remember and the he explained the Divisibility Rule for 7 as:

1, 4, 2 are written as long as the number starting from right and then the number is coded as +,-,+,-,... again starting from the right. In the event that the result of 1.g -4.f +2.e -1.d +4.c -2.b +1.a is equal to 0 or a multiplication of 7, then the number abcdefg is divisible by 7. In the event that the result is not 0 or a multiplication of 7, then this means the number is not divisible by 7. In order to find the remainder of a number that is not divisible by 7, the result's equivalent in mode 7 is considered. Example 1: Let's review 232869 9-24+16-2+12-4=7 The result 7 is divisible by 7; so 232869 is divisible by 7. Example 2: Let's review 62051829 9-8+16-1+20-0+2-24=14 The result 14 is divisible by 7; so 62051829 is divisible by 7. — Preceding unsigned comment added by 85.109.55.227 (talk) 21:33, 8 November 2014 (UTC)