cloderic

# Returns true if n is a prime number
def check_prime(n):
    x = 2
    while(x < n):
        if n % x == 0:
            # Factor other then 1 or n, number is composite
            return False
        x = x +1
    # Number is prime, while loop terminated without finding factor
    return True

cloderic

cloderic

import Link from './link';
import markdown from 'remark-parse';
import React from 'react';
import rehype2react from 'rehype-react';
import remark2rehype from 'remark-rehype';
import unified from 'unified';

// Let's create a markdown compiler using unified
// -- cf. https://github.com/unifiedjs/unified
const processor = unified()