divyakapoor
    • Create new note
    • Create a note from template
      • Sharing URL Link copied
      • /edit
      • View mode
        • Edit mode
        • View mode
        • Book mode
        • Slide mode
        Edit mode View mode Book mode Slide mode
      • Customize slides
      • Note Permission
      • Read
        • Only me
        • Signed-in users
        • Everyone
        Only me Signed-in users Everyone
      • Write
        • Only me
        • Signed-in users
        • Everyone
        Only me Signed-in users Everyone
      • Engagement control Commenting, Suggest edit, Emoji Reply
    • Invite by email
      Invitee

      This note has no invitees

    • Publish Note

      Share your work with the world Congratulations! 🎉 Your note is out in the world Publish Note No publishing access yet

      Your note will be visible on your profile and discoverable by anyone.
      Your note is now live.
      This note is visible on your profile and discoverable online.
      Everyone on the web can find and read all notes of this public team.

      Your account was recently created. Publishing will be available soon, allowing you to share notes on your public page and in search results.

      Your team account was recently created. Publishing will be available soon, allowing you to share notes on your public page and in search results.

      Explore these features while you wait
      Complete general settings
      Bookmark and like published notes
      Write a few more notes
      Complete general settings
      Write a few more notes
      See published notes
      Unpublish note
      Please check the box to agree to the Community Guidelines.
      View profile
    • Commenting
      Permission
      Disabled Forbidden Owners Signed-in users Everyone
    • Enable
    • Permission
      • Forbidden
      • Owners
      • Signed-in users
      • Everyone
    • Suggest edit
      Permission
      Disabled Forbidden Owners Signed-in users Everyone
    • Enable
    • Permission
      • Forbidden
      • Owners
      • Signed-in users
    • Emoji Reply
    • Enable
    • Versions and GitHub Sync
    • Note settings
    • Note Insights New
    • Engagement control
    • Make a copy
    • Transfer ownership
    • Delete this note
    • Save as template
    • Insert from template
    • Import from
      • Dropbox
      • Google Drive
      • Gist
      • Clipboard
    • Export to
      • Dropbox
      • Google Drive
      • Gist
    • Download
      • Markdown
      • HTML
      • Raw HTML
Menu Note settings Note Insights Versions and GitHub Sync Sharing URL Create Help
Create Create new note Create a note from template
Menu
Options
Engagement control Make a copy Transfer ownership Delete this note
Import from
Dropbox Google Drive Gist Clipboard
Export to
Dropbox Google Drive Gist
Download
Markdown HTML Raw HTML
Back
Sharing URL Link copied
/edit
View mode
  • Edit mode
  • View mode
  • Book mode
  • Slide mode
Edit mode View mode Book mode Slide mode
Customize slides
Note Permission
Read
Only me
  • Only me
  • Signed-in users
  • Everyone
Only me Signed-in users Everyone
Write
Only me
  • Only me
  • Signed-in users
  • Everyone
Only me Signed-in users Everyone
Engagement control Commenting, Suggest edit, Emoji Reply
  • Invite by email
    Invitee

    This note has no invitees

  • Publish Note

    Share your work with the world Congratulations! 🎉 Your note is out in the world Publish Note No publishing access yet

    Your note will be visible on your profile and discoverable by anyone.
    Your note is now live.
    This note is visible on your profile and discoverable online.
    Everyone on the web can find and read all notes of this public team.

    Your account was recently created. Publishing will be available soon, allowing you to share notes on your public page and in search results.

    Your team account was recently created. Publishing will be available soon, allowing you to share notes on your public page and in search results.

    Explore these features while you wait
    Complete general settings
    Bookmark and like published notes
    Write a few more notes
    Complete general settings
    Write a few more notes
    See published notes
    Unpublish note
    Please check the box to agree to the Community Guidelines.
    View profile
    Engagement control
    Commenting
    Permission
    Disabled Forbidden Owners Signed-in users Everyone
    Enable
    Permission
    • Forbidden
    • Owners
    • Signed-in users
    • Everyone
    Suggest edit
    Permission
    Disabled Forbidden Owners Signed-in users Everyone
    Enable
    Permission
    • Forbidden
    • Owners
    • Signed-in users
    Emoji Reply
    Enable
    Import from Dropbox Google Drive Gist Clipboard
       Owned this note    Owned this note      
    Published Linked with GitHub
    • Any changes
      Be notified of any changes
    • Mention me
      Be notified of mention me
    • Unsubscribe
    #### Annual Interest Limit 1. As the number of dividend payments per year increases, the effective annual interest approaches infinity. Answered False Class Discussion and Explanation: The growth factor with n compounding periods per year is: $(1 + \frac{1}{n})^n$ As $n \rightarrow \infty$ $$ \lim_{n \to \infty}(1 + \frac{1}{n})^n = e ≈ 2.71828 $$ So, if we start with $100, the maximum possible ending balance after one year at 100% annual interest compounded continously is: $100 \cdot e ≈ 271.83$ Even though the number of compounding periods increases without bound, the total annual growth does not blow up to infinity. Instead it levels off at e times the principal #### Infinitely Compounding Growth 2. Recall that $f(r)=er$ takes in a growth rate, r and returns the amount of infinitely compounding growth. It is UNLIKELY that this function of growth rate $(f(r)=er)$ has an inverse. That is, there is no function $g(x) = r$ that returns the growth rate needed to attain a certain amount of growth, x Answer False Class Discussion and Explanation Given: $f(r) = e^r$ This function is strictly increasing and continous for all real r The range of this function is $(0,\infty)$ This function does not have an inverse because this is one-to-one function. The inverses of this function will be a natuaral logarithm $g(x) = ln(x)$ so that: $g(f(r)) = g(e^r) = ln(e^r) = r$ and $f(g(x)) = f(ln(x)) = e^(ln(x)) = x$ for all $x > 0$ Example: Suppose we want to know the growth rtate that yields a doubling of the investment(x=2). Then: $r = g(2) = ln(2) ≈ 0.693$ Therefore, a ~69.3% continously compounding rate produces doubling in one year. #### Divergence 3. This description of e is an example of divergence. So, we can safely say that "compounding growth within a time period diverges as n approaches infinity". Answer False Not Discussed in Class and Explanation: The description of e in the compounding-interest framework is actually an example of convergence. Because: - The growth factor of n compounding periods is: $(1 + \frac{1}{n})^n$ - As $n \rightarrow \infty$, this expression does not approaches infinity (Grow without bound/limit). Instead, it approaches a finite constant: $$ \lim_{n \to \infty}(1 + \frac{1}{n})^n = e ≈ 2.71828 $$ - So, no matter how many times we subdivide the compounding (daily, hourly, per second etc.), the growth stabilizes at a maximum multiplier of e for a 100% annual rate. - For example: - n = 1: factor = 2.0 - n = 2: factor = 2.25 - n = 4: factor ≈ 2.441 - n = 100: factor ≈ 2.705 - n $\rightarrow \infty$: factor $\rightarrow$ 2.718 (not infinity) #### Function Inverses 4. The two interactive plots "Subdivided Interest ..." and "Total Growth ..." illustrate two functions that are inverses of one another. So, if one is f then the other is $f −1$ Answered False Class Discussion and Explanation: Left Plot is Subdivided Interest Plot: $y_{left}(k) = (1 + \frac{1}{n})^k, k = 0,1,...,n$ In this plot n is fixed and we vary k(the subdivision within the year) It shows how growth accumulates within a single year as compounding periods pass The domain of this plot is subdivisions within a fixed n. The right plot is Total Growth Plot: $y_{right}(x) = (1 + \frac{1}{x})^x , x = 1, 2,..., n$ In this plot we vary x(the number of subdivision per year) It shows how the final annual growth factor depends on the number of compounding periods. The domain of right plot is different choices of n. Therefore, these plots are not inverses of each other. One is not undoing the other - they're describing different relationships: - one tracks growth inside a fixed year(progression over time) - The other tracks growth as n changes(effect of compoudning frequency) ![Screenshot 2025-10-26 at 6.14.48 PM](https://hackmd.io/_uploads/H1H2Tzn0ex.png) #### Asymptotic Behavior 5. The functions $n \text{ and } n+log2(n)n +log2(n)$ both share the same asymptotic end behavior. I.e., the impact of $log⁡2(n)$ is negligible when n is large enough. Answer True Class Discussion and Explanation: We are comparing: $f(n) = n \text{ and } g(n) = n + log_2(n)$ For large n, the linear term n dominates $log_2(n)$ Formally, $$\lim_{n \to \infty}\frac{g(n)}{f(n)} = \lim_{n \to \infty}\frac{n + log_2(n)}{n} = \lim_{n \to \infty}(1 + \frac{log_2(n)}{n}) = 1$$ Since the ratio goes to 1, the "extra" $log_2(n)$ is negligible in the asymptotic sense. Example: - At $n = 1000: log_2(1000) ≈ 10$, thereforem $n + log_2(n) = 1010$, which is only a 1% increase over n. - At $n = 1,000,000: log_2(10^6)≈20$, therefore, $1,000,000 + 20$ is just 0.002% larger. The gap grows in absolute terms(10, 20,...), but the relative distance shrinks to 0. Therefore, $n \text{ and } n + log_2(n)$ share the same asymptotic behavior. The logarithmic term is negligible compare with n as $n \to \infty$ #### Asymptotic Growth 6. The following functions of n are listed in (descending) order of their "asymptotic growth", as $n→∞$. * n * log 2 (n) * 10 i.e., "at infinity", (1) will always be larger than (2), and (2) will always be larger than (3) ... Answer True Not Discussed in Class and Explanation: We compare growth by ratios as $n \to \infty$ - $n$ vs. $log_2(n)$ $$\lim_{n \to \infty} \frac{log_2(n)}{n} = 0 \Rightarrow \text{n dominates } log_2(n).$$ ("The long term is negligible next to a root/linear/etc." - same idea we used when contrasting $\sqrt{n} + log(n) \text{ with } \sqrt{n} + 10$) - $log_2(n) \text{ vs. constant } 10:$ $$ \lim_{n \to \infty} \frac{10}{log_2(n)} = 0 \Rightarrow log_2(n) \text{ dominates any constant} $$ Thus the descending asymptotic order is: $n \succ log_2(n) \succ 10$ In situation 2 we emphasized that lower-order terms(constants, logs) become negligible relative to higher-order terms(roots, linear, etc.) Here, the linear term n outgrows $log_2(n)$ without bound (their ratio $\frac{n}{log_2(n)} \to \infty)$, and $\log_2(n)$ outgrows any constant. So at infinity, $(1) > (2) > (3)$ holds. ![Screenshot 2025-10-26 at 6.13.25 PM](https://hackmd.io/_uploads/rys7pzhRxe.png) #### Trignometric Limits 7. Suppose we let $t_0=2π$.Then, the $\lim_{ω→∞}sin(ωt_0)$ exists. Answered False Class Discussion and Explanation: We set: $t_0 = \frac{\pi}{2}$ We want: $$\lim_{n \to \infty} sin(\omega t_0) = \lim_{\omega \to \infty} sin(\frac{\pi}{2}\omega)$$ - As $\omega$ increases, the argument $\frac{\pi}{2} \omega$ grows without bound. - Multiples of $\frac{\pi}{2}$ cycle through sine values: $sin(\frac{\pi}{2} \cdot 1) = 1, sin(\frac{\pi}{2} \cdot 2) = 2, sin(\frac{\pi}{2} \cdot 3) = -1, sin(\frac{\pi}{2} \cdot 4) = 0, ...$ So, as $\omega \to \infty$, the sequence of values oscillates between -1, 0, +1 infintely often. Therefore, the limit does not exist, because $sin(\omega t_0)$ does not settle to a single value as $\omega \to \infty$. ![Screenshot 2025-10-26 at 6.13.11 PM](https://hackmd.io/_uploads/rJVSaznAle.png) #### Trignometric Domain 8. The function $sin⁡(ωx)$ is only valid for integer (e.g., 1, 7, -3) values of ω. Answer False Class Discussion and Explanation The sine function is defined for all real numbers as input - not just integers. $sin: \mathbb{R} \to [-1, 1]$ So for $f(x) = sin(\omega x)$ the variable $\omega$ (the angular frequency) can be any real number. In physics and signal processing, $\omega$ is typically measured in radians per second, and can take on non-integer values like $2.5, \pi, \text{or } 0.001$. Example: - if $\omega = 2: f(x) = sin(2x)$ - if $\omega = \pi: f(x) = sin(\pi x)$ - if $\omega = 0.5: f(x) = sin(0.5 x)$ These all are perfectly valid Therefore, the function $sin(\omega x)$ is valid for all real values of $\omega$, not just integers.

    Import from clipboard

    Paste your markdown or webpage here...

    Advanced permission required

    Your current role can only read. Ask the system administrator to acquire write and comment permission.

    This team is disabled

    Sorry, this team is disabled. You can't edit this note.

    This note is locked

    Sorry, only owner can edit this note.

    Reach the limit

    Sorry, you've reached the max length this note can be.
    Please reduce the content or divide it to more notes, thank you!

    Import from Gist

    Import from Snippet

    or

    Export to Snippet

    Are you sure?

    Do you really want to delete this note?
    All users will lose their connection.

    Create a note from template

    Create a note from template

    Oops...
    This template has been removed or transferred.
    Upgrade
    All
    • All
    • Team
    No template.

    Create a template

    Upgrade

    Delete template

    Do you really want to delete this template?
    Turn this template into a regular note and keep its content, versions, and comments.

    This page need refresh

    You have an incompatible client version.
    Refresh to update.
    New version available!
    See releases notes here
    Refresh to enjoy new features.
    Your user state has changed.
    Refresh to load new user state.

    Sign in

    Forgot password
    or
    Sign in via Facebook Sign in via X(Twitter) Sign in via GitHub Sign in via Dropbox Sign in with Wallet
    Wallet ( )
    Connect another wallet

    New to HackMD? Sign up

    By signing in, you agree to our terms of service.

    Help

    • English
    • 中文
    • Français
    • Deutsch
    • 日本語
    • Español
    • Català
    • Ελληνικά
    • Português
    • italiano
    • Türkçe
    • Русский
    • Nederlands
    • hrvatski jezik
    • język polski
    • Українська
    • हिन्दी
    • svenska
    • Esperanto
    • dansk

    Documents

    Help & Tutorial

    How to use Book mode

    Slide Example

    API Docs

    Edit in VSCode

    Install browser extension

    Contacts

    Feedback

    Discord

    Send us email

    Resources

    Releases

    Pricing

    Blog

    Policy

    Terms

    Privacy

    Cheatsheet

    Syntax Example Reference
    # Header Header 基本排版
    - Unordered List
    • Unordered List
    1. Ordered List
    1. Ordered List
    - [ ] Todo List
    • Todo List
    > Blockquote
    Blockquote
    **Bold font** Bold font
    *Italics font* Italics font
    ~~Strikethrough~~ Strikethrough
    19^th^ 19th
    H~2~O H2O
    ++Inserted text++ Inserted text
    ==Marked text== Marked text
    [link text](https:// "title") Link
    ![image alt](https:// "title") Image
    `Code` Code 在筆記中貼入程式碼
    ```javascript
    var i = 0;
    ```
    var i = 0;
    :smile: :smile: Emoji list
    {%youtube youtube_id %} Externals
    $L^aT_eX$ LaTeX
    :::info
    This is a alert area.
    :::

    This is a alert area.

    Versions and GitHub Sync
    Get Full History Access

    • Edit version name
    • Delete

    revision author avatar     named on  

    More Less

    Note content is identical to the latest version.
    Compare
      Choose a version
      No search result
      Version not found
    Sign in to link this note to GitHub
    Learn more
    This note is not linked with GitHub
     

    Feedback

    Submission failed, please try again

    Thanks for your support.

    On a scale of 0-10, how likely is it that you would recommend HackMD to your friends, family or business associates?

    Please give us some advice and help us improve HackMD.

     

    Thanks for your feedback

    Remove version name

    Do you want to remove this version name and description?

    Transfer ownership

    Transfer to
      Warning: is a public team. If you transfer note to this team, everyone on the web can find and read this note.

        Link with GitHub

        Please authorize HackMD on GitHub
        • Please sign in to GitHub and install the HackMD app on your GitHub repo.
        • HackMD links with GitHub through a GitHub App. You can choose which repo to install our App.
        Learn more  Sign in to GitHub

        Push the note to GitHub Push to GitHub Pull a file from GitHub

          Authorize again
         

        Choose which file to push to

        Select repo
        Refresh Authorize more repos
        Select branch
        Select file
        Select branch
        Choose version(s) to push
        • Save a new version and push
        • Choose from existing versions
        Include title and tags
        Available push count

        Pull from GitHub

         
        File from GitHub
        File from HackMD

        GitHub Link Settings

        File linked

        Linked by
        File path
        Last synced branch
        Available push count

        Danger Zone

        Unlink
        You will no longer receive notification when GitHub file changes after unlink.

        Syncing

        Push failed

        Push successfully