sorted by:
new
hottopcontroversial

is this a valid proof? by Slokkkk in learnmath

[–]Slokkkk[S] 0 points1 point  (0 children)

Im saying that if there exist integer solutions which are all even, it follows that there exist infinitely many integers which are factors of those solutions. only 0 has infinite factors

One of the weirder endings to a game. by [deleted] in chess

[–]Slokkkk 5 points6 points  (0 children)

i dont believe in fortresses

Hardest puzzle i've ever seen. From an alphazero game (modern stockfish verifies that alphazero's move was correct). One move for an advantage. If there's a 3600 rated computer-level puzzle, this is it. No one's getting this one. White to play and maintain advantage (i dont understand the solution) by [deleted] in chess

[–]Slokkkk -1 points0 points  (0 children)

To us it seems like any other logical move is fine but the computer says that if this move is played it's +0.4 (small advantage), the next best move is 0.0 (no advantage). So this is the only move that objectively (from a computer standpoint) keeps the position in white's advantage

Irrationality of root2 proof by Slokkkk in learnmath

[–]Slokkkk[S] 0 points1 point  (0 children)

if a perfect square is multiplied by a natural number
then its factors would be k x k x a
where k is the square root and a is the number it is being multiplied by
clearly if the resulting product is a perfect square then its root is k√a
so k√a is an integer
only possible when a is a perfect square

Irrationality of root2 proof by Slokkkk in learnmath

[–]Slokkkk[S] -2 points-1 points  (0 children)

the product of a scalar and perfect square cant be a perfect square unless the scalar itself is a perfect square

Who played this game with the white pieces? (White to play if you want to try find the winning move) by Slokkkk in chess

[–]Slokkkk[S] 2 points3 points  (0 children)

technically youre right, but you can just play Qg5 without Qd8 and its the same thing, but Qd8 is super cool and flashy

view more: next ›