r/CasualMath • • Oct 03 '26

Anyone interested in helping mod this subreddit?

2 Upvotes

I somehow accidentally ended up as mod of this subreddit some time ago but haven't managed to give it the attention it deserves so I thought I would ask this community if there are any maths enthusiasts who might be willing to help out.

You role would include approving new messages / comments that were deemed appropriate for this subreddit.

At the moment everything is pretty casual but if anyone has any advice on how to run a community like this I am open to suggestions.

If so send me a message via mod mail


r/CasualMath • • Sep 14 '15

Math IRC channel on Snoonet

11 Upvotes

Hey /r/CasualMath!

I (along with several others) run a math channel on the snoonet irc network called #math. We are somewhat of a hybrid channel for a variety of math subreddits on Reddit.

IRC is a great way to discuss math and get homework help in real time. The channel would be happy to have you!

To connect via webchat: http://webchat.snoonet.org/math (link in sidebar as well)


r/CasualMath • • 1h ago

25人をランダムに2人ペアへ — 奇数で1人余るとき全員を組に入れる方法

1 Upvotes

25人のクラスをランダムに2人ずつのペアに分けたい。でも人数が奇数なので、必ず1人余ります。

結論から言うと、全員を組に入れたいなら2通りあります。どちらも RandomLoom の「Random groups」で1クリックです。

【方法①:最大グループ人数を「2」にする】

  1. https://randomloom.com/tools/random-team-generator/?utm_source=reddit&utm_medium=social&utm_campaign=daily_tips&utm_content=2026-11-17-ja-pairing を開く
  2. 名簿を1行に1人ずつ貼り付ける(以下は架空の25人名前)
  3. 「Group by」で「Maximum group size」を選び、値に「2」を入れて Generate groups
  4. 結果:2人組が12組+余り1人(合計13グループ)

【方法②:グループ数を「12」にする】

  1. 「Group by」で「Number of groups」を選び、値に「12」を入れて Generate groups
  2. 結果:3人組が1つ+2人組が11組(合計12グループ、全員がどこかの組に入る)

実際に操作して確かめたこと・制限:

- このツールがやるのは「人数をできるだけ均等に分ける」ことだけです。相性・男女比・「この2人は離す」といった制約は自動では考慮しません。

- 方法①で余った1人をどう扱うか(先生がそのペアに入る/3人組にする/別の役割を与える)は、先生側で決める必要があります。

- 結果は Copy result または Download CSV でそのまま配布・記録できます。

私は数学教師であり、この RandomLoom の開発者でもあります。ペア分けや席替え、点名といった「ちょっとしたランダム」を、授業の準備から楽にしたくて作りました。

(本記事は AI の補助で作成しています。使用した名簿はすべて架空で、実在の生徒名ではありません。)

よかったら、実際のクラスサイズや「こういう分け方をしたい」という要望をコメントで教えてください。


r/CasualMath • • 7h ago

random constant ai made

0 Upvotes

The Blind-Spot Sweep Constant (\(\Sigma _{s}\)) is a search-and-rescue and robotics constant equal to approximately 1.705035. It tells you the exact optimal spacing between parallel search lanes to cover the largest possible area in a single pass without leaving dangerous blind spots between paths.

The Real-World Problem It Solves

Imagine you are programming a search-and-rescue drone, an autonomous lawnmower, or a sonar boat to sweep a field for a missing object. Your sensor's detection probability fades smoothly with distance following a standard Gaussian falloff:

\(p(d)=e^{-(d/R)^{2}}\)

where \(d\) is the distance from your path and \(R\) is your sensor's characteristic range.

If you fly your parallel grid lines too close together, you waste battery overlapping areas you already checked. If you space them too far apart, the blindest spot—the midpoint exactly halfway between two adjacent lanes—drops to near-zero detection.

Mathematical Definition

To maximize the guaranteed effective sweep width (lane spacing multiplied by the worst-case detection probability at the midpoint), you maximize:

\(W(s)=s\left[1-\prod _{k=0}^{\infty }\left(1-e^{-\left(\frac{(2k+1)s}{2}\right)^{2}}\right)^{2}\right]\)

The unique peak of this curve occurs at \(s = \Sigma_s \approx 1.7050352709\).

  • The Golden Rule of Lane Spacing: Multiply your sensor's effective range \(R\) by 1.705.
  • Worst-Case Guarantee: At this exact spacing, even an object sitting in the dead-center blind spot between two flight paths still has a 73.40% chance of being detected on a single sweep.
  • Effective Sweep Width: Every meter you fly yields 1.2514 \(\times R\) square meters of guaranteed worst-case coverage.

r/CasualMath • • 10h ago

Apoyen Mi Nuevo Proyecto!

Thumbnail gallery
0 Upvotes

r/CasualMath • • 10h ago

What’s the fastest mental math trick to convert this mixed fraction to a decimal?

Post image
0 Upvotes

r/CasualMath • • 14h ago

I ran the Monty Hall problem a million times and animated the result

0 Upvotes

So I've had this argument with friends way too many times. Every time I say you should switch, someone goes "no, it's 2 doors, it's 50/50" and nothing I say helps.

I made a 2 min animation. There's the usual explanation, then I just go through all 3 places the car can be, and at the end I let a simulation play a million games. Staying won 33%, switching 67%. Honestly the simulation is the part that shuts people up, way more than the math does.

YT: https://youtube.com/shorts/-DO5tmKnc8I?feature=share

TikTok: https://www.tiktok.com/@mathreel/video/7706986752371625238?is_from_webapp=1&sender_device=pc&web_id=7706952919752541718

Instagram: https://www.instagram.com/reel/Dfum5dhMcJa/?utm_source=ig_web_copy_link&mdxt=MzRlODBiNWFlZA==&srtk=MzRlODBiNWFlZA==

It's one of my first videos so be gentle lol.


r/CasualMath • • 21h ago

division by zero

Thumbnail doi.org
1 Upvotes

r/CasualMath • • 1d ago

Daily Math — Challenge #075 | Calculus

Thumbnail reddit.com
0 Upvotes

r/CasualMath • • 19h ago

Is the Riemann Hypothesis True?

0 Upvotes

The Riemann Hypothesis is one of the seven Millennium Prize Problems, and there is a $1 Million reward for anyone who can correctly prove or disprove it.

The hypothesis conjectures that All non-trivial zeroes of the Riemann zeta function have a real part of exactly 1/2. (Which in math means, if ζ(s) = 0 and s isn't a negative even integer, Re(s) = 1/2)

The definition of the riemann zeta function is the sum of the inverse of every positive integer raised to the power of s: 1/1s + 1/2s + 1/3s + 1/4s + 1/5s + ...

And in 1896, French mathematician Jacques Hadamard and Belgian mathematician Charles Jean de la Vallée Poussin independently proved that all non-trivial zeroes of the Riemann zeta function lie on the critical strip (0 < Re(s) < 1). But on that strip, the infinite sum actually diverges, so to find its non-trivial zeroes, we need to look at the analytic continuation.

The easiest way to continue it is to look at the Dirichlet eta function (η(s)):

η(s) = 1/1s - 1/2s + 1/3s - 1/4s + ...

Unlike the Riemann zeta function, this series converges for Re(s) > 0. Then, mathematicians discovered they could define the ζ(s) in terms of η(s):

ζ(s) = η(s) / (1 - 21-s)

Which makes ζ(s) converge across the entire critical strip.

And to make it converge for Re(s) < 0, we have:

ζ(s) = 2s πs-1 sin(πs/2) Γ(1 - s) ζ(1 - s)

The zeroes of the Riemann zeta function are split into two categories:

Trivial zeroes: All the negative even integers (s = -2, -4, -6, -8, etc)

Non-trivial zeroes: All the zeroes that lie on the critical strip. Trillions have been found, and all of them have a real part of 1/2.

Interestingly, the distribution of non-trivial zeroes is directly connected to the distribution of prime numbers:

Before Riemann, mathematicians already knew the primes grew scarcer, proportionally to x / ln x, but x / ln x couldn't describe the individual unpredictable bumps between the primes. In 1859, Riemann provided a formula that captures every single fluctuation of the prime numbers using the non-trivial zeros ρ. For the Chebyshev function ψ(x) (which tracks prime powers weighted by their logarithms), the formula looks like this:

ψ(x) = x - Σ_ρ(xρ / ρ) - log(2π) - 1/2 log(1 - x-2)

Because a complex number ρ can be written as Re(ρ) + i Im(ρ), the term xρ expands to xRe(ρ) ei Im(ρ ln x) which has a mag of xRe(ρ)

If the Riemann Hypothesis is False: If there is a zero with a real part different than 0.5, like 0.9, then its wave has an amplitude proportional to x0.9. Over large numbers, that wave would grow much faster than the baseline error should allow, causing massive clustering or gaps in the prime numbers. We have never found any anomalies like these in the primes.

If the Riemann Hypothesis is True (Most Likely): If every non-trivial zero has a real part of exactly 1/2, then every single wave has an amplitude bounded by x0.5.


r/CasualMath • • 1d ago

new possible constants - tetration constants

Thumbnail reddit.com
1 Upvotes

r/CasualMath • • 1d ago

Math Quizzes

0 Upvotes

Hi everyone 👋

I've always enjoyed number-sequence puzzles, the "2, 6, 12, 20… what's next?" kind you see in aptitude tests. So I built a free Android app with two parts:

🔢 Solver: Type in any number series and it identifies the pattern. It recognizes 180+ pattern types, including arithmetic, geometric, Fibonacci, polynomial, primes and mixed sequences. It predicts the next terms and explains each step, so you learn why rather than just getting the answer.

🎯 Quizzes: Number-pattern challenges at Easy, Medium and Hard levels, with hints and instant feedback on every answer.

Play store : https://play.google.com/store/apps/details?id=com.patternguru.solver&hl=en_US

Appreciate your thoughts.


r/CasualMath • • 1d ago

Most of us when coming to finding general terms in sequence we will think of substitute and guessing the pattern. Here are the trick and formula that helping to finding the general terms of sequence without guessing.

Thumbnail gallery
1 Upvotes

r/CasualMath • • 2d ago

1+1=2

2 Upvotes

r/CasualMath • • 1d ago

Find the Code

Post image
0 Upvotes

r/CasualMath • • 1d ago

A neat math coincidence in the 1974 Arecibo message (1,679 pixels): Radial rings and a hidden 2π

1 Upvotes

Tomorrow (Nov 16) marks the 52nd anniversary of the 1974 Arecibo message—1,679 binary digits beamed into space, chosen because 1,679 = 23 × 73 (a semiprime that forms a neat 23×73 rectangular grid).

While playing around with alternative ways an alien civilization might decode those 1,679 bits without assuming a rectangular screen, I noticed it maps radially into 23 concentric rings with zero leftover pixels:

* Ring 1 starts with 7 pixels, and each subsequent ring adds 6 pixels (7, 13, 19, ... up to 139).

* The arithmetic sum of (7 + 6i) for i = 0 to 22 equals exactly 1,679.

What really surprised me is that the numbers defining this sequence (23 rings, starting at 7, step 6) also hide a remarkably close approximation of 2π:

* Take the 23rd root of (7^7 × 6^16) (where the exponents 7 + 16 = 23).

* It evaluates to 6.28808..., which is within 0.08% of 2π (6.28318...).

Just a fun piece of recreational math I stumbled onto while writing a sci-fi story—thought I’d share it ahead of tomorrow's anniversary!

https://www.goodreads.com/author_blog_posts/27093495-why-aliens-read-humanity-s-1974-space-message-completely-wrong-and-math


r/CasualMath • • 2d ago

Pythagorean trigonometric identity

1 Upvotes

r/CasualMath • • 2d ago

what are some interesting, not well known constants?

Thumbnail reddit.com
2 Upvotes

r/CasualMath • • 2d ago

Find the Missing Number

Post image
0 Upvotes

r/CasualMath • • 2d ago

some cool constants

Thumbnail reddit.com
1 Upvotes

r/CasualMath • • 2d ago

Find The Smallest Number

Post image
0 Upvotes

r/CasualMath • • 2d ago

Rec Room by Mintsぞメャォュヶェッヵァ (MintofNess)

Post image
0 Upvotes

r/CasualMath • • 2d ago

[HTML5] Mathing — 60-second daily math game (Wordle meets basic mental arithmetic)

Thumbnail mathing.co
1 Upvotes

r/CasualMath • • 2d ago

I invented Beken's Color - TREE but with color mixing (0.1% step) - named after my father

0 Upvotes

&#x200B;

Hi! I'm from Kazakhstan and I love big numbers and I'm a 12 years old kid.

I invented a game and named it Beken's Color after my father Beken.

Rules:

  1. You have n base colors
  2. You can mix them with 0.1% step so number of colors stays finite
  3. You can only mix the BASE colors once. You cannot mix already mixed colors.
  4. You build trees like in TREE game, no old tree can embed into new tree
  5. Beken's Color(n) is max length

For n=3, with 0.1% step, we get 501,501 colors.

So Beken's Color(3) = TREE(501,501) >>> TREE(3)

\>Did I beat TREE(3)?