Forum: science_man_88
2018-10-19, 23:00
|
|
Replies: 24
Views: 11,680
Yes I'm weird
my(s=self());return(select(r->r=="e",Vec(Str(s))))
A code that searches itself.
|
|
Forum: science_man_88
2018-06-14, 15:44
|
|
Replies: 24
Views: 11,680
my(a=0,b=[]);for(x=1,n,if((a-x)>0&&setminus(b,[a-x...
my(a=0,b=[]);for(x=1,n,if((a-x)>0&&setminus(b,[a-x])==[],b=concat(b,[a-x]);a-=x;print(a),if(setminus(b,[a+x])==[],b=concat(b,[a+x]);a+=x;print(a),print("fails at x="x);break())))
Fails at x=26...
|
|
Forum: science_man_88
2018-02-24, 17:30
|
|
Replies: 24
Views: 11,680
https://oeis.org/draft/A158709
I was told to blog this in PM. Examples:
6=3+3 ->10=5+5; 10=3+7->16=5+11 did have a rough 21 digit example, but may have to find it again.
|
|
Forum: science_man_88
2018-02-04, 03:23
|
|
Replies: 24
Views: 11,680
5SfXqTENV_Q. Not sure it wouldn't be solved...
5SfXqTENV_Q. Not sure it wouldn't be solved already, I found a solution for the equation for n=14 just take the coeffcients on 1001 to add to 391 Mod 432 and the coefficient on 432 is 906 mod 1001.
|
|
Forum: science_man_88
2018-02-03, 18:49
|
|
Replies: 24
Views: 11,680
|
|
Forum: science_man_88
2018-02-02, 03:25
|
|
Replies: 24
Views: 11,680
|
|
Forum: science_man_88
2018-02-01, 23:28
|
|
Replies: 24
Views: 11,680
I do see ways to cut down the number to search....
I do see ways to cut down the number to search. Because, you can use symmetries picking (a,b) and (b',a') where apostrophies mean reversed permutations, will not change much at the same length, it...
|
|
Forum: science_man_88
2018-02-01, 22:02
|
|
Replies: 24
Views: 11,680
|
|
Forum: science_man_88
2018-01-31, 23:32
|
|
Replies: 24
Views: 11,680
Superpermutations
wJGE4aEWc28
Still can't believe the lowest number of instruction needed to have all permutations of n instructions present in a code isn't well known.
|
|
Forum: science_man_88
2018-01-27, 22:14
|
|
Replies: 24
Views: 11,680
|
|
Forum: science_man_88
2018-01-27, 19:27
|
|
Replies: 24
Views: 11,680
Better than emirp ?
https://www.ctvnews.ca/canada/b-c-boy-s-invented-word-gaining-traction-celebrity-endorsements-1.3778283
|
|
Forum: science_man_88
2018-01-20, 23:10
|
|
Replies: 24
Views: 11,680
What's the significance of the fact...
That the residues mod some mersenne in the LL test, are quadratic residues mod the next mersenne.
Reason I think this to be true:
Sqr(A*p+b)= A^2(p^2)+ b^2(1^2)-b mod 2p+1 and two parts of that...
|
|
Forum: science_man_88
2017-12-16, 23:26
|
|
Replies: 24
Views: 11,680
I was thinking at one point of making a poll of...
I was thinking at one point of making a poll of all 101 products my job placement place makes and seeing what people like. of course I have so few followers, that it probably wouldn't hit any of the...
|
|
Forum: science_man_88
2017-12-16, 21:44
|
|
Replies: 24
Views: 11,680
twitter update
At least on my account, there's now an option to post 25 tweets in a tweet thread. Each one can contain a poll of up to 4 options. What are some potentially useful topics to poll about, other than...
|
|
Forum: science_man_88
2017-04-14, 20:57
|
|
Replies: 24
Views: 11,680
closest to that I have are numberphile videos...
closest to that I have are numberphile videos mostly right now:
d6c6uIyieoo
VTveQ1ndH1c
it relates to too much for me to deal with and L-function stuff exist in PARI/gp but I'm not good enough...
|
|
Forum: science_man_88
2017-04-07, 12:20
|
|
Replies: 24
Views: 11,680
|
|
Forum: science_man_88
2017-04-03, 23:42
|
|
Replies: 24
Views: 11,680
mostly playing with the reduced LL test today
2(k)(n)+1 -> 2(2(k)(n)+1)^2-1 -> 8(k^2)(n^2)+8(k)(n)+1 -> 8(k)(n)(n+1)+8(k^2)+8(k)+1
a(2(k)(n)+1)->2(a(2(k)(n)+1))^2-1 -> (a^2)(2(2(k)(n)+1)^2-1 ->(a^2)(8(k^2)(n^2)+8(k)(n)+1) ->...
|
|
Forum: science_man_88
2017-01-13, 01:23
|
|
Replies: 24
Views: 11,680
closest thing I could think of to post
is how some of the things on these forums are connected like:
mersenne prime exponents linking to cunningham chains of the first kind (as well as other primes if you don't accept length 1...
|
|
Forum: science_man_88
2017-01-09, 19:05
|
|
Replies: 24
Views: 11,680
what should I post ?
most of what I can think of I probably already have posted somewhere like the trivial results that 2^m{M_n}^2 \equiv M_{n-1}+2^m \pmod {M_{n+m}}
edit: yep so trivial I messed up it's statement....
|
