The Math Forum

Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Math Forum » Discussions » sci.math.* » sci.math.num-analysis

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: Simple Math/Logic Problem
Replies: 1   Last Post: Jun 30, 2013 10:19 AM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
Rudolf Licht

Posts: 2
Registered: 6/27/13
Simple Math/Logic Problem
Posted: Jun 27, 2013 4:56 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

I'm trying to figure out the math/logic on this programming problem I got.

So I have a series of numbers and letters:

Numbers: 1-6

Letters: a, b, c, d, e, f, g, h, i, j

These are arranged in long patterns like so:

a5b a1f a3g a3i b5f b4i c1d e6h e5j g3i g6j h4j i6j

The numbers are always in the middle. And the letters are
always in alphabetical order. So e5j and j5e would be equal for my purposes. Also they all are exactly 3 characters.

So what I'm trying to do is match these strings against other similar strings, in a gradually decremental way.

So take the above pattern as an example. I would try to match on all 13 points, after 12 then 11 etc. Even if they do match I still need to record all the matches down to like 2 or 3.

Take the above example once it gets to like 9 points the possible combinations start to grow. But yeah I don't understand the math governing this, or how to calculate the total possible combinations.

If someone could point me in the right direction, also if
you give me some esoteric math formula, I probably won't understand it.

Thanks in advance.

Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© The Math Forum at NCTM 1994-2018. All Rights Reserved.