{"entities":{"Q7025914":{"pageid":21658383,"ns":120,"title":"Item:Q7025914","lastrevid":76747758,"modified":"2026-04-24T23:48:01Z","type":"item","id":"Q7025914","labels":{"en":{"language":"en","value":"A combinatorial proof for the Fibonacci dying rabbits problem"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7985937"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7025914$BC08ACF8-8A0C-416E-9CEE-63ECA03CE73E","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"7bcb750d0c9c52e0619c6f0f6446d1d945b4f813","datavalue":{"value":{"text":"A combinatorial proof for the Fibonacci dying rabbits problem","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q7025914$357E322F-619B-41BA-AB4F-838E70DFB5C2","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"9d0d4fdfad2299468f6571c52c09a9ad2afcf4f9","datavalue":{"value":{"entity-type":"item","numeric-id":392176,"id":"Q392176"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7025914$7E80E36A-F79A-4EA0-B2B9-C324E71FE088","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"cb30a469ea14707283323a287dffe44af3b2bfb6","datavalue":{"value":{"entity-type":"item","numeric-id":6591340,"id":"Q6591340"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7025914$8017F019-8521-4C38-8E01-BC4DA40D92A3","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"d34a2e6c4099712e6f2a5acfda08782bd5ee66f2","datavalue":{"value":{"time":"+2025-02-19T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q7025914$914A5A74-B87B-40B4-8AE0-D24E0BF18F3C","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"cf7beccbab638c345297aae166a1662e87ada953","datavalue":{"value":"https://luca-giuzzi.unibs.it/ICA/Volumes/103/Reprints/BICA2024-01-Reprint.pdf","type":"string"},"datatype":"url"},"type":"statement","id":"Q7025914$451B3403-3310-40B6-8345-FE27392F93F3","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"c972b0e010932808ae6276a2ef84b946c0f6d3cf","datavalue":{"value":"The author considers the generalized Fibonacci counting problem with rabbits that become fertile at age \\(f\\) and die at age \\(d\\), with \\(1 \\leq f \\leq d\\), and \\(d\\) finite or infinite.\\N\\NIn the paper, a combinatorial proof of a recurrence relation for the number of rabbits at each generation is provided based exclusively on a counting argument and using only elementary mathematics. The author thus claims to complete previous work by this reviewer [\\textit{A. M. Oller-Marc\u00e9n}, Integers 9, No. 2, Article A11, 129--138 (2009; Zbl 1238.11014)]\\N\\NThe recurrence relation generalizes both the original Fibonacci sequence and several other Fibonacci-related sequences, such as the Padovan sequence and the Tribonacci, Tetranacci, and alike sequences.","type":"string"},"datatype":"string"},"type":"statement","id":"Q7025914$07776BB3-FD8A-4133-9C27-CD1ABFC8DBC6","rank":"normal"}],"P1447":[{"mainsnak":{"snaktype":"value","property":"P1447","hash":"fb092524bfbd1446f7d573d52a5edf29b0b15ee1","datavalue":{"value":{"entity-type":"item","numeric-id":270276,"id":"Q270276"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7025914$06237767-723F-4F67-A50E-473FF918CC0A","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"ccc5a5c9dd2865ab4417f7cabfcec0ef477e1206","datavalue":{"value":"11B39","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7025914$92E99E5F-6DAD-44C4-960F-A86A252B4352","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"ca82df142921c61450d19a6be4e81f35d8a9414b","datavalue":{"value":"11K31","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7025914$72B11C48-4E56-489B-B3A7-963D36CDD792","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"36aacab0913e69057a9e4c4e163227877491e349","datavalue":{"value":"7985937","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7025914$5F4F2D23-8111-44F9-A4B0-65EE9CFF13DA","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"00f4c59a3cda94edc5dfa217dd136cef9d612538","datavalue":{"value":"Fibonacci counting problem","type":"string"},"datatype":"string"},"type":"statement","id":"Q7025914$2AF2484E-F3ED-43DE-B355-16BFA5AFA753","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"3e4f0bd77c873c3cad4bebd377923a35f9e366a0","datavalue":{"value":"generalized Fibonacci sequences","type":"string"},"datatype":"string"},"type":"statement","id":"Q7025914$3FE3F5CC-ED6D-4862-9715-2FAE65DFE8F3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"ae417690db4aace62d1af3ebf156b406630c8471","datavalue":{"value":"dying rabbits problem","type":"string"},"datatype":"string"},"type":"statement","id":"Q7025914$EC6A2E1C-389E-4ED6-A8E1-9814F42A6E78","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7025914$C69A4089-8A5F-43C8-B477-5F4593D94743","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A combinatorial proof for the Fibonacci dying rabbits problem","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_combinatorial_proof_for_the_Fibonacci_dying_rabbits_problem"}}}}}