5:00 AM
@MamaFunRoll question: what is a MamaFunRoll
pls tell me it isn't something very inappropriate

good question
i really don't know...
although
may help

where is the fun part though
OH GOD IT IS INAPPROPRIATE ಠ_ಠ

hey don't flame me
I got my name off an anagram generator

I got mine from a block of dirt.

I got mine from my name... I feel so unoriginal.

5:15 AM
If it makes you feel bad you can join the klub.
The bulk of the chat users seem to have turned against anagrams though.

5:46 AM
1

Fibonacci Numbers Fibonacci Numbers start with f(1)=1 and f(2)=1 (some includes f(0)=0 but this is irrelevant to this challenge. Then, for n>2, f(n) = f(n-1) + f(n-2). The challenge Your task is to find the n-th positive number that can be expressed as products of Fibonacci numbers. You can ch...

@Bigtoes "bulk" is an anagram of his name :P

`sqrt(15.5556)^cos(32)`

@Upgoat Well yes it is. That was kinda the point. bkul... klub... bulk... :P

oh :|
>_>

<_<

5:56 AM
ಠ_ಠ `<_<` is not an anagram of `>_>`

How many pointers are needed to find the `n`-th perfect power?

1. just point to it

serious question

@LeakyNun usually one
The Pointer, often called the English Pointer, is a medium to large-sized breed of dog developed in England as a gun dog. It is one of several pointing breeds. == Appearance == === Coat and color === The coat of a Pointer is short, dense, smooth with a sheen. They are generally white with either liver, lemon, orange or black markings. Although pointers may have solid coloring in any of these hues, most pointers are primarily white with some body markings. Lemon and white dogs have flesh-colored noses, while Pointers with orange, liver or black markings have dark (black or very dark bro...
these dogs are pretty good at finding stuff

basically it is searching in a 2d sorted array of infinite size

5:58 AM
> Orange and white Pointer pointing
> The pointer points at the pointing Pointer pointing toward the Pointer

chat mini challenge: aproximate pi. pop con. you may not use pi and the result may not be pi

@LeakyNun no kudos for my pointer dog joke :(
@CᴏɴᴏʀO'Bʀɪᴇɴ Cheddar, a couple bytes: `3.141592653589792`

-1. :p

;-; y u do dis
y dragin haet gaot ;-;
waits 15 minutes for tests to complete
gets this:
`YOU MESSED UP! THE RESULT IS  AND THE DESIRED RESULT WAS [1, 2, 3]`
thanks @Quill :P

6:13 AM
@CᴏɴᴏʀO'Bʀɪᴇɴ Closed as duplicate

@Upgoat I will star when all checkboxes are ticked

@Fatalize all checkboxes are ticked, i just need to update >_>
@LeakyNun what is your avatar/what is the red thing?

@Upgoat :)

6:43 AM
Hello

Hello @zʏᴀʙiɴ101!

:)
@Upgoat Could you please come to the zyabinVI beta room?

no :(

Cheddar again?

yea

6:50 AM
:(
What's with Cheddar?
Latest commit strip. c:

7:03 AM

7:19 AM
g'night all!

@Upgoat Night!
@Upgoat But what's with Cheddar?

7:50 AM
c: Chat is dead
No big surprise

1 hour later…
8:52 AM
It is dead :(

RIP

@flawr Chat is dead.
Thanks for reviving it. :)

No problem. I have a cpr certificate.

Hiiiii @Quill

9:03 AM
can we burn this witch pls

@Quill Finished.
I did the final blow.

The existence of The brand new drugs is especially regarding for the reason that There's no information to assistance their basic basic safety, noticeably a lot less their efficacy
Sounds like a Markov Chain generated text

you should see the "get fit" ones
they use like weird seeds about wrestling

how buye supplement? I try for thirtee minuts and no basic basic safety

0

rectangular -> polar code-golfmathgeometrytrigonometry Meta: I'm not yet sure, whether I only should ask for atan2 or for the complete rectangular->polar conversation including the radius. Should the output be in the range [0°, 360°) or [-180°,180°) or [-360°, 360°] or another range, or any a...

9:09 AM
posted on June 18, 2016 by user55536

Staying Power Rx Extreme Countless numerous dietary supplements are now being created each and every month which can be spiked Using these prescription prescription medications — and even worse, fully novel medicine.” The existence of The brand new drugs is especially regarding for the reason that There's no information to assistance their basic basic safety, noticeab

@NewMainPosts Spam.
(I mean the question.)
Burninated.
The feed bot joke department has got a job. :)

9:32 AM
0

Your goal is to make a program that converts a (Black and white) .png image to a .txt file in ASCII, and then save it somewhere. This is a code golf, so the smallest program wins!

@NewMainPosts unclear what you're asking

1 hour later…
10:38 AM
Dead again :)

not dead

10:50 AM
```Vedic method (base 4):
The square root of 25 is 5.
Time elapsed: 2.2E-4 ms.
The square root of 100 is 10.
Time elapsed: 2.1E-4 ms.
The square root of 10 is 3.
Time elapsed: 2.1E-4 ms.
The square root of 10000000000000000 is 100000000.
Time elapsed: 2.4E-4 ms.
The square root of 12345678987654321 is 111111111.
Time elapsed: 2.6E-4 ms.
The square root of 18446744073709551615 is 4294967295.
Time elapsed: 2.9E-4 ms.
The square root of 18446744065119617025 is 4294967295.
Time elapsed: 2.9E-4 ms.
The square root of 18446744065119617024 is 4294967294.```
```public class Integer_sqrt_compare {
public static String unsigned_long_to_string(long l){
//calculate remainder modulus 10
long remainder = 0, quotient = 0;
while(l < 0){
l -= 0x5000_0000_0000_0000L;
quotient += 0x0800_0000_0000_0000L;
}
remainder = l%10;
quotient += l/10;
if(quotient > 0){
return Long.toString(quotient)+Long.toString(remainder);
}else{
return Long.toString(remainder);
}
}
public static String unsigned_int_to_string(int i){
//calculate remainder modulus 10```
But, I made a slight optimization for the binary search for small numbers
The Vedic method is O(1) time
What's the fastest integer square root method?

11:03 AM
Depends on your number range, probs. First thing I can think of is Newton's

i'm doing long
is Newton's faster than binary search?

@MartinEnder @Doorknob @AlexA. @Dennis Can you please unpin that.. Its not really an important or a concrete fact :) "soon", "under review" etc. etc.

Newton's converges quadratically, so maybe? Not sure
Probably for bigger numbers, at least

binary search is polynomial time
so is vedic's method
actually, it is linear time
I think Newton's method is substantially the same as binary search

Not really - with binary search each division only gives 1 extra bit of information

11:11 AM
Newton's method is O(sqrt(n)) ?

What's `n` here?

the number of digits

Hmm... not actually sure if it might be log or not
Thing is Newton needs divisions, while binary search can do with multiplications

True

Doing some reading and it seems like if your computer has a number-of-leading-zeroes instruction, you can use that to get a pretty good initial guess to kick off the algorithms

11:26 AM
eh... how do I do it in Java?

looks at Java docs `Integer.highestOneBit`? Maybe

ok, thanks

@Sp3000 Their algorithm is so efficient
It isn't a native method
```     public static int highestOneBit(int i) {
// HD, Figure 3-1
i |= (i >>  1);
i |= (i >>  2);
i |= (i >>  4);
i |= (i >>  8);
i |= (i >> 16);
return i - (i >>> 1);
}```
```public static int  lowestOneBit(int i) {
return i & -i;
}```

12:20 PM
`33598856662431775531720113029189271796889051337319684864955538153251303189966833836154162164567900872970453429288539133041367890171008836795913517330771190785409`
Identify what is special about this number

It's very big

`3.3598856662431775531720113029189271796889051337319684864955538153251303189966833836154162164567900872970453429288539133041367890171008836795913517330771190785409`

it has a lot of threes in it

sum of reciprocal of Fibonacci sequence
The sum of reciprocals of primes do not converge :o

12:38 PM

1:08 PM
hallo

@Dennis Can you pull MATL whenever you have time? No hurry at all, just when you are around

@LuisMendo "Whenever you wish."
"But only after I finish the flags first."

@zʏᴀʙiɴ101 can you stop that?

I can.

Please stop.

1:22 PM
@zʏᴀʙiɴ101 ? What flags?

@LuisMendo Post and comment flags. >_>
Mods always deal with these flags.

comment flags yes, post flags go to the review queue except spam, rude and mod flags

Chat mini-challenge: Write a function to right-pad a string.

@zʏᴀʙiɴ101 Ah :-)

Example: `Q("abcde", 8, "_")` ==> `"abcde___"`
Another example: `Q("correc", 7, "t")` ==> `"correct"`

1:27 PM
Pyth, 4 bytes: `.[.*`

builtins allowed?

@Upgoat Nope. :P

@muddyfish -._(._.)_.-

1:49 PM
any opinions on this?

Looks good to me.

PUPPY

Hey, you guys remember Felix Baumgartner, the guy that sky-dived from the edge of space? Check this out: imgur.com/gallery/vAYiB8T

O_O

2:06 PM
@flawr seems fine to me too

2:31 PM
TIL 2 is both prime and highly composite

what an irony

@trichoplax As always, it heavily depends on the ring.
@muddyfish Which version would you do?

I'm leaning towards `atan2` only, since you're forbidding using that built-in.

@flawr I was only thinking of the natural numbers - my mind is boggled enough for one day...

2:38 PM
only atan2 - what does finding `r` do for the challenge

Yeah, I just saw trichoplaxes comment.
@trichoplax How is it composite as part of the natural numbers?

@flawr It has more divisors than any number smaller than it
@flawr It's not composite, but it is highly composite

@trichoplax 0?

@Fatalize Yes it only works in the natural numbers. If you include zero it's hard to define highly composite

0 is typically excluded in such matters since it usually trivializes everything.

2:41 PM
@flawr That also solves my issues with functions for the radius

@trichoplax Oh=) TIL it is also a superior highly composite number (1)

@flawr I feel that the use of "composite" in these terms is very misleading :)

@trichoplax It seems that it only affects even prime numbers. And it is conjectured that these are only finitely many.

Is it clear enough now?

2:54 PM
@trichoplax It's perfectly appropriate. The problem is that the way they are defined means that the first number with more than 1 divisor is included...which means the first prime number in this case.

@El'endiaStarman Just though the same thing=)

@El'endiaStarman It means including 1 too, which also makes my brain itch

I announce 30-second stand ups, where you have to describe the topic in 30 seconds! =)

Let us ban all prime numbers.

2:55 PM
Well, 1 has 1 divisor...

I agree it makes sense, but a word other than "composite" would have saved my poor brain

@zʏᴀʙiɴ101 Golf is fun. Less than 30 seconds.

Is there a name for numbers `n` that have `n` divisors?

probably

2:56 PM
@EᴀsᴛᴇʀʟʏIʀᴋ You'll be given 30 seconds, that you may only use partially at all.

i did
that was 30 seconds

@El'endiaStarman I think so, let me see!

1 divisor: The unit
2 divisors: prime
3 divisors: semi prime

@flawr You should probably ban functions that compute the argument (angle) of a complex number

@LuisMendo Thanks, so I'd have to ban quaternions too?=)

2:58 PM
@trichoplax Semiprimes have `4` divisors.
3 divisors: square of prime

@flawr I hardly know what quaternions are :-)

@LeakyNun Oh yeah...
@LeakyNun I think that's still a semiprime, but it does have 3 divisors

I thought semi-primes were the product of two primes.
So it could have three or four divisors depending on whether the two primes are the same.

@El'endiaStarman True. 10 is 2*5, which has divisors 1, 2, 5, and 10

Describe the weather outside in 30 seconds.

3:00 PM
@flawr Wait, aren't 1 and 2 the only such numbers? All divisors of `n` are less than or equal to `n`, so...
@zʏᴀʙiɴ101 Sunny. Warm.

@zʏᴀʙiɴ101 I can't predict the future

Boom. Two seconds.

@El'endiaStarman Oh, lol. =)

4 divisors: product of two distinct primes or the cube of a prime

@flawr To be fair, it took me time to realize my error. :P

3:01 PM
@El'endiaStarman I also read this as "numbers that have n divisors" and completely missed the other n...

@El'endiaStarman I confused the divisor-counting function with the divisor-sum function

Okay, this was just a warmup.

@flawr Oooh, for divisor-sums, look into amicable numbers.

Now the real 30 second stand-up starts.

@El'endiaStarman that would be the perfect numbers

3:03 PM
Rules: you wait until you're up.
When I say that you're up, the 30 seconds start.
You may use part or all of that time to describe the topic.

@zʏᴀʙiɴ101: First, find out who is interested in playing your game. I for one am not.
@flawr Well, true. Perfect numbers for when the sum of divisors is the number itself. Amicable numbers are for pairs where the sum of divisors of one number is the other number.

I'll say when 30 seconds are up.
Who's in?
keeps hands down

crickets

@El'endiaStarman keeps hands down

tumbleweed

3:05 PM
Does "amicable numbers" also apply to chains?

What chains?

> thumbleweed -- flawr 1m ago

@flawr divisor sum of a is b, that of b is c, that of c is d, that of d is a
@El'endiaStarman nope, they only come in pairs
> Numbers that are members of an aliquot sequence with period greater than 2 are known as sociable numbers.

@LeakyNun Oooh, okay. That's cool.

3:08 PM
Alright now, no one is interested in the game.
Thanks for keeping all your attention at anything except me. >_>

who would have thought

@flawr Huh, interesting.
It's cool sometimes to see how a concept is generalized in different ways.

I'll repeat the question. Who's interested in 30-second stand ups? >_>
everyone keeps hands down <_<

@zʏᴀʙiɴ101 tempted to flag as spam

Find integers `a`, `b`, `c` such that `a^3+b^3+c^3=30`
Hint: a solution exists.

3:15 PM
@flawr So, you're sure that no one is interested in the game.

@LeakyNun Is it 33 that we don't have a solution for yet?
Also, have you been watching Numberphile's recent videos? :P

@El'endiaStarman so you watched the video? Or just you are too knowledgeable
LOL

Thanks. I may now safely forget chat.
;_;

@LeakyNun Is it big?

@Fatalize Yes

3:16 PM
@LeakyNun `[I:J:K]:{=:3^.}a+30` will unify the input with [I, J, K] once it finds it

@Fatalize Good luck with that.

which will take a while

No seriously, do not try it.

I'm not gonna wait don't worry

@Fatalize Let's practice RSA cryptography shall we?

3:17 PM
wut

you give me the public keys, and I encrypt the solution to you
I've never done real life RSA encryption before

Me neither, and I don't miss it

but I miss it, so please do it

@zʏᴀʙiɴ101 Thanks for respecting what others are interested in

(actually my code won't work because it will backtrack on K infinitely instead of backtracking on three at the same time)

3:19 PM
@Fatalize but if you're really not interested then let's just give up

@trichoplax Thanks for wanting me to leave chat forever.
;-; ಠ-ಠ

@zʏᴀʙiɴ101 It's good to have you back :)

Not everyone spends 100% of their attention on the chat at all time

@LeakyNun It's decryption that's interesting really
I mean encryption is just `M^e mod pq` so

@quartata Well, he would decrypt himself, and I can only encrypt
only he has the private key

3:21 PM
@LeakyNun Right, I'm saying that you're not missing much with "real life RSA encryption"
The decryption is the interesting part

@quartata sure

@LuisMendo Done.

@Dennis Thank you. I see you gave a kick to the server too :-)

@LeakyNun (Is this cheating?) Found them! ckrao.wordpress.com/2012/04/10/…

Alright now, last time asking. If no one answers it, I forget chat out of my browser.

3:30 PM
@El'endiaStarman Well, it's also in the Numberphile's video, so...

Who's interested in 30-second stand ups? :|

@LuisMendo Yeah, not sure what was going wrong. Apache needed a restart, but whatever process freezed it had died already.

forgets chat out of the browser

finally

@LeakyNun This will work: `[I:J:K]:+a[M:N:O],M>=N>=O,?=:{:3^.}a+30`

3:35 PM
@Fatalize No, nothing you post will work.

For 29 the first 3 are:
Z = [3, 1, 1] ;
Z = [4, -3, -2] ;
Z = [-20, 18, 13] .
@LeakyNun It will, it has infinite integer precision. It will take a really, really long time though

@Fatalize which is the same as it won't work

@LeakyNun For an ultra finitist, maybe

@flawr What was that all about?

about zyabins quest to annoy ppcg users=)

3:37 PM
3
@LuisMendo I agree with that message, but still ಠ_ಠ

@LuisMendo Challenge is posted!

@flawr eye twitches

@flawr I saw. First upvote! :-)

@EᴀsᴛᴇʀʟʏIʀᴋ Whats wrong with your eye?

other eye twitches
I actually do have an eye twitch problem IRL though.
hahahaha

3:42 PM
Hello, are HDLs such as Verilog appropriate as solutions for this site's questions? I can't seem to find anything on meta suggesting yes or no, or any I/O restrictions.

High density lipoprotein???
HDL?

@flawr I NEVER annoy PPCG users!

flags as lying

@zʏᴀʙiɴ101 he says using bold text

@zʏᴀʙiɴ101 seriously, stop.
6

3:44 PM
@zʏᴀʙiɴ101
2

^
@hexafraction if it is a type of assembly, then sure

@EᴀsᴛᴇʀʟʏIʀᴋ One question: nope.

you might have to figure out a scoring method though, idk if verilog uses bytes

@flawr Another question: Nope.

@zʏᴀʙiɴ101 1. That's not a question. 2. Seriously, please stfu.

3:45 PM
@EᴀsᴛᴇʀʟʏIʀᴋ 1. Nope. 2. Nope.

@EᴀsᴛᴇʀʟʏIʀᴋ It's completely text-based. It's just not sequential and is used to describe a physical hardware design to an FPGA compiler.

@zʏᴀʙiɴ101 next time you are annoying, i'm flagging.
We've warned you enough.
@hexafraction oh cool
then sure

Byte-counting is the lest of my worries; more so the fact that input/output is really weird. I don't believe any other languages out there use a clock signal alongside I/O.

o_O

Was that flagged 3 times?

3:47 PM
idk
i flagged once
I gtg eat, bye!

drinkbai

don't burn the place down/ summon CMs/ summon the allmighty Shog9 without me.

bon appétit

ooh we have crêpes

I missed the post, I missed drama ;-;

3:47 PM
?

@EᴀsᴛᴇʀʟʏIʀᴋ you dropped a ^

4

Sometimes it really is a struggle to convert cartesian coordinates (x,y) to polar coordinates (r,phi). While you can calculate r = sqrt(x^2+y^2) quite easily, you often need some distinction of cases when calculating the angle phi because arcsin,arccos and arctan and all other trigonometric funct...

@Fatalize carrot flavored crepes?

@Fatalize fixed?

@EᴀsᴛᴇʀʟʏIʀᴋ y

3:48 PM
ty for you halp
bai

4:01 PM
Guten morgen!

@zʏᴀʙiɴ101 I'm cancelling the automatic suspension that happens when several people flag a post at once. A lot of the time you are an interesting part of the conversation, but please hold back on pushing the topic you want. If we all flow with the topics the room is interested in the conversation will go much more smoothly :)

@DrGreenEggsandIronMan God morgon.

@LuisMendo Does MATL have a reverse array command?
Or vector, or whatever it calls them

@DrGreenEggsandIronMan `XP`
Or just `P`, i am not sure.

Oh, that's the answer. I thought it was a smileyface.
2
Yeah, it's P

4:09 PM
@DrGreenEggsandIronMan Happens too often with golfing languages=)

Haha, we need an esoteric language where everything is a smiley.

@trichoplax Ah, whatever.
I'm still not going to chat today anyway.

@DrGreenEggsandIronMan You mean Emoticonomicon? Did I spell that right?
It's one of @CᴏɴᴏʀO'Bʀɪᴇɴ's languages.

@zʏᴀʙiɴ101 Whenever you're ready :)

4:12 PM

@Adnan Oh wow, I was close.

@El'endiaStarman :)

4:25 PM
@DrGreenEggsandIronMan For a vector (row or column) use `P`, yes. In general, for 2D arrays (such as matrices) or multidimensional arrays , `P` reverses along the first dimension which is not singleton. `XP` always reverses along the first dimension

4:52 PM
Hmmm... I want a cup of coffee, but I don't want to go to the store to get beans.
It's quite the dilemma.

I hear you can also use pizza as programming fuel

@DrGreenEggsandIronMan What's going on on the right-hand side? o.O

Oh the little white border?
`¯\_(ツ)_/¯`

4:58 PM
@trichoplax I though erdos said that?

Haha, that's hilarious. I've heard that quote so many times, but I never knew where it came from.

@Maltysen Yes he did too