Martin Hopf's prime numbers

« first day (1216 days earlier) ← previous day next day → last day (7 days later) »

6:20 PM

This Puzzle is still unsolved.

Hi , I must admit I cheated to recover my own puzzle. I used that the random generator is not really random. Just in the case you still try to solve it and eventually want to give up.

A question of someone : 60-digit perfect square with the maximum digitsum. I tried to beat the 484 , but despite considerable effort only reached 463. Sigh.

Martin Hopf

Hi, I gave up for the 4 distinct digit puzzle in base-10. Too many branches to search for.

But I've created this 6 distinct digit puzzle in base-32. And it is still unsolved :)

Peter

6:37 PM

How many digits do we have in base 32 ?

Martin Hopf

User140242, however, has already posted a C++ code that might contain the solution.

Peter

Abive you see some new projects , including a prime factor search.

Martin Hopf

actually the factors p and q have 105 digits in base-32 representation.

Would you like to post the factors to factordb.com?

Peter

For my own puzzle ? Done.

Martin Hopf

And for my puzzle?

Peter

6:45 PM

You really think I can crack this ?

Martin Hopf

Why not

Peter

I did not even find the optimum for the above square-problem and this is probably much easier.

Martin Hopf

I can't post the answer to my own puzzle. But will you if I gave you the code?

Peter

OK, this is a compromiss ...

Martin Hopf

I would be glad :)

Here is the code:

fun32(n,A,B=A,p=0,q=0,m=1,s=sqrtint(n))={
if(p>s&&q>s,return);
foreach(A,a,aq=a*q;
foreach(B,b,
d=n-(aq+b*p+a*b*m);
if(d%32,next);
d\=32;
if(d,,return([p+a*m,q+b*m]));
r=fun32(d,A,B,p+a*m,q+b*m,32*m,s);
if(r,return(r))))
};

run with fun(n, [15, 30, 23, 4, 22, 14])

and n is the C320 from my puzzle.

Peter

6:55 PM

*** unexpected ';': ...eturn);foreach(A,a,aq=a*q;foreach(B,b,d=n-(aq+
*** ^---------------------
gp >

Martin Hopf

how is that possible?

try it with:

fun32(n,A,B=A,p=0,q=0,m=1,s=sqrtint(n))={
if(p>s&&q>s,return());
foreach(A,a,aq=a*q;
foreach(B,b,
d=n-(aq+b*p+a*b*m);
if(d%32,next);
d\=32;
if(d,,return([p+a*m,q+b*m]));
r=fun32(d,A,B,p+a*m,q+b*m,32*m,s);
if(r,return(r))))
};

Peter

same message

seems a is not defined ...

Martin Hopf

Or:

{fun32(n,A,B=A,p=0,q=0,m=1,s=sqrtint(n))=
if(p>s&&q>s,return());
foreach(A,a,aq=a*q;
foreach(B,b,
d=n-(aq+b*p+a*b*m);
if(d%32,next);
d\=32;
if(d,,return([p+a*m,q+b*m]));
r=fun32(d,A,B,p+a*m,q+b*m,32*m,s);
if(r,return(r))))
};

« first day (1216 days earlier) ← previous day next day → last day (7 days later) »

all rooms