Beefy Boxes and Bandwidth Generously Provided by pair Networks
Pathologically Eclectic Rubbish Lister

Re: Matrix Formation

by artist (Parson)
on Jun 17, 2003 at 20:45 UTC ( #266641=note: print w/replies, xml ) Need Help??

in reply to Matrix Formation

Various comments so far:

1.Antirice asked if I can repeat the numbers: Answer is yes: ie.. [ [1,2],[4,2]] is allowed.

2. pzbagel: In mentioning of next if $n =~ /0\d+/;. \d+ was necessary to because I just don't wanted the formed-numbers that begins with 0. Anywhere else 0 in the number is fine. For 2x2 matrix this should work fine.

3. I like Rhose's appraoch as initiated by CountZero.

4. Other apporach:, Start forming matrix starting from the highest divisor.

4. Few other related challanges are

  • Find a matrix for each divisor possible with lowest possible total of numbers in the matrix. ex.. [[1 2] [3,0]]:Total = 6
  • Origianl matrix can have numbers with K digits. K > 1. Example: K= 2  [ [12, 34],[56,78]]
  • It could be NXNXN Matrix : Example: 3 x 3 x 3 Matrix: If we take K= 1 here, according to Rhose's approach we will have 1000/27 = 35 as maximum divisor.

Update: tall_man's answer at Re: Re: Matrix Formation is a good but rather cumborsum attempt. The best answer for 3x3 matrix -> Highest divisor is '44'. I am sure coming up with 4x4 or 15x15 matrix answers would be quite challanging.


Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://266641]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others scrutinizing the Monastery: (6)
As of 2020-11-26 21:17 GMT
Find Nodes?
    Voting Booth?

    No recent polls found