mersenneforum.org  

Go Back   mersenneforum.org > Search Forums

Showing results 1 to 5 of 5
Search took 0.01 seconds.
Search: Posts Made By: science_man_88
Forum: Puzzles 2016-12-02, 15:10
Replies: 44
Views: 10,644
Posted By science_man_88
okay I found one error on my own like the 19's...

okay I found one error on my own like the 19's instead of n+1. still a lot to think about since my function fails for n=3 etc still.
Forum: Puzzles 2016-12-01, 23:06
Replies: 44
Views: 10,644
Posted By science_man_88
my(a=matrix(n,n,i,j,i*j),b=[],c=if(n%2,n,2*n)); ...

my(a=matrix(n,n,i,j,i*j),b=[],c=if(n%2,n,2*n));
for(x=1,#a,
if(#x==1,
b=a[x,],
b=setunion(b,a[x,])
)
);...
Forum: Puzzles 2016-12-01, 03:10
Replies: 44
Views: 10,644
Posted By science_man_88
I know I said most of what I know was useless but...

I know I said most of what I know was useless but partitions are key so is the fact that a number can appear only roughly half the times it shows up on the multiplication table up to n times n. so...
Forum: Puzzles 2016-11-29, 01:51
Replies: 44
Views: 10,644
Posted By science_man_88
you can upper bound if for even n by using either...

you can upper bound if for even n by using either 2n if the solution for n/2 is greater than n\4 or 4 times the solution for n\2 otherwise. edit: so for example using the 17 by 17 bound in the video...
Forum: Puzzles 2016-11-27, 21:11
Replies: 44
Views: 10,644
Posted By science_man_88
the description of that video also said that a...

the description of that video also said that a new lowest 25 by 25 was found cool find either way. edit: I of course have mostly useless information as to how to make a solution other than if...
Showing results 1 to 5 of 5

 
All times are UTC. The time now is 17:11.

Sat Jan 16 17:11:57 UTC 2021 up 44 days, 13:23, 0 users, load averages: 1.41, 1.78, 1.72

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.