Proszę używać tego identyfikatora do cytowań lub wstaw link do tej pozycji:
http://hdl.handle.net/11320/5560
Pełny rekord metadanych
Pole DC | Wartość | Język |
---|---|---|
dc.contributor.author | Ziobro, Rafał | - |
dc.date.accessioned | 2017-06-02T11:55:29Z | - |
dc.date.available | 2017-06-02T11:55:29Z | - |
dc.date.issued | 2016 | - |
dc.identifier.citation | Formalized Mathematics, Volume 24, Issue 4, pp. 261-274 | pl |
dc.identifier.issn | 1426-2630 | pl |
dc.identifier.issn | 1898-9934 | pl |
dc.identifier.uri | http://hdl.handle.net/11320/5560 | - |
dc.description.abstract | While discussing the sum of consecutive powers as a result of division of two binomials W.W. Sawyer [12] observes “It is a curious fact that most algebra textbooks give our ast result twice. It appears in two different chapters and usually there is no mention in either of these that it also occurs in the other. The first chapter, of course, is that on factors. The second is that on geometrical progressions. Geometrical progressions are involved in nearly all financial questions involving compound interest – mortgages, annuities, etc.” It’s worth noticing that the first issue involves a simple arithmetical division of 99...9 by 9. While the above notion seems not have changed over the last 50 years, it reflects only a special case of a broader class of problems involving two variables. It seems strange, that while binomial formula is discussed and studied widely [7], [8], little research is done on its counterpart with all coefficients equal to one, which we will call here the subnomial. The study focuses on its basic properties and applies it to some simple problems usually proven by induction [6]. | - |
dc.language.iso | en | - |
dc.publisher | De Gruyter Open | - |
dc.subject | binomial formula | - |
dc.subject | geometrical progression | - |
dc.subject | polynomials | - |
dc.title | On Subnomials | - |
dc.type | Article | - |
dc.identifier.doi | 10.1515/forma-2016-0022 | - |
dc.description.Affiliation | Department of Carbohydrate Technology, University of Agriculture, Krakow, Poland | - |
dc.description.references | Grzegorz Bancerek. The fundamental properties of natural numbers. Formalized Mathematics, 1(1):41–46, 1990. | - |
dc.description.references | Grzegorz Bancerek and Krzysztof Hryniewiecki. Segments of natural numbers and finite sequences. Formalized Mathematics, 1(1):107–114, 1990. | - |
dc.description.references | Czesław Byliński. Some properties of restrictions of finite sequences. Formalized Mathematics, 5(2):241–245, 1996. | - |
dc.description.references | Czesław Byliński. Functions and their basic properties. Formalized Mathematics, 1(1): 55–65, 1990. | - |
dc.description.references | Wenpai Chang, Hiroshi Yamazaki, and Yatsuka Nakamura. The inner product and conjugate of finite sequences of complex numbers. Formalized Mathematics, 13(3):367–373, 2005. | - |
dc.description.references | Jacek Gancarzewicz. Arytmetyka. Wydawnictwo UJ, Kraków, 2000. In Polish. | - |
dc.description.references | Cao Hui-Qin and Pan Hao. Factors of alternating binomial sums. Advances in Applied Mathematics, 45(1):96 – 107, 2010. doi:http://dx.doi.org/10.1016/j.aam.2009.09.004. | - |
dc.description.references | Sudesh K. Khanduja, Ramneek Khassa, and Shanta Laishram. Some irreducibility results for truncated binomial expansions. Journal of Number Theory, 131(2):300 – 308, 2011. doi:http://dx.doi.org/10.1016/j.jnt.2010.08.004. | - |
dc.description.references | Andrzej Kondracki. The Chinese Remainder Theorem. Formalized Mathematics, 6(4): 573–577, 1997. | - |
dc.description.references | Rafał Kwiatek. Factorial and Newton coefficients. Formalized Mathematics, 1(5):887–890, 1990. | - |
dc.description.references | Rafał Kwiatek and Grzegorz Zwara. The divisibility of integers and integer relatively primes. Formalized Mathematics, 1(5):829–832, 1990. | - |
dc.description.references | W.W. Sawyer. The Search for Pattern. Penguin Books Ltd, Harmondsworth, Middlessex, England, 1970. | - |
dc.description.references | Wojciech A. Trybulec. Non-contiguous substrings and one-to-one finite sequences. Formalized Mathematics, 1(3):569–573, 1990. | - |
Występuje w kolekcji(ach): | Formalized Mathematics, 2016, Volume 24, Issue 4 |
Pliki w tej pozycji:
Plik | Opis | Rozmiar | Format | |
---|---|---|---|---|
forma-2016-0022.pdf | 282,6 kB | Adobe PDF | Otwórz |
Pozycja ta dostępna jest na podstawie licencji Licencja Creative Commons CCL