# [seqfan] Re: ApSimon's Mints

Charles Greathouse charles.greathouse at case.edu
Tue Jun 17 02:37:14 CEST 2014

```max(SUM P_r, SUM Q_r) is the largest number of coins we need to weigh at a
time. It could be sensible to measure this if, for example, our scale had a
limited capacity. But Tanya's question (and ApSimon's, apparently) is about
the total number of coins we need to request from each branch, supposing
that we keep them through the two weighings which is SUM max(P_r, Q_r).

Charles Greathouse
Analyst/Programmer
Case Western Reserve University

On Fri, Jun 13, 2014 at 12:58 AM, Max Alekseyev <maxale at gmail.com> wrote:

> Hi Tanya,
>
> I do not understand how "the minimum total of coins you need to
> request from the mints" results in minimizing SUM max(P_r,Q_r).
> I'd think that we need to minimize max(SUM P_r, SUM Q_r) or simply SUM
> (P_r + Q_r), depending on whether we want to minimize number of coins
> in each or both of weightings.
>
> So why SUM max(P_r,Q_r) ?
>
> Regards,
> Max
>
>
> On Thu, Jun 12, 2014 at 2:15 PM, Tanya Khovanova <tanyakh at yahoo.com>
> wrote:
> > Dear SeqFans,
> >
> > I wrote a short paper about ApSimon's Mints
> > http://arxiv.org/pdf/1406.3012v1.pdf
> >
> >
> > I suggest several new sequences there that I am not powerful enough to
> calculate myself. Is anyone interested?
> >
> >
> > Tanya
> > The definition without all the suggested sequences is in the blog post:
> > http://blog.tanyakhovanova.com/?p=501
> >
> > _______________________________________________
> >
> > Seqfan Mailing list - http://list.seqfan.eu/
>
> _______________________________________________
>
> Seqfan Mailing list - http://list.seqfan.eu/
>
```