Bijective Proofs of Formulas with (-1) <sup>n</sup>-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Bijective Proofs of Formulas with (-1) ⁿ

Published:2022-08 Issue:3 Volume:60 Page:262-266
ISSN:0015-0517
Container-title:The Fibonacci Quarterly
language:en
Short-container-title:The Fibonacci Quarterly

Author:

Guzicki Wojciech¹,Zakrzewski Piotr¹

Affiliation:

1. Institute of Mathematics, University of Warsaw, Banacha 2, 02-097 Warsaw, Poland Email address:

Publisher

Informa UK Limited

Link

https://www.tandfonline.com/doi/pdf/10.1080/00150517.2022.12427478

Reference7 articles.

1. The Fibonacci Quarterly;Benjamin A. T.;A bijective proof of a derangement recurrence,2017

2. Lothar. Combin., B08b;Désarménien J.;Une autre interprétation du nombre de dérangements, Sém,1982

3. The Fibonacci Quarterly;Elizalde S.;A simple bijective proof of a familiar derangement recurrence,2021

4. Problem Books in Mathematics Series;Larson L. C.;Problem-Solving Through Problems,1983

5. Korean J. Math;Lee J.;The chromatic polynomial for cycle graphs,2019

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP