{"id":"https://openalex.org/W2999326700","doi":"https://doi.org/10.1080/00029890.2020.1680202","title":"A Probabilistic Proof of a Recursion Formula for Sums of Powers","display_name":"A Probabilistic Proof of a Recursion Formula for Sums of Powers","publication_year":2020,"publication_date":"2020-01-06","ids":{"openalex":"https://openalex.org/W2999326700","doi":"https://doi.org/10.1080/00029890.2020.1680202","mag":"2999326700"},"language":"en","primary_location":{"id":"doi:10.1080/00029890.2020.1680202","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00029890.2020.1680202","pdf_url":null,"source":{"id":"https://openalex.org/S156280010","display_name":"American Mathematical Monthly","issn_l":"0002-9890","issn":["0002-9890","1930-0972"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The American Mathematical Monthly","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5083840586","display_name":"Xibao Hu","orcid":"https://orcid.org/0000-0002-6630-9225"},"institutions":[{"id":"https://openalex.org/I139759216","display_name":"Beijing University of Posts and Telecommunications","ror":"https://ror.org/04w9fbh59","country_code":"CN","type":"education","lineage":["https://openalex.org/I139759216"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xibao Hu","raw_affiliation_strings":["School of Science, Beijing University of Posts and Telecommunications","School of Science, Beijing University of Posts and Telecommunications, Beijing 100876, China;"],"affiliations":[{"raw_affiliation_string":"School of Science, Beijing University of Posts and Telecommunications","institution_ids":["https://openalex.org/I139759216"]},{"raw_affiliation_string":"School of Science, Beijing University of Posts and Telecommunications, Beijing 100876, China;","institution_ids":["https://openalex.org/I139759216"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101065606","display_name":"Yumin Zhong","orcid":null},"institutions":[{"id":"https://openalex.org/I139759216","display_name":"Beijing University of Posts and Telecommunications","ror":"https://ror.org/04w9fbh59","country_code":"CN","type":"education","lineage":["https://openalex.org/I139759216"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Yumin Zhong","raw_affiliation_strings":["School of Science, Beijing University of Posts and Telecommunications","School of Science, Beijing University of Posts and Telecommunications, Beijing 100876, China;"],"affiliations":[{"raw_affiliation_string":"School of Science, Beijing University of Posts and Telecommunications","institution_ids":["https://openalex.org/I139759216"]},{"raw_affiliation_string":"School of Science, Beijing University of Posts and Telecommunications, Beijing 100876, China;","institution_ids":["https://openalex.org/I139759216"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5101065606"],"corresponding_institution_ids":["https://openalex.org/I139759216"],"apc_list":null,"apc_paid":null,"fwci":0.1326,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.50686186,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"127","issue":"2","first_page":"166","last_page":"168"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.48350000381469727,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.48350000381469727,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.41679999232292175,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11727","display_name":"Advanced Algebra and Logic","score":0.4002000093460083,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.8516716957092285},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.6207354664802551},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.536185085773468},{"id":"https://openalex.org/keywords/burden-of-proof","display_name":"Burden of proof","score":0.4232587516307831},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.37888050079345703},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3303678035736084},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.2851860821247101},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.2238684594631195},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.16223832964897156},{"id":"https://openalex.org/keywords/law","display_name":"Law","score":0.12498161196708679},{"id":"https://openalex.org/keywords/political-science","display_name":"Political science","score":0.10797971487045288}],"concepts":[{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.8516716957092285},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.6207354664802551},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.536185085773468},{"id":"https://openalex.org/C2777431735","wikidata":"https://www.wikidata.org/wiki/Q1535975","display_name":"Burden of proof","level":2,"score":0.4232587516307831},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.37888050079345703},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3303678035736084},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.2851860821247101},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.2238684594631195},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.16223832964897156},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.12498161196708679},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.10797971487045288}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/00029890.2020.1680202","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00029890.2020.1680202","pdf_url":null,"source":{"id":"https://openalex.org/S156280010","display_name":"American Mathematical Monthly","issn_l":"0002-9890","issn":["0002-9890","1930-0972"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The American Mathematical Monthly","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.4699999988079071,"display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W2334477846","https://openalex.org/W2796274752","https://openalex.org/W2810593434","https://openalex.org/W4233530531"],"related_works":["https://openalex.org/W4294306921","https://openalex.org/W4255347836","https://openalex.org/W4234140893","https://openalex.org/W2366539781","https://openalex.org/W2377800953","https://openalex.org/W2356552200","https://openalex.org/W2375627470","https://openalex.org/W2368254297","https://openalex.org/W2355100776","https://openalex.org/W2387694800"],"abstract_inverted_index":{"A":[0],"probabilistic":[1],"proof":[2],"of":[3,9,17],"a":[4],"recursion":[5],"formula":[6],"for":[7],"sums":[8],"powers":[10],"is":[11],"given":[12],"by":[13],"using":[14],"some":[15],"properties":[16],"expectations.":[18]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1}],"updated_date":"2026-02-01T03:34:12.195049","created_date":"2025-10-10T00:00:00"}
