/prog/ - Dubsoholics Anonymous

Name: Anonymous 2015-03-03 6:14

Do you feel compulsion to post dubs?
Does it interfere with your daily life?
Do you ever wished to end the dubs cycle?
You've came to the right place.

Name: Anonymous 2015-03-04 21:47

Every number over 1 is dubs in unary.

Name: Anonymous 2015-03-04 21:49

Every number n > 1 is dubs in base n - 1.

Name: Anonymous 2015-03-04 23:10

Basking in the pre-dubs glory

Name: Anonymous 2015-03-04 23:15

duds

Name: Anonymous 2015-03-05 0:04

Eternal Erection shall be the name of my new grindcore/noise band.

Name: Anonymous 2015-03-05 2:31

Ejaculate Everlasting

Name: Anonymous 2015-03-05 23:24

I am dying for another dub-dose.

Name: Anonymous 2015-03-05 23:27

>>45

grindcore/noise

"Erectile Dysfunction" would be a more fitting name.

Name: Anonymous 2015-03-06 10:58

>>40

(define (check'em n b) (= (mod n b) (mod (div n b) b)))
(define (dubsize dub) 
  (length (filter (lambda (b) (check'em dub b)) (iota dub 1))))
(define (biggest-dubs upto) 
  (define (dub-crawler n max bigdubs) 
    (cond ((= n upto) bigdubs) 
          ((> (dubsize n) max) (dub-crawler (+ n 1) (dubsize n) (list n))) 
          ((= (dubsize n) max) (dub-crawler (+ n 1) max (cons n bigdubs))) 
          (else (dub-crawler (+ n 1) max bigdubs)))) 
  (dub-crawler 1 1 (list)))
(biggest-dubs 1000)
=> (900)
(dubsize 900)
=> 22

Name: Anonymous 2015-03-06 15:41

>>48
I once had a band with that name.

Name: Anonymous 2015-03-06 16:14

>>49 That code is extremely inefficient

//mbrds.c       multi-base repdigit search
#include "..\void.h" //https://gist.github.com/FrozenVoid/87e6ad6212ac9ce496e0
STDSTART

#define SHOWALL
//use maxbase to limit long bases
#define SYNTAX "mbrds: maxnumber [maxbase]"
// 2%10
#define repend(x,base) ((((x%base)==(x%(base*base))))&(x>base))
u8 mbase,mnumber,count=0,maxc=0,maxn=0;
if(argc<2)quit(SYNTAX);
 mnumber=strto(argv[1],u8);
if(argc<3){mbase=mnumber;}else{
mbase=strto(argv[2],u8);}

u8 st=tsc();
for(u8 i=1;i<=mnumber;i++){count=0;
//unary base does not count as it always has repdigits(unordered)
for(u8 c=2;c<=mbase;c++){count+=(repend(i,c));}
if(count>maxc){maxc=count;maxn=i;}}
u8 en=tsc()-st;
/*
  Time spent: 478245359228 cycles
 Found max repdigit range 1<> 100000 at base 2<> 100000
 Number: 57600 Bases: 23
 2 3 4 5 6   8   10   11   12   15   16   20   22   24   27   30   35   40   48   60   80   120
 240 */ 
 p("Time spent:",en,"cycles",crlf,"Found max repdigit range 1<>",mnumber,"at base 2<>",mbase,crlf);
 p("Number:",maxn,"Bases:",maxc,crlf);
 #ifdef SHOWALL 
 p("(");
 for(u8 c=2;c<=mbase;c++){
 if(repend(maxn,c)){ p(c,",");}}
 p(")");
 #endif
   STDEND

Name: Anonymous 2015-03-06 16:59

Fixed repdigit detection

//mbrds.c       multi-base repdigit search
#include "..\void.h" //https://gist.github.com/FrozenVoid/87e6ad6212ac9ce496e0
STDSTART

#define SHOWALL
//use maxbase to limit long bases
#define SYNTAX "mbrds: maxnumber [maxbase]"
//22 base 10 -> 22 2
//fixed search ignoring low reps 
#define repcheck(x,base) sm auto enddig=x%(base*base); enddig/base==enddig%base em
u8 mbase,mnumber,count=0,maxc=0,maxn=0;
if(argc<2)quit(SYNTAX);
 mnumber=strto(argv[1],u8);
if(argc<3){mbase=mnumber;}else{
mbase=strto(argv[2],u8);}

u8 st=tsc();
for(u8 i=1;i<=mnumber;i++){count=0;
//unary base does not count as it always has repdigits(unordered)
for(u8 c=2;c<=mbase;c++){count+=(repcheck(i,c));}
if(count>maxc){maxc=count;maxn=i;}}
u8 en=tsc()-st;
/*
c:\code> progs\mbrds 100000
 Time spent: 450249079816 cycles
 Found max repdigit range 1<> 100000 at base 2<> 100000
 Number: 88200 Bases: 73
 ( 2 , 3 , 5 , 6 , 7 , 10 , 14 , 15 , 16 , 21 , 30 , 35 , 42 , 44 , 70 , 103 , 1
05 , 208 , 210 , 299 , 314 , 349 , 359 , 391 , 419 , 440 , 449 , 489 , 503 , 524
 , 587 , 599 , 629 , 699 , 734 , 839 , 881 , 899 , 979 , 1049 , 1175 , 1224 , 12
59 , 1399 , 1469 , 1574 , 1763 , 1799 , 1959 , 2099 , 2204 , 2449 , 2519 , 2939
, 3149 , 3527 , 3674 , 4199 , 4409 , 4899 , 5879 , 6299 , 7349 , 8819 , 9799 , 1
1024 , 12599 , 14699 , 17639 , 22049 , 29399 , 44099 , 88199 , ) */ 
 p("Time spent:",en,"cycles",crlf,"Found max repdigit range 1<>",mnumber,"at base 2<>",mbase,crlf);
 p("Number:",maxn,"Bases:",maxc,crlf);
 #ifdef SHOWALL 
 p("(");
 for(u8 c=2;c<=mbase;c++){
 if(repend(maxn,c)){ p(c,",");}}
 p(")");
 #endif
   STDEND

Name: Anonymous 2015-03-06 17:21

mbrds

typical C programmers in charge of clarity

Name: Anonymous 2015-03-06 17:27

>>53
ScalableMultiThreadedNaturalBaseRepDigitEnterpriseSearchSolutionAlgorithms.jar

Name: Anonymous 2015-03-06 18:14

check em

Name: Anonymous 2015-03-06 22:23

These dubs can't stop. I gotta check 'em all!

Name: Anonymous 2015-03-07 3:26

oh fuck! If we go to base one, there's so many dubs. So many fucking dubs. Fuck! *cums*

Name: Anonymous 2015-03-07 3:28

>>49
I think we found our first function to define in dubs theory.

Name: Anonymous 2015-03-07 22:15

Hold me close, and hold me dear.
By my side be always near.

Name: Anonymous 2015-03-07 22:36

>>49

define

You, sir, are a faggot.

(define-syntax def
  (syntax-rules ()
    ((def a ...)
     (define a ...))))

Name: Anonymous 2015-03-08 4:43

Unanswered Questions in Dubseology:
What if we, in the quest for new dubs, unintentionally post content to advance the thread closer to the dubs gathering zone?
What if the dubs lead us to virtually socialize by dubs-sharing(the social science of dubchecking)?
Does dubs equalize all posters by having the same content?
What kind of social cohesion drive dubs seekers towards the dubs interaction: the friendly competitive race to the dubs or exclusionary in-group dubs-control?
How memetics of dubs affects their status within the dubs-gathering community? Does dubs decrease in value with their acceptance or increase? Why the first dubs have special status?

Name: Anonymous 2015-05-30 1:29

Bumping for historical interest.

Name: Anonymous 2015-05-30 16:18

Yeah, well, checking dubs might seem relatively harmless. But you should know that it can lead to fibs getting and prime getting. And lets not forget Jackson 5 getting.

So I would advice to stop checking dubs.

Name: Anonymous 2015-05-30 16:47

>>62
Back to /g/, ⁶⁶please⁹⁹!

>>63
And all of those run the risk of banning. Everyone, please be sure to keep your retardation at manageable levels!

Name: Anonymous 2015-05-30 18:06

retardation

I don't like this word.

Name: Anonymous 2015-05-30 18:45

▄▄▄▄▄▄▄▄▄▄▄ ▄ ▄ ▄▄▄▄▄▄▄▄▄▄▄ ▄▄▄▄▄▄▄▄▄▄▄ ▄ ▄ ▄▄▄▄▄▄▄▄▄▄▄ ▄▄ ▄▄ ▐░░░░░░░░░░░▌▐░▌ ▐░▌▐░░░░░░░░░░░▌▐░░░░░░░░░░░▌▐░▌ ▐░▌ ▐░░░░░░░░░░░▌▐░░▌ ▐░░▌ ▐░█▀▀▀▀▀▀▀▀▀ ▐░▌ ▐░▌▐░█▀▀▀▀▀▀▀▀▀ ▐░█▀▀▀▀▀▀▀▀▀ ▐░▌ ▐░▌ ▐░█▀▀▀▀▀▀▀▀▀ ▐░▌░▌ ▐░▐░▌ ▐░▌ ▐░▌ ▐░▌▐░▌ ▐░▌ ▐░▌▐░▌ ▐░▌ ▐░▌▐░▌ ▐░▌▐░▌ ▐░▌ ▐░█▄▄▄▄▄▄▄█░▌▐░█▄▄▄▄▄▄▄▄▄ ▐░▌ ▐░▌░▌ ▐░█▄▄▄▄▄▄▄▄▄ ▐░▌ ▐░▐░▌ ▐░▌ ▐░▌ ▐░░░░░░░░░░░▌▐░░░░░░░░░░░▌▐░▌ ▐░░▌ ▐░░░░░░░░░░░▌▐░▌ ▐░▌ ▐░▌ ▐░▌ ▐░█▀▀▀▀▀▀▀█░▌▐░█▀▀▀▀▀▀▀▀▀ ▐░▌ ▐░▌░▌ ▐░█▀▀▀▀▀▀▀▀▀ ▐░▌ ▀ ▐░▌ ▐░▌ ▐░▌ ▐░▌▐░▌ ▐░▌ ▐░▌▐░▌ ▐░▌ ▐░▌ ▐░▌ ▐░█▄▄▄▄▄▄▄▄▄ ▐░▌ ▐░▌▐░█▄▄▄▄▄▄▄▄▄ ▐░█▄▄▄▄▄▄▄▄▄ ▐░▌ ▐░▌ ▐░█▄▄▄▄▄▄▄▄▄ ▐░▌ ▐░▌ ▐░░░░░░░░░░░▌▐░▌ ▐░▌▐░░░░░░░░░░░▌▐░░░░░░░░░░░▌▐░▌ ▐░▌ ▐░░░░░░░░░░░▌▐░▌ ▐░▌ ▀▀▀▀▀▀▀▀▀▀▀ ▀ ▀ ▀▀▀▀▀▀▀▀▀▀▀ ▀▀▀▀▀▀▀▀▀▀▀ ▀ ▀ ▀▀▀▀▀▀▀▀▀▀▀ ▀ ▀ ▄▄▄▄▄▄▄▄▄▄ ▄ ▄ ▄▄▄▄▄▄▄▄▄▄ ▄▄▄▄▄▄▄▄▄▄▄ ▐░░░░░░░░░░▌ ▐░▌ ▐░▌▐░░░░░░░░░░▌ ▐░░░░░░░░░░░▌ ▐░█▀▀▀▀▀▀▀█░▌▐░▌ ▐░▌▐░█▀▀▀▀▀▀▀█░▌▐░█▀▀▀▀▀▀▀▀▀ ▐░▌ ▐░▌▐░▌ ▐░▌▐░▌ ▐░▌▐░▌ ▐░▌ ▐░▌▐░▌ ▐░▌▐░█▄▄▄▄▄▄▄█░▌▐░█▄▄▄▄▄▄▄▄▄ ▐░▌ ▐░▌▐░▌ ▐░▌▐░░░░░░░░░░▌ ▐░░░░░░░░░░░▌ ▐░▌ ▐░▌▐░▌ ▐░▌▐░█▀▀▀▀▀▀▀█░▌ ▀▀▀▀▀▀▀▀▀█░▌ ▐░▌ ▐░▌▐░▌ ▐░▌▐░▌ ▐░▌ ▐░▌ ▐░█▄▄▄▄▄▄▄█░▌▐░█▄▄▄▄▄▄▄█░▌▐░█▄▄▄▄▄▄▄█░▌ ▄▄▄▄▄▄▄▄▄█░▌ ▐░░░░░░░░░░▌ ▐░░░░░░░░░░░▌▐░░░░░░░░░░▌ ▐░░░░░░░░░░░▌ ▀▀▀▀▀▀▀▀▀▀ ▀▀▀▀▀▀▀▀▀▀▀ ▀▀▀▀▀▀▀▀▀▀ ▀▀▀▀▀▀▀▀▀▀▀

Name: Anonymous 2015-05-30 18:52

>>66
=/

Name: Anonymous 2015-05-31 2:52

>>65
I don't like this world.

Name: Anonymous 2015-05-31 3:08

>>68
But you are in it, and I like this world just for that <3

Name: Anonymous 2015-05-31 14:29

>>63

risk of banning

No. They can't silence us. Freedom of speech guarantees us the permission to post gets and checks. If you don't like it then you might as well got to North Korea.

Name: Cudder !MhMRSATORI 2015-05-31 17:34

>>66
FAIL

Name: Anonymous 2015-05-31 19:37

>>70
Methinks thou didst intend to refer to Thane >>64 and not Sir >>63

Name: Anonymous 2015-06-01 14:25

>>72
You are correct.

Name: Anonymous 2015-06-02 4:40

" '-._ ___.....___
`.__ ,-' ,-.`-,
`''-------' ( = ) `._ HAVE YOU SMOKED
`-' \ YOUR MARIJUANA
\ TODAY?
. \
\---..,--'
................._ --...--,
`-.._ _.-'
`'-----''

Dubsoholics Anonymous

1 Name: Anonymous 2015-03-03 6:14

41 Name: Anonymous 2015-03-04 21:47

42 Name: Anonymous 2015-03-04 21:49

43 Name: Anonymous 2015-03-04 23:10

44 Name: Anonymous 2015-03-04 23:15

45 Name: Anonymous 2015-03-05 0:04

46 Name: Anonymous 2015-03-05 2:31

47 Name: Anonymous 2015-03-05 23:24

48 Name: Anonymous 2015-03-05 23:27

49 Name: Anonymous 2015-03-06 10:58

50 Name: Anonymous 2015-03-06 15:41

51 Name: Anonymous 2015-03-06 16:14

52 Name: Anonymous 2015-03-06 16:59

53 Name: Anonymous 2015-03-06 17:21

54 Name: Anonymous 2015-03-06 17:27

55 Name: Anonymous 2015-03-06 18:14

56 Name: Anonymous 2015-03-06 22:23

57 Name: Anonymous 2015-03-07 3:26

58 Name: Anonymous 2015-03-07 3:28

59 Name: Anonymous 2015-03-07 22:15

60 Name: Anonymous 2015-03-07 22:36

61 Name: Anonymous 2015-03-08 4:43

62 Name: Anonymous 2015-05-30 1:29

63 Name: Anonymous 2015-05-30 16:18

64 Name: Anonymous 2015-05-30 16:47

65 Name: Anonymous 2015-05-30 18:06

66 Name: Anonymous 2015-05-30 18:45

67 Name: Anonymous 2015-05-30 18:52

68 Name: Anonymous 2015-05-31 2:52

69 Name: Anonymous 2015-05-31 3:08

70 Name: Anonymous 2015-05-31 14:29

71 Name: Cudder !MhMRSATORI 2015-05-31 17:34

72 Name: Anonymous 2015-05-31 19:37

73 Name: Anonymous 2015-06-01 14:25

74 Name: Anonymous 2015-06-02 4:40