Reputation
947
Top tag
Next privilege 1,000 Rep.
Create new tags
Badges
2 8 30
Impact
~49k people reached

Apr
19
comment Simple Logarithmic question.
thank you for answering my question.
Apr
19
comment Simple Logarithmic question.
perhaps that's the answer my book has, but i cant do that in my head...
Apr
19
comment Simple Logarithmic question.
3 twos means log base 3 will give you a two one 3 means logs base 3 will give you a cubic root of 3 but im not sure if i can do that or not.
Apr
19
asked Simple Logarithmic question.
Mar
17
awarded  Popular Question
Jan
31
awarded  Yearling
Jan
5
awarded  Famous Question
Jan
3
awarded  Custodian
Jan
2
accepted Prove that if a set A of natural numbers contains $n_0$ and whenever A contains k it also contains k+1.
Jan
2
comment Prove that if a set A of natural numbers contains $n_0$ and whenever A contains k it also contains k+1.
Oh! Thank you for taking the time to re-write that I totally follow how it proves it for all values now.
Jan
2
accepted Difficulty involving Rings and Subrings Proving lub contained in fields?
Jan
2
accepted Absolute convergence.
Jan
2
accepted continiouty of maping from set back into itself.
Jan
2
accepted Does this proof work?
Jan
2
comment Prove that if a set A of natural numbers contains $n_0$ and whenever A contains k it also contains k+1.
Thank you that makes perfect sense.
Jan
2
comment Prove that if a set A of natural numbers contains $n_0$ and whenever A contains k it also contains k+1.
Me defining D in Case 1 just makes it easy to prove that $A_1 \ cup B = $ natural numbers as $A_1 \ cup B $ says with words Exactly the same thing as the Set D
Jan
2
comment Prove that if a set A of natural numbers contains $n_0$ and whenever A contains k it also contains k+1.
Very sorry Someone Edited my post and moved the Statement around to make no sense at all i put it back to what it originally said.
Jan
2
revised Prove that if a set A of natural numbers contains $n_0$ and whenever A contains k it also contains k+1.
added 19 characters in body
Jan
2
comment Prove Bernoulli inequality if $h>-1$
Thats very clever I really like that approach thanks!
Jan
2
asked Prove that if a set A of natural numbers contains $n_0$ and whenever A contains k it also contains k+1.