首页 > 编程知识 正文

杭电研究生院,frobenius不等式

时间:2023-05-04 04:34:50 阅读:167101 作者:1799

problemdescriptionthefrobeniusproblemisanoldprobleminmathematics,namedafterthegermanmathematiciankdxf (18491917 )。

Let a1,a2,…,an be integers larger than 1,withgreatestcommondivisor(gcd )1. thenitisknownthattherearefinitelymanyintegegegersterstelymantetegatetegrstttttttion thatcannotbeexpressedasalinearcombinationw1a1w2a 2…wnanusingintegercoefficientswi0.thelargestofsuchnonegativegersis of a1、a2、…、an(Denotedbyf(a1、a2、…、an ) ).so:f ) a1、a2、…、、、、和an ) isthelargestnonnegativeintegerthatcannotbeexpressedasanonnegativeintegerlinearcombinationofa 1、a2、…、an。

forn=2thereisasimpleformulaforf (a1,a2 ).However,forn3 itismuchmorecomplicated.forn=3onlyforsomespecialchoicesoialchoicesore

版权声明:该文观点仅代表作者本人。处理文章:请发送邮件至 三1五14八八95#扣扣.com 举报,一经查实,本站将立刻删除。