Shaun Isherwood
@shaunlovesmaths.bsky.social
I'm a PhD student in Aberdeen studying group theory, an area of mathematics concerning symmetry. I have schizophrenia.
Assuming the positive square root, the answer is 27.
Use the difference of two squares to get the square root of (243×3), which is 27 (by breaking 243 into into prime decomposition; it is a power of 3).
Easy.
Use the difference of two squares to get the square root of (243×3), which is 27 (by breaking 243 into into prime decomposition; it is a power of 3).
Easy.
September 27, 2025 at 10:59 AM
Assuming the positive square root, the answer is 27.
Use the difference of two squares to get the square root of (243×3), which is 27 (by breaking 243 into into prime decomposition; it is a power of 3).
Easy.
Use the difference of two squares to get the square root of (243×3), which is 27 (by breaking 243 into into prime decomposition; it is a power of 3).
Easy.
Is it modulo one?
September 5, 2025 at 11:50 AM
Is it modulo one?
Nobody takes this shit seriously.
August 17, 2025 at 4:06 PM
Nobody takes this shit seriously.
You've got it bad, huh?
August 17, 2025 at 4:04 PM
You've got it bad, huh?
This is REALLY dumb.
August 17, 2025 at 1:55 PM
This is REALLY dumb.
*of the word "mathematics"
August 11, 2025 at 9:45 PM
*of the word "mathematics"
This appears to me a pleasant misunderstanding. I have enjoyed googling your use of "mathematics".
Enjoy the rest of your day :)
Enjoy the rest of your day :)
August 11, 2025 at 9:44 PM
This appears to me a pleasant misunderstanding. I have enjoyed googling your use of "mathematics".
Enjoy the rest of your day :)
Enjoy the rest of your day :)
You're welcome :)
August 11, 2025 at 9:11 PM
You're welcome :)
For positive integers a and n, (2ª-1)(3ⁿ-1) is never a square.
August 11, 2025 at 9:08 PM
For positive integers a and n, (2ª-1)(3ⁿ-1) is never a square.
Also: here n! is the number of bijections from S to S, where |S|=n. So the number of bijections from Φ to Φ is 1; namely, the empty function.
May 24, 2025 at 7:58 PM
Also: here n! is the number of bijections from S to S, where |S|=n. So the number of bijections from Φ to Φ is 1; namely, the empty function.