Reputation
217
Next privilege 250 Rep.
View close votes
Badges
1 12
Newest
 Yearling
Impact
~4k people reached

May
3
revised How to debug math?
Fixed spelling
May
3
suggested approved edit on How to debug math?
Apr
24
comment Need help understanding Fibonacci Fast Doubling Proof
I see where you're coming from. There are some algorithms whose runtime is described in terms of the value instead of the bit length. For example: Ford-Fulkerson, subset sum (dynamic programming solution). But which convention to use is a matter of opinion and style, as long as the assumptions are stated clearly
Apr
24
comment Need help understanding Fibonacci Fast Doubling Proof
Your answer is largely excellent. I have a problem with the last paragraph - "exponential time to compute due to the size of the output". This is not true, because the bit length of the output is linearly proportional to the value of the input. In other words, $\log_2 F(n) \in O(n)$.
Apr
5
revised How do the roots change
Fixed spelling, adjusted spacing
Apr
5
suggested approved edit on How do the roots change
Mar
2
comment What does “adic” mean?
The third definition is also seen in programming, especially for variadic function
Mar
1
comment What's wrong with this transformation?
@tdudzik Among all your steps, not every step is a bi-implication. In particular, the second step is only valid if $\cos(x) \ne 0$.
Feb
23
revised Proving integer inequality
Improved text
Feb
23
suggested approved edit on Proving integer inequality
Feb
23
suggested rejected edit on Proving integer inequality
Feb
23
comment Proving integer inequality
Awesome. Because in my world, buggy theorems can crash computer programs. =)
Feb
23
comment Proving integer inequality
A slight correction: The interval should be $(1, \infty)$ because $f(1)$ is a division by zero when $c=1$.
Feb
23
awarded  Yearling
Feb
23
accepted Proving integer inequality
Feb
23
comment Proving integer inequality
Thanks! I was able to find more information based on the full name (which wasn't clear to me before). Bernoulli's inequality at Wikipedia
Feb
23
comment Proving integer inequality
How does the Bernoulli step work?
Feb
23
comment Proving integer inequality
If there happens to be an alternative simpler/shorter answer (such as one that involves manipulating integer inequalities without calculus), I would appreciate it. I want to fully understand and internalize this part of the proof before proceeding with work that builds on it.
Feb
23
comment Proving integer inequality
Thank you for the quick answer! I will incorporate it into my proof and verify each line before accepting. It looks reasonable and understandable to me at a glance.
Feb
23
revised Applying Fibonacci Fast Doubling Identities
added 1 character in body