284 reputation
12
bio website
location
age
visits member for 4 years, 4 months
seen Jan 29 '11 at 21:34

Jul
29
awarded  Yearling
Aug
11
comment Calculate the remainder when there are division
Yes, I read the FAQ. I invite email from a moderator regarding signatures. [signature removed by moderator]
Aug
11
answered Calculate the remainder when there are division
Aug
11
comment Cancellation of Direct Products
You might also mention cancellation in finite structures of the same type. Under certain mild conditions, nth roots are unique (Lovasz) and cancellation is possible. The phrase "algebra with zero" comes to mind. Perhaps you can provide more detail? [signature removed by moderator]
Aug
11
answered Mean of highest exponent in prime factorization of all integers ≥ 2
Aug
11
awarded  Editor
Aug
11
revised Bertrand's Postulate
typo fix
Aug
11
answered Bertrand's Postulate
Aug
11
comment Degree Sequence of a Graph
And why can't the sequence 0,1,2,...,N-1 be a degree sequence? [signature removed by moderator]
Aug
11
comment Degree Sequence of a Graph
Perhaps. For this problem, it felt more like an answer. [signature removed by moderator]
Aug
10
answered Degree Sequence of a Graph
Aug
9
answered Counting placing items in bins according to boolean restrictions
Aug
8
answered Number of ways to partition a rectangle into n sub-rectangles
Aug
5
comment Distinct Hamiltonian cycles of the icosahedron and dodecahedron
Good. Here is an observation for certain (transitive?) 3-regular graphs. You can pick an arbitrary vertex and two edges from that vertex as a necessary part (from transitivity) of any hamiltonian cycle. The nonselected edge has another vertex which determines two other edges in the cycle. Call this collection of 4 edges a "widget". Now there are only so many ways to place two such widgets on a dodecahedron. You are then well on your way to enumerating all the distinct hamiltonian cycles. [signature removed by moderator]
Aug
5
comment Distinct Hamiltonian cycles of the icosahedron and dodecahedron
Perhaps I do not understand what you mean by distinct. I think there is only one such cycle on the edges of the cube. [signature removed by moderator]
Aug
5
comment Lower bound for finding second largest element
However, for finding both the first and second largest elements, an upper bound of n + O(log n) comparisons exists. One wonders how much extra work it is to get the first k elements. [signature removed by moderator]
Aug
4
answered A high school competition-level problem concerning sum and sequence
Aug
3
answered Is there a direct proof of this lcm identity?
Aug
2
answered Surprising Generalizations
Aug
2
answered How do I measure distance on a globe?