User talk:Smjg

From Wikipedia, the free encyclopedia
Jump to: navigation, search

Archived discussion:

Disambiguation link notification for March 23[edit]

Hi. Thank you for your recent edits. Wikipedia appreciates your help. We noticed though that when you edited Breeder (cellular automaton), you added a link pointing to the disambiguation page Puffer (check to confirm | fix with Dab solver). Such links are almost always unintended, since a disambiguation page is merely a list of "Did you mean..." article titles. Read the FAQ • Join us at the DPL WikiProject.

It's OK to remove this message. Also, to stop receiving these messages, follow these opt-out instructions. Thanks, DPL bot (talk) 08:55, 23 March 2014 (UTC)

SVG on fair use logos[edit]

Regarding your edit here, can you explain what you mean by "'low resolution' and 'inappropriately in JPEG format' are independent of one another"? Vector formats inherently have no resolution, unless they contain raster elements, in which case it would not be inappropriate to store it as a JPEG anyway. The only reason to use an SVG would be so that it can be losslessly scaled, in which case "resolution" is meaningless. I would agree with leaving the {{Bad JPEG}} template in place, but it should be replaced with a similar-resolution PNG, not an SVG. 0x0077BE [talk/contrib] 20:45, 4 October 2014 (UTC)

I replaced the image in question with a PNG, hopefully this should resolve the issue (File:Bullseye-logo.png. Given that it's currently only used on the Bullseye page, and that page only uses 160px-200px (I think it looks a bit better at 200px), I'm thinking we might want to actually reduce the resolution of the image to 200px, since anything higher should be unnecessary.0x0077BE [talk/contrib] 21:05, 4 October 2014 (UTC)

Most-perfect pandiagonal magic squares[edit]

This refers back to your contribution made on 25 July 2006 showing, inter alia, that there are three essentially different most-perfect pandiagonal magic squares. No source was shown.

The following extract is from 'The On-Line Encyclopedia of Integer Sequences' (OEIS sequence reference: OEISA051235)

"Number of essentially different most-perfect pandiagonal magic squares of order 4n. "Let N = 4n = Product{g}[(p_g)^(s_g)] (p_g prime) and let W_v(n) = Sum{0 <= i <= v-1}[(-1)^{v+i}BINOM(v+1, i+1)*Product{g}BINOM(s_g+i, i)] then a(n) =2^(N-2)*(2n)!^2*Sum{0 <= v < Sum{g}s_g}[W_v(N)(W_v(N)+W_{v+1}(N))]."

I am assured that, for n=1, this formula shows that there are 48 essentially different most-perfect pandiagonal magic squares. Will you comment, please?

Sherwin35 (talk) 19:17, 21 October 2014 (UTC)

Hi, it's always nice to hear from somebody showing an interest in my contributions.
It would appear that the sequence on OEIS is based on a different definition. There are 48 if you consider them to be equivalent only by rotation and reflection. But panmagic squares have another equivalence – moving the top row to the bottom, the left row to the right, and so on. Still, it's a bad description since it doesn't say what constitutes "essentially distinct", and I for one would naturally expect a sequence described as such to recognise this equivalence. For the record, I just searched OEIS and found OEISA160540.
However, my contribution didn't say that there are three most-perfect 4×4 panmagic squares, merely that there are three 4×4 panmagic squares. Though they do happen to be all most-perfect. And OEISA160540 has in its description a slightly different additional condition.
But indeed, I'd like to discover how may distinct panmagic squares there are of each size a fair way beyond 4×4. And then maybe submit my findings to OEIS. — Smjg (talk) 23:36, 21 October 2014 (UTC)
PS Hope you don't mind me linkifying the sequence number in your message :)