تعداد نشریات | 161 |
تعداد شمارهها | 6,470 |
تعداد مقالات | 69,914 |
تعداد مشاهده مقاله | 122,491,799 |
تعداد دریافت فایل اصل مقاله | 95,720,398 |
On Hardy's Apology Numbers | ||
Journal of Algorithms and Computation | ||
دوره 52، شماره 2، اسفند 2020، صفحه 67-83 اصل مقاله (330.62 K) | ||
نوع مقاله: Research Paper | ||
شناسه دیجیتال (DOI): 10.22059/jac.2020.79248 | ||
نویسندگان | ||
Dr. Henk Koppelaar1؛ Peyman Nasehpour* 2 | ||
1Faculty of Electrical Engineering, Mathematics and Computer Science, Delft University of Technology, Delft, The NetherlandsVredenburchstede 20 | ||
2Department of Engineering Science \\ Golpayegan University of Technology | ||
چکیده | ||
Twelve well known `Recreational' numbers are generalized and classified in three generalized types Hardy, Dudeney, and Wells. A novel proof method to limit the search for the numbers is exemplified for each of the types. Combinatorial operators are defined to ease programming the search. | ||
کلیدواژهها | ||
Hardy's apology numbers؛ Armstrong numbers؛ Dudeney numbers؛ Wells numbers | ||
آمار تعداد مشاهده مقاله: 485 تعداد دریافت فایل اصل مقاله: 307 |