On Hardy's Apology Numbers
(ندگان)پدیدآور
Koppelaar, Dr.Nasehpour, Peymanنوع مدرک
TextResearch Paper
زبان مدرک
Englishچکیده
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 numbersArmstrong numbers
Dudeney numbers
Wells numbers
شماره نشریه
2تاریخ نشر
2020-12-011399-09-11
ناشر
University of Tehranسازمان پدید آورنده
Faculty of Electrical Engineering, Mathematics and Computer Science, Delft University of Technology, Delft, The NetherlandsVredenburchstede 20Department of Engineering Science Golpayegan University of Technology
شاپا
2476-27762476-2784
Related items
Showing items related by title, author, creator and subject.
-
The upper domatic number of powers of graphs
Samuel, Libin؛ Joseph, Mayamma (Azarbaijan Shahid Madani University, 2021-06-01)Let $A$ and $B$ be two disjoint subsets of the vertex set $V$ of a graph $G$. The set $A$ is said to dominate $B$, denoted by $A rightarrow B$, if for every vertex $u in B$ there exists a vertex $v in A$ such that $uv in ...
-
no-homomorphism conditions for hypergraphs
Tahmasebi, Samaneh؛ Rahimi Sharbaf, Sadegh (Yazd University, 2018-11-01)In this paper, we define some new homomorphism-monotone parameters for hypergraphs. Using these parameters, we extend some graph homomorphism results to hypergraph case. Also, we present some bounds for some well-known ...
-
Construction a novel generating functions for the products of certain numbers and orthogonal polynomials in several variables using the symmetric functions technique
Krioui, Sana؛ Boussayoud, Ali؛ Bellagha, Abdelaziz (Semnan University, 2023-10-01)In this paper, we introduce novel generating functions of the products of k-Fibonacci numbers, k-Lucas numbers, k-Pell numbers, k-Jacobsthal numbers, k-Mersenne numbers and symmetric functions in multiple variables. ...




