## 884 Reputation

16 years, 95 days

## but there is more...

@Carl Love Thanks. I made the change to the ELO procedure, and it works for that part.

But not for the Update procedure. It doesnt like my input.  Games:= [[Tom_C, David_J,D ],[David_J, Tom_C ]]:

ELO_draw2.mw

## 42?...

Provide your prof a proof that 42 is the answer to life, the universe and everything.

## Brilliant, Tom...

@tomleslie Thankyou.

This leads onto a further question which I hope you can help with. I don't really want to convert to csv.....

Feeder4.xls

import2.mw

## I did what you proposed...

@Kitonum but same result...

X86 64 WINDOWS 7

## I get empty result after solve...

In my version of M2017.0

Polynomial-Fragmentation.mw

## I know you are being slightly facetious,...

@Rouben Rostamian  42=the answer to life, the universe and everything....

but how, pray,did you derive your expression?

I tried many

spline.mw

## With the given terms.......

A:=[100, 101, 97, 106, 90, 115, 79, 128]:
A1 := ([seq])((A[k]-A[k-1]), k = 2 .. nops(A))
A2 := map(ifactor, A1)
#so we can guess the recurrance relation....
a:=unapply(simplify(rsolve({a(n)= (-1)^(n+1)*n^2+a(n-1),
a(0)=100}, a(n))), n);  # General formula
seq(expand(a(n)), n=0..10);  # The first 11 terms

## Counting formula...

@Kitonum Is there a formula to count the number of subsets, where the length of subsets differs.

It looks the same as the total number of set partitions of n distinct items into e sets of length l, with n = (e*l)!/e!/(l !)^e.
https://www.mapleprimes.com/questions/200480-Product-Grouping

I don't know how this formula was derived, but there are 280 possible distinct partitions of a 9 member set into 3 subsets of 3.

This is the same as nops(SetPartition(L, p));

## Thanks...

I see you changed the line P= Iterator:-SetPartitions(n,[[len,num]],'transformer=permute').

What about this Carl code. It used to work, but not in M2017. Can you (or someone) get it to work?

restart:
S:=[3, 4, 5, 6, 8, 9, 28, 30, 35.1, 36, 37, 40];
SL:=[seq(A||i,i=1..12)];
assign(Labels ~ (S) =~ SL); #Create remember table.
AllP:= [seq(P, P= Iterator:-SetPartitions({op(S)},[[4,3]], compile= false))]:
lnp:= evalf(ln(`*`(S[])^(1/3))):
Var:= proc(P::list(set))
local r:= evalf(`+`(map(b-> abs(ln(`*`(b[]))-lnp), P)[]));
end proc:

ans:=sort(AllP, (x,y)-> Var(x) < Var(y))[1];

subsindets(ans, realcons, Labels);

EDIT: I'll answer my own question to a degree. I remembered I needed to install Joe Reils Iterator package into Maple 16.

https://www.maplesoft.com/applications/view.aspx?SID=141522

I need an equivalent command for AllP for it ro work in Maple 2017......

## Yes, I still have it...

@acer

As far as I know this is the original file (archived in my Googledrive M16 folder) from 31/1/2014.

It would make me happy if you can fix it!

@tomleslie Your suggestion fixes the import problem with MS Visual Studio bat files. But according to Acer I didn't need to install it.

I get errors implimenting with the endemic compiler. its a pity Maple doesn't seem to have a feature like Mathematicas update when opening old files.

## How do I compile MinVal?...

I had archived an old copy of "EqualProducts16.mw. Without running it, it displayed the above (correct) output in M2017.So it used to work. (Joe's Code anyway, Carls doesn't seem to work anymore). But when I try to run it, it complains:

## Thanks...

@Kitonum for your efforts with my problem.

I did have a look at your SetPartition  and  Partition procedures before posting.

Happy New Year!

 4 5 6 7 8 9 10 Last Page 6 of 25
﻿