素数 prolog lisp编写

最新推荐文章于 2024-11-10 00:24:21 发布

li905663280

最新推荐文章于 2024-11-10 00:24:21 发布

阅读量223

点赞数

分类专栏： prolog lisp 文章标签： lisp prolog

本文链接：https://blog.csdn.net/li905663280/article/details/128073131

版权

prolog 同时被 2 个专栏收录

2 篇文章 0 订阅

订阅专栏

lisp

2 篇文章 0 订阅

订阅专栏

这篇博客探讨了如何使用Prolog和Lisp编程语言实现素数检测。isPrime函数被定义，当输入大于等于2的整数N时，返回'prime'如果N是素数，否则返回由N的质因数组成的列表。示例展示了如何查询11和20的素数状态。文章提示先编写返回所有因子的版本，然后优化为只返回质因数。

摘要由CSDN通过智能技术生成

素数 prolog lisp编写

  isPrime(N, Answer)

  Given an integer N >= 2:
    Answer = prime               iff  N is prime
    Answer = composite(Factors)  iff  N is composite, with *prime* factors Factors

  Examples:
    ?- isPrime(11, Answer).
    Answer = prime
    ?- isPrime(20, Answer).
    Answer = composite([2, 5])     % The factors of 20 are: 2, 4, 5, 10.
                                   % The *prime* factors of 20 are: 2, 5.

   Replace the word "change_this" in the rules below.
   
   Hint: You should return the *prime* factors (not all of the factors),
         but it may be useful to first write a version of isPrime
           that returns all of the factors,
         complete question Q2b,
         and then return to this question.