2020-04-04, 11:47 | #1 |
Mar 2018
526_{10} Posts |
Is this fact provable?
I asked it on mathexchange but I did not receive a clear answer.
Consider this Pari code: liste(lim,mul,base=34,step=5590,offset=588)=my(v=List(),X=mul*base); lim\=1; while(X<lim,forstep(n=X+offset+step,lim,step, listput(v,n)); X*=base); Set(v) list(lim)=setunion(liste(lim,23),liste(lim,223)) v=list(1e6) This code generates numbers: if I am not wrong numbers generated by that Pari code which are multiple of 43 are also congruent either to 0 or 344 mod 559. Is this true and why? : liste(lim,mul,base=34,step=5590,offset=588)=my(v=List(),X=mul*base); lim\=1; while(X<lim,forstep(n=X+offset+step,lim,step, listput(v,n)); X*=base); Set(v) list(lim)=setunion(liste(lim,23),liste(lim,223)) v=list(1e6) If you add this Pari code subset1 = select((x) -> (x % 43 == 0), v); subset2 = select((x) -> (x % 43 == 0) && (x % 559 == 0 || x % 559 == 344), v); vecsort(subset1) == vecsort(subset2) > 1 you should test that actually numbers 0 mod 43 are either 344 or 0 mod 559 Last fiddled with by enzocreti on 2020-04-04 at 19:14 |
Thread Tools | |
Similar Threads | ||||
Thread | Thread Starter | Forum | Replies | Last Post |
how to proof this fact | enzocreti | enzocreti | 3 | 2020-02-28 15:48 |
an astounding fact for one man, a triviality for mankind! | enzocreti | enzocreti | 0 | 2019-11-14 13:43 |
Fact or Friction | storm5510 | GPU Computing | 7 | 2018-04-21 01:38 |
Bible-fact, fiction,or mythology? | mfgoode | Soap Box | 163 | 2007-11-29 16:42 |
A strange new (?) fact about Mersenne factors | ChriS | Math | 14 | 2006-04-12 17:36 |