Reputation
392
Next privilege 500 Rep.
Access review queues
Badges
4 7
Impact
~11k people reached

  • 0 posts edited
  • 0 helpful flags
  • 2 votes cast
Jan
28
awarded  Favorite Question
Apr
9
awarded  Popular Question
Oct
14
awarded  Notable Question
Jun
20
awarded  Yearling
Jan
29
asked If a graph G has chromatic number 3, then G contains a subgraph isomorphic to $K_3$?
Jan
18
accepted How to define a bijection between $(0,1)$ and $(0,1]$?
Dec
2
awarded  Scholar
Dec
2
accepted Prove/Show that a number is square if and only if its prime decomposition contains only even exponents.
Dec
2
accepted How many 4 worded sentences can a list of 5 words make if two of them must be in that sentence?
Oct
26
awarded  Good Question
Oct
10
awarded  Popular Question
Aug
13
revised How many 4 worded sentences can a list of 5 words make if two of them must be in that sentence?
added 294 characters in body
Aug
1
comment How many 4 worded sentences can a list of 5 words make if two of them must be in that sentence?
Repeating "new" and "this" is allowed though. The only problem I currently see with this is that if I get "new this new this" I am counting it twice? or am I missing something?
Aug
1
asked How many 4 worded sentences can a list of 5 words make if two of them must be in that sentence?
Jul
6
awarded  Supporter
Jul
5
asked Prove/Show that a number is square if and only if its prime decomposition contains only even exponents.
Jun
20
awarded  Nice Question
Jun
20
comment How to define a bijection between $(0,1)$ and $(0,1]$?
thanks that makes it a lot clear for me. If I was to follow that logic for lets say [0,1]^2 and [0,2]^2 would I solve for [0,1] and [0,2] first by letting A = {0,1} and b = {0,2} and then f: A->B ?
Jun
20
awarded  Student
Jun
20
asked How to define a bijection between $(0,1)$ and $(0,1]$?