wait minute,we cant post again till we get another like,we need to have more likes or equal likes than posts
LIKE EVERYONE! Like all the posts.
we are 7 away from having more likes than veiws or posts
I did it for you! equal likes and views now.
no! we both did it but more people veiws
41 more likes to go. So many, maybe you can help haha
WE MUST! Get this! To! 300. This is post 286, which is not prime. also is 143*2. 143 is divisible by what? 13 and 11. And 13 is what? The amount of posts we need to 300!
288 is a x digit number where the xth digit to the x = the the other two digits independently,and is divisible by x eeven though none of the numbers independently are and the likes both starts with,is divisible by,and is x long
since 17 is a sign of bad luck …
289 is the sign of squared bad luck.
to check that a number n is prime you only need to try to divide it by any prime which is smaller or equal to sqrt(n).
For example 293 is not divisible by 2,3,5,7,11,13,17. So it is prime.
something that can be updated and stores separately
Cl.Desmos’s AI summarized our thread
In a lively and humorous thread titled “Feedback on optimizing ‘code’?”, user BadAtMath seeks help optimizing their Desmos graph, which resembles Wordle, due to performance issues on their slow computer. They admit being new to Desmos and describe their code as overly complex. NTMDev offers suggestions, such as simplifying logic by comparing target and current letter lists directly instead of using separate “wrong spot” and “wrong letter” lists. The conversation veers into playful banter, with users joking about hitting post milestones — eventually reaching 100 posts, a rare feat — and speculating about earning a “Reader Badge” for long threads. bhssingul and others join in, discussing input validation, random word generation, and even proposing SQL-like database integration for Desmos. Guzman_Tierno contributes thoughtful insights on improving Desmos’s modularity, suggesting namespaces and declarative programming enhancements. They also note BadAtMath’s graph could qualify for the Desmos Art Expo 2025. The thread ends with excitement over hitting 100 posts, jokes about OOP (Object-Oriented Programming), and a brief technical tip from Guzman_Tierno on using the mod operator for decimal division workarounds. The tone is collaborative, humorous, and community-driven, blending genuine coding help with lighthearted milestone celebrations.
when was this made?im going to try its the exact same thing, i think it topped out at 100
Also, I need HELP doing something. notes and explanation here: Nonogram | Desmos
im sorry i cant help
Here is my attempt. I’m taking advantage that between zeros there are stretches of ones. So, I’m filtering to find the indices of locations of 0, including off grid before and after. Then, taking the difference between each of those values (less one) gives the number of 1’s between each. Lastly, filter out the unnecessary 0 differences.
Some knowlegde about primes:
296 = 2^3 * 37 so it has 4 factors … it’s not prime
49 = 7^2 has 2 factors … it’s not prime
7 = 7 has only one factor … it’s prime
1 = 1^0 has zero factors … it’s not prime
[Remember that an empty product is 1
just lilke and an empty sum is 0]
try to prove the pythagorean theroum in as many different ways as you can
Here you have 122 different proofs of the pythagorean theorem:
300 yes we made it!!