« first day (5135 days earlier)      last day (2 days later) » 

noodle person
noodle person
00:18
So you're saying snakes on a plane, a specific type of plane? — pipe 2 hours ago
(snakes on a 2xN grid challenge)
rydwolf
rydwolf
00:29
Kinda nostalgic for my Dell internship, it was pretty fun honestly
Might just be part of the generalized nostalgia I have for January through August though since that was when I had the apartment lol
l4m2
l4m2
01:29
@Mukundan314 By defining 0^(-1)=0, any issue?
 
2 hours later…
Mukundan314
Mukundan314
03:41
@l4m2 wdym by this? also powmod(b, mult(phips)-1, m) isn't correct when b and m are not coprime right?
l4m2
l4m2
2^-1 mod 6 is same idea as 0^-1 I guess
Mukundan314
Mukundan314
03:57
sorry I still don't understand what you mean, are we defining the modular inverse as zero when it doesn't exist?
 
1 hour later…
l4m2
l4m2
05:02
Yes. Will it suffer issue like (a^^b)%(mn)%m != (a^^b)%m?
 
7 hours later…
Themoonisacheese
Themoonisacheese
11:33
@emanresuA really had to wait 3 years for my port just to golf yours huh
(nice golf btw)
 
1 hour later…
Rosario
Rosario
12:53
2×1=2 2×2=4 2×3=6 what is 2^-1 mod 6? It seems not exist
Simd
Simd
mod 6 doesn't make a finite field because 6 is not a prime number
2^-1 mod 5 exists
as does 2^-1 mod 7 exists
Rosario
Rosario
2x4=8 2x5=10 it would be 2 4 0 2 4 there is no 1
5x5=25 25%6=1 and 5^-1 mod 6= 5
Possible nor exist inverse of m, in n if gcd(m,n)!=1
 
4 hours later…
New Posts
New Posts
16:45
0
Q: Basic Uiua Planet Notation

noodle personUiua is a stack-based array programming language, and with the great power of a stack comes the great responsibility of having to manage it. In this task you will take on the role of the Uiua interpreter for a small subset of the language concerning the rearranging of values on the stack. If you'...

code-golf uiua
 
1 hour later…
emanresu A
emanresu A
17:54
@Themoonisacheese Didn't even notice that you'd posted that :p - just saw that my answer had gotten an upvote and realised I could save two bytes on it
RubenVerg
RubenVerg
18:16
nice problem from today's math competition I'm probably allowed to share
there's a 2025x2025 grid filled with integers
* you know the sum of each row and the sum of each column (labeled); prove you can't reconstruct the table
* you know the sum of each orthogonal pair (labeled) and the total sum of the grid; prove you can reconstruct the table
* you only know the sum of each orthogonal pair (still labeled); can you reconstruct the table?
l4m2
l4m2
19:05
orthogonal pair mean (x,y)-(x,y+1) or (x,y)-(x+1,y+1)?
 
2 hours later…
RubenVerg
RubenVerg
20:52
@l4m2 (x,y)-(x,y+1) and (x,y)-(x+1,y)
 
1 hour later…
jan
jan
22:09
the other solutions on the web server I just golfed are more than half as old as me.
Unrelated String
Unrelated String
...wow. yeah, same
jan
jan
22:31
by the way, I put in unsafe code so it doesn't crash if the bytes in the path name make up "surrogates". I still don't really understand how surrogates work, so I don't know if this is necessary. For example, It's really hard to type them, if that even makes sense.
Ginger
Ginger
each Unicode character is identified by a 32-bit unsigned integer; surrogates are a way to represent high-numbered characters with two 16-bit unsigned integers instead
wikipedia has a more thorough explanation if you're curious; I would also suggest reading joelonsoftware.com/2003/10/08/…
jan
jan
23:15
ok. httpwg.org/specs/rfc9112.html forbids parsing HTTP/1.1 headers as Unicode (because it introduces ambiguity about what a LF is). Does that mean I theoretically have to decode URL encoding (%30) ?

« first day (5135 days earlier)      last day (2 days later) »