Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
This tag is used if a reference is needed in a paper or textbook on a specific result.
1
vote
Thales' semicircle theorem in higher dimensions
Having seen the analyses presented in the other answers and Douglas Zare's comment about difficulties in visualization, I offer a view on the problem that shows how to arrive at a qualitative result ( …
9
votes
3
answers
979
views
$\omega(p^n - 1)$ as $n \rightarrow \infty$
Although I am also interested in the number of distinct prime factors (not counting
multiplicity), today I use $\omega(m)$ to denote the number of (positive) prime
factors (with multiplicity) of the i …
2
votes
Estimating a sum involving binomial coefficients [refined]
You can rewrite it as $$\frac{(m+q)!}{(m-q)!(q!)^2} \sum_{0\leq i \leq m-q} \frac{\binom{m}{i+q}\binom{m-q}{i}}{\binom{m+q}{i+q}}$$, but if W-Z gives a hypergeometric result as in Dima Pasechnik's an …
2
votes
0
answers
398
views
Counting factors: is this approach in the literature on multiperfect numbers?
Does the following approach (or something near it) exist in the number theory
literature?
I will provide some motivation for $\omega(p^n - 1)$ as $n \rightarrow \infty$
and for this question. First, …
2
votes
Inside-out polygonal dissections
Riffing off the tiling comment to another answer, imagine a square penny packing of circles,
and then translate the tiling so that a circle is in the center of four other circles. Now replace
each of …
2
votes
Reference Request for: Finding Large Bipartite Subgraphs via Destruction of Odd Cycles in Gr...
Not a reference, but you might enjoy tinkering with this.
Decide for your graph on two parameters C and M. For each of C-many trials,
two-color the vertices. In each trial, look at the vertices v w …
3
votes
Is “problem solving” a subject to be taught?
To answer your question directly: my educational experience left me going outside of
school for such material. Although I was in some accelerated programs in high school,
I recall no such offerings f …