\[
\lim_{x \rightarrow \infty} \frac{\sqrt{4x^6-5x^5}-2x^3}{\sqrt[3]{27x^6+8x}} \\
=\lim_{x \rightarrow \infty}\frac{-x^5}{\sqrt[3]{27x^6+8x}(\sqrt{4x^6-5x^5}+2x^3)} \\
= \lim_{x \rightarrow \infty}\frac{-x^5}{(\frac{\sqrt[3]{27x^6+8x}}{\sqrt[3]{27x^6}} \times 3x^2)(\frac{\sqrt{4x^6-5x^5}+2x^3}{4x^3} \times 4x^3)} \\
= \lim_{x \rightarrow \infty}\frac{1}{(\frac{\sqrt[3]{27x^6+8x}}{\sqrt[3]{27x^6}} )(\frac{\sqrt{4x^6-5x^5}+2x^3}{4x^3})} \times \frac{-5x^5}{(3x^2)(4x^3)} \\
= \frac{1}{(\sqrt[3]{1+0})(\sqrt{\frac14+0}+\frac12)} \times \frac{-5}{12} \\
= \frac{-5}{12}
\]

随机推荐

  1. js原码工具集

    /* 原生js工具集 */ arr是否包含obj function contains1(arr, obj) { var i = arr.length; while (i--) { if (arr[i] ...

  2. Opentsdb简介(一)

    原文:http://www.jianshu.com/p/0bafd0168647 1.OpenTSDB介绍 1.1.OpenTSDB是什么?主要用途是什么? 官方文档这样描述:OpenTSDB is ...

  3. Find the odd int

    Given an array, find the int that appears an odd number of times. There will always be only one inte ...

  4. NEU 1497 Kid and Ants 思路 难度:0

    问题 I: Kid and Ants 时间限制: 1 Sec  内存限制: 128 MB提交: 42  解决: 33[提交][状态][讨论版] 题目描述 Kid likes interest ques ...

  5. hdu 1817 Necklace of Beads(Polya定理)

    Necklace of Beads Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others ...

  6. 字符串比较,栈溢出引起的程序bug

    需求 输入密码字符串,与设定的密码“1234567”进行比较,两者相符则输出"congratulations!”,不符则输出“try again!”. 程序bug 实际运行过程中发现,输入某 ...

  7. LeetCode之Longest Substring Without Repeating Characters

    [题目描述] Given a string, find the length of the longest substring without repeating characters. Exampl ...

  8. Docker的安装及操作

    1. 在Ubuntu中安装Docker 更新ubuntu的apt源索引 sudo apt-get update 安装包允许apt通过HTTPS使用仓库 sudo apt-get install \ a ...

  9. C++面向对象高级编程(一)基础篇

    技术在于交流.沟通,转载请注明出处并保持作品的完整性. 概要: 知识点1 构造函数与析构函数 知识点2 参数与返回值 知识点3 const 知识点4 函数重载(要与重写区分开) 知识点5 友元 先以C ...

  10. New Concept English there (4)

    20w/m These days, people who do manual work often receive far more money than people who work in off ...