User talk:Emre1998

“abcdefg ” sayısının 12 ile bölünüp bölünemediğini saptamak için aşağıdaki yöntem uygulanır. Sağdan başlanarak birler ve onlar basamağındaki rakamların üzerine sırasıyla “1 ile 2” rakamları yazıldıktan sonra, geriye kalan diğer basamaklardaki rakamlar üzerine de sırasıyla 4, 8, 4, 8, 4, 8,. . . rakamları yazılır ve yine sağdan başlanarak sayının rakamları +, -, +, - , ... şeklinde işaretlenir.

Yandaki tabloya göre; aşağıdaki matematiksel işlem yapılır. 1.g - 2.f + 4.e -8.d + 4.c - 8.b + 4.a işleminin sonucu 0 veya 12 nin katı ise abcdefg sayısı 12 ile tam bölünebilir. Eğer sonuç 0 veya 12 nin katı değilse, sayı 12 ile tam bölünmüyor demektir. Kalanı bulabilmek için çıkan sonucun (mod 12) deki değeri kalanı verir. Yukarıda verilen 12 ile bölünebilme kuralına “DEYNEK 12’ lisi” denir. Örnek 1: 1341578 sayısını inceleyelim

1.8-2.7 + 4.5-8.1 + 4.4-8.3 + 4.1 = 8 -14 + 20-8 + 16-24 + 4 = 2 1341578 sayısı 12 ile tam bölünemez. 1341578 sayısı 12 ile bölündüğünde 2 kalanını verir. Örnek 2: 560424 sayısını inceleyelim

1.4-2.2+4.4-8.0+4.6-8.5 =4-4+16-0+24-40 = 0 Sonuç 0 çıktığı için 560424 sayısı 12 ile tam bölünür. Örnek 3: 23759 sayısını inceleyelim

1.9-2.5+4.7-8.3+4.2 = 9-10+28-24+ 8 = 11 23759 sayısı 12 ile tam bölünmez. 23759 sayısı 12 ile bölündüğünde 11 kalanını verir. http://www.habererk.com/arsiv//haber/36179/matematik-ogretmeni-ethem-deynek-bu-kez-de-12-ile-bolunebilme-formulunu-buldu.html

Your submission at Articles for creation: sandbox (October 16)
 Your recent article submission to Articles for Creation has been reviewed! Unfortunately, it has not been accepted at this time. Please check the submission for any additional comments left by the reviewer. You are encouraged to edit the submission to address the issues raised and resubmit when they have been resolved.


 * If you would like to continue working on the submission, go to User:Emre1998/sandbox and click on the "Edit" tab at the top of the window.
 * If you need any assistance, you can ask for help at the [//en.wikipedia.org/w/index.php?title=Wikipedia:WikiProject_Articles_for_creation/Help_desk&action=edit&section=new&nosummary=1&preload=Template:Afc_decline/HD_preload&preloadparams%5B%5D=User_talk:Emre1998 Articles for creation help desk] or on the [//en.wikipedia.org/w/index.php?title=User_talk:MatthewVanitas&action=edit&section=new&nosummary=1&preload=Template:Afc_decline/HD_preload&preloadparams%5B%5D=User_talk:Emre1998 reviewer's talk page].
 * You can also get real-time chat help from experienced editors.

MatthewVanitas (talk) 20:21, 16 October 2014 (UTC)

bir türk ögretmen '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

Your draft article, User:Emre1998/sandbox


Hello, Emre1998. It has been over six months since you last edited your WP:AFC draft article submission, entitled "sandbox".

The page will shortly be deleted. If you plan on editing the page to address the issues raised when it was declined and resubmit it, simply and remove the  or  code. Please note that Articles for Creation is not for indefinite hosting of material deemed unsuitable for the encyclopedia mainspace.

If your submission has already been deleted by the time you get there, and you want to retrieve it, you can request its undeletion by one of two methods (don't do both): 1) follow the instructions at WP:REFUND/G13, or 2) copy this code:, paste it in the edit box at this link , and click "Save page". An administrator will in most cases undelete the submission.

Thanks for your submission to Wikipedia, and happy editing. JMHamo (talk) 21:06, 19 May 2015 (UTC)