{"id":1312,"date":"2014-06-12T12:00:10","date_gmt":"2014-06-12T17:00:10","guid":{"rendered":"http:\/\/blog.espol.edu.ec\/icm00794\/?p=1312"},"modified":"2026-04-05T17:49:18","modified_gmt":"2026-04-05T22:49:18","slug":"s2eva2007ti_t1-funciones-par-e-impar-recursivas","status":"publish","type":"post","link":"https:\/\/blog.espol.edu.ec\/algoritmos101\/fp-s2eva10\/s2eva2007ti_t1-funciones-par-e-impar-recursivas\/","title":{"rendered":"s2Eva2007TI_T1 Funciones par e impar recursivas"},"content":{"rendered":"\n<p><em><strong>Ejercicio<\/strong><\/em>: <a href=\"https:\/\/blog.espol.edu.ec\/algoritmos101\/fp-2eva10\/2eva2007ti_t1-funciones-par-e-impar-recursivas\/\" data-type=\"post\" data-id=\"2900\">2Eva2007TI_T1 Funciones par e impar recursivas<\/a><\/p>\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# ICM00794-Fundamentos de Computaci\u00f3n - FCNM-ESPOL\n# 2Eva_IT2007_T1 Funciones par e impar\n# Propuesta: edelros@espol.edu.ec\n\nimport random as rnd\n\ndef impar(n):\n    if (n==0):\n        z = 0\n    if (n&gt;0):\n        z = par(n-1)\n    return (z)\n\ndef par(n):\n    if (n==0):\n        z = 1\n    if (n&gt;0):\n        z = impar(n-1)\n    return (z)\n\n\n# PROGRAMA Par\/Impar Recursiva\n\n# INGRESO\nn = int(input('cuantos n\u00fameros?: '))\n\n# PROCEDIMIENTO\nc = 0\ni = 1\nwhile not(i&gt;n):\n    a = int(rnd.random()*41)+10\n    r = par(a)\n    if (r==1):\n        c = c + 1\n    i = i + 1\nif c&gt;(n\/2):\n    z = 1\nelse:\n    z = 0\n\n# salida\nprint(' El resultado de mayor\u00eda pares es: ')\nprint(z)\n<\/pre><\/div>\n\n\n<p>resultado del algoritmo<\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>cuantos n\u00fameros?: 100\n El resultado de mayor\u00eda pares es: \n1\n&gt;&gt;&gt; \ncuantos n\u00fameros?: 100\n El resultado de mayor\u00eda pares es: \n0\n&gt;&gt;&gt;<\/code><\/pre>\n","protected":false},"excerpt":{"rendered":"<p>Ejercicio: 2Eva2007TI_T1 Funciones par e impar recursivas Algoritmo en Python resultado del algoritmo<\/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-1312","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\/1312","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=1312"}],"version-history":[{"count":4,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/1312\/revisions"}],"predecessor-version":[{"id":23649,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/1312\/revisions\/23649"}],"wp:attachment":[{"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/media?parent=1312"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/categories?post=1312"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/tags?post=1312"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}