Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 88 tok/s
Gemini 2.5 Pro 47 tok/s Pro
GPT-5 Medium 21 tok/s Pro
GPT-5 High 13 tok/s Pro
GPT-4o 81 tok/s Pro
Kimi K2 175 tok/s Pro
GPT OSS 120B 450 tok/s Pro
Claude Sonnet 4 39 tok/s Pro
2000 character limit reached

The Frobenius Formula for $A=(a,ha+d,ha+b_2d,...,ha+b_kd)$ (2304.09039v2)

Published 18 Apr 2023 in math.CO and math.NT

Abstract: Given relative prime positive integers $A=(a_1, a_2, ..., a_n)$, the Frobenius number $g(A)$ is the largest integer not representable as a linear combination of the $a_i$'s with nonnegative integer coefficients. We find the Stable" property introduced for the square sequence $A=(a,a+1,a+2^2,\dots, a+k^2)$ naturally extends for $A(a)=(a,ha+dB)=(a,ha+d,ha+b_2d,...,ha+b_kd)$. This gives a parallel characterization of $g(A(a))$ as acongruence class function" modulo $b_k$ when $a$ is large enough. For orderly sequence $B=(1,b_2,\dots,b_k)$, we find good bound for $a$. In particular we calculate $g(a,ha+dB)$ for $B=(1,2,b,b+1)$, $B=(1,2,b,b+1,2b)$, $B=(1,b,2b-1)$ and $B=(1,2,...,k,K)$. Our idea also applies to the case $B=(b_1,b_2,...,b_k)$, $b_1> 1$.

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Don't miss out on important new AI/ML research

See which papers are being discussed right now on X, Reddit, and more:

“Emergent Mind helps me see which AI papers have caught fire online.”

Philip

Philip

Creator, AI Explained on YouTube