CURED - 2025-02-19

« first day (4787 days earlier) ← previous day next day → last day (3 days later) »

Ѕᴀᴀᴅ

10:18

→ 127 messages moved to Trash

I moved SmokeDetector's messages to reduce noises, but the spamming situation is getting worse.

Martin Sleziak

I'd say that spam waves of this size are quite common on Super User for example. And perhaps also on Server Fault and Ask Ubuntu. But I do not remember something comparable here on Mathematics.

metasmoke might have some stats.

SmokeDetector

10:54

[ SmokeDetector | MS ] Bad phone number in body, bad phone number in title, potentially bad keyword in body, several emoji in title (286): 𝟭-𝟴𝟲𝟲⇨𝟠𝟚𝟡⇨𝟭𝟮^𝟴𝟯｡How much does British Airways charge to change a flight?‭ by pooja sah‭ on math.SE

[ SmokeDetector | MS ] Bad phone number in body, potentially bad keyword in body, potentially bad keyword in title (102): BOOK NOW*¿Cómo hablo con una persona real en Qatar Airways?‭ by Anika Almeida‭ on math.SE

Martin Sleziak

Number of spam posts on the main site per month and per year.

Number of spam posts per day

List of post flagged as spam between two dates: data.stackexchange.com/math/query/1836614/…

SEDE is updated once a week - the new post should appear in the results of those queries after the weekend.

I guess we can expect bunch of users to get new badges: Citizen Patrol, Deputy - and perhaps even Marshall.

2 hours later…

SmokeDetector

12:59

[ SmokeDetector | MS ] Username similar to website in answer (74): Software Plotting Tropical Curves‭ by ntiggemann‭ on math.SE

3 hours later…

SmokeDetector

15:52

[ SmokeDetector | MS ] Blacklisted user (76): Convergence in L1 of product of convergent function and function in L1‭ by salv100‭ on math.SE

Feeds

16:09

-2

Q: I have a claim and a proof The topic being collatz conjecture (For a special case)

Claim: every number of the for 1111...... in base 2 can be converted to 1 after using the collatz function n times I will be using induction assume a number which is of the form 1111..K(times)..11 is traceble to 1 after some n number of steps now if we prove it for $(K+1)times$ we are done then...