{"title":"A New Take on Classic ‘Pen Problems’","authors":"David A. Nash","doi":"10.1080/07468342.2023.2237843","DOIUrl":null,"url":null,"abstract":"AbstractIn this article we generalize the classic “farm pen” optimization problem from a first course in calculus in a handful of different ways. We describe the solution to an n-dimensional rectangular variant, and then study the situation when the pens are either regular polygons or platonic solids. Additional informationNotes on contributorsDavid A. Nash David A. Nash (prof.nash@gmail.com) is a data scientist at the consulting firm Kin + Carta. After an undergraduate career at Santa Clara University, he earned his Ph.D. from University of Oregon in 2010 with an emphasis in representation theory. From 2010 to 2021, he served as an associate professor of mathematics at Le Moyne College. He enjoys sharing his passion for mathematics and problem solving with students, colleagues, and his children.","PeriodicalId":38710,"journal":{"name":"College Mathematics Journal","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"College Mathematics Journal","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/07468342.2023.2237843","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Social Sciences","Score":null,"Total":0}
引用次数: 0
Abstract
AbstractIn this article we generalize the classic “farm pen” optimization problem from a first course in calculus in a handful of different ways. We describe the solution to an n-dimensional rectangular variant, and then study the situation when the pens are either regular polygons or platonic solids. Additional informationNotes on contributorsDavid A. Nash David A. Nash (prof.nash@gmail.com) is a data scientist at the consulting firm Kin + Carta. After an undergraduate career at Santa Clara University, he earned his Ph.D. from University of Oregon in 2010 with an emphasis in representation theory. From 2010 to 2021, he served as an associate professor of mathematics at Le Moyne College. He enjoys sharing his passion for mathematics and problem solving with students, colleagues, and his children.
在这篇文章中，我们用几种不同的方法概括了微积分第一课中经典的“农场围栏”优化问题。我们描述了n维矩形变体的解，然后研究了笔是正多边形或柏拉图立体时的情况。作者简介:David a. Nash (prof.nash@gmail.com)是咨询公司Kin + Carta的数据科学家。在圣克拉拉大学(Santa Clara University)完成本科学业后，他于2010年在俄勒冈大学(University of Oregon)获得博士学位，主攻表征理论。2010年至2021年，他担任勒莫恩学院数学副教授。他喜欢与学生、同事和孩子们分享他对数学和解决问题的热情。
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
