{"id":10652,"date":"2014-03-01T11:05:37","date_gmt":"2014-03-01T16:05:37","guid":{"rendered":"http:\/\/blog.espol.edu.ec\/ccpg1001\/?p=10652"},"modified":"2026-04-05T17:57:17","modified_gmt":"2026-04-05T22:57:17","slug":"s2eva2001tii_t2-contar-puntos-aleatorios-en-un-triangulo","status":"publish","type":"post","link":"https:\/\/blog.espol.edu.ec\/algoritmos101\/fp-s2eva10\/s2eva2001tii_t2-contar-puntos-aleatorios-en-un-triangulo\/","title":{"rendered":"s2Eva2001TII_T2 Contar puntos aleatorios en un tri\u00e1ngulo"},"content":{"rendered":"\n<p><strong>Ejercicio<\/strong>: <a href=\"https:\/\/blog.espol.edu.ec\/algoritmos101\/fp-2eva10\/2eva2001tii_t2-contar-puntos-aleatorios-en-un-triangulo\/\" data-type=\"post\" data-id=\"2835\">2Eva2001TII_T2 Contar puntos aleatorios en un tri\u00e1ngulo<\/a><\/p>\n\n\n\n<p>Se cuentan los puntos que caen el el \u00e1rea marcada en verde que se encuentra debajo de:<\/p>\n\n\n<span class=\"wp-katex-eq katex-display\" data-display=\"true\"> f(x)= -x+10 <\/span>\n\n\n\n<p>siendo el intervalo [a,b] con valores de a = 0 y b=10, la mitad corresponde a&nbsp; (a+b)\/2<\/p>\n\n\n\n<p>Como las \u00e1reas consideradas corresponden a dos sectores, considere usar x entre[a,mitad] y entre [mitad, b], limitados en y por la l\u00ednea f(x)<\/p>\n\n\n\n<figure class=\"wp-block-image size-full\"><img loading=\"lazy\" decoding=\"async\" width=\"559\" height=\"422\" src=\"http:\/\/blog.espol.edu.ec\/algoritmos101\/files\/2014\/03\/2Eva_IIT2001_T2_grafica02.png\" alt=\"2Eva_IIT2001_T2 grafica02\" class=\"wp-image-16697\" \/><\/figure>\n\n\n\n<p>Un resultado gr\u00e1fico, no requerido para el ejercicio, tan solo para mejor comprensi\u00f3n:<\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>de n puntos:  100\n dentro estaban:  25\n&gt;&gt;&gt; <\/code><\/pre>\n\n\n\n<h2 class=\"wp-block-heading\">Algoritmo en Python<\/h2>\n\n\n<div class=\"wp-block-syntaxhighlighter-code \"><pre class=\"brush: python; title: ; notranslate\" title=\"\">\n# 2Eva_IIT2001_T2 Contar puntos aleatorios \n# dentro de \u00e1rea tri\u00e1ngular\nimport random as rnd\nimport numpy as np\nimport matplotlib.pyplot as plt\n\n# INGRESO\nn = 100\na = 0\nb = 10\n\n# funci\u00f3n a evaluar\nf = lambda x: -x+10\n\n# PROCEDIMIENTO\nmitad = (a+b)\/2\nX = &#x5B;]\nY =&#x5B;]\ndentro = 0\ni = 0\nwhile not(i&gt;=n):\n    xi = rnd.random()*(b-a)+0\n    yi = rnd.random()*(b-a)+0\n    limite = f(xi)\n    if xi&gt;mitad and yi&lt;=limite:\n        dentro = dentro +1\n    if xi&lt;=mitad and yi&lt;=limite and yi&gt;=mitad:\n        dentro = dentro +1\n    X.append(xi)\n    Y.append(yi)\n    i = i+1\n\n# SALIDA\nprint(' de n puntos: ', n)\nprint(' dentro estaban: ', dentro)\n\n\n# Grafica\nplt.scatter(X,Y)\nxi = np.linspace(a,b,n+1)\nplt.plot(xi,f(xi))\nplt.axhline(mitad)\nplt.axvline(mitad)\nplt.xlim(a,b)\nplt.ylim(a,b)\nplt.xlabel('xi')\nplt.ylabel('yi')\nplt.show()\n<\/pre><\/div>","protected":false},"excerpt":{"rendered":"<p>Ejercicio: 2Eva2001TII_T2 Contar puntos aleatorios en un tri\u00e1ngulo Se cuentan los puntos que caen el el \u00e1rea marcada en verde que se encuentra debajo de: siendo el intervalo [a,b] con valores de a = 0 y b=10, la mitad corresponde a&nbsp; (a+b)\/2 Como las \u00e1reas consideradas corresponden a dos sectores, considere usar x entre[a,mitad] y [&hellip;]<\/p>\n","protected":false},"author":8043,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"wp-custom-template-entrada-fp-ejemplos","format":"standard","meta":{"footnotes":""},"categories":[131],"tags":[58,157],"class_list":["post-10652","post","type-post","status-publish","format-standard","hentry","category-fp-s2eva10","tag-ejemplos-python","tag-fundamentos-programacion"],"_links":{"self":[{"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/10652","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/users\/8043"}],"replies":[{"embeddable":true,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/comments?post=10652"}],"version-history":[{"count":3,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/10652\/revisions"}],"predecessor-version":[{"id":23672,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/10652\/revisions\/23672"}],"wp:attachment":[{"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/media?parent=10652"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/categories?post=10652"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/tags?post=10652"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}