Scribd Logo
Importer

Bienvenue sur Scribd !

  • Assignment3 Haskell

    Transféré par

    gauravgd16
    13 vues1 page
    This document provides an algorithm to determine if a number n is prime by checking if the sum of all divisors of n that are less than n is greater than n. It uses a list comprehension to iterate from 1 to n-1, check if each x is a divisor of n by seeing if the modulo of n and x is 0, and if so adds x to the running sum. It then checks if this sum is greater than n to determine primality.

    Description originale:

    haskell

    Copyright

    © © All Rights Reserved

    Formats disponibles

    TXT, PDF, TXT ou lisez en ligne sur Scribd

    Avez-vous trouvé ce document utile ?

    Ce contenu est-il inapproprié ?

    Signaler ce document
    This document provides an algorithm to determine if a number n is prime by checking if the sum of all divisors of n that are less than n is greater than n. It uses a list comprehension to iterate from 1 to n-1, check if each x is a divisor of n by seeing if the modulo of n and x is 0, and if so adds x to the running sum. It then checks if this sum is greater than n to determine primality.

    Droits d'auteur :

    © All Rights Reserved
    Téléchargez comme TXT, PDF, TXT ou lisez en ligne sur Scribd
    Signaler comme contenu inapproprié
    13 vues1 page

    Assignment3 Haskell

    Transféré par

    gauravgd16
    This document provides an algorithm to determine if a number n is prime by checking if the sum of all divisors of n that are less than n is greater than n. It uses a list comprehension to iterate from 1 to n-1, check if each x is a divisor of n by seeing if the modulo of n and x is 0, and if so adds x to the running sum. It then checks if this sum is greater than n to determine primality.

    Droits d'auteur :

    © All Rights Reserved
    Téléchargez comme TXT, PDF, TXT ou lisez en ligne sur Scribd
    Signaler comme contenu inapproprié
    sur 1

    [n | n <- [1..], sum [x | x <- [1..

    n-1],n `mod` x == 0] > n]

    Vous aimerez peut-être aussi