CircuitVerse - Prime Number Detector

Prime Number Detector

11 Stars 529 Views

Project access type: Public

Description:

Let n = x+2y+4z+8w be an integer in [0,15]; x,y,z,w in {0,1}.
The functionf(x,y,z,w) = y+xz+yz+yw+xyw+yzwwill return an 1 if n is prime, and 0 otherwise

Created: Nov 14, 2019

Updated: Jun 30, 2023

Comments

You must login before you can post a comment.

Comments

Simulator

Learn

Blog

Examples

Log in

Documentation

Contribute

Teachers

About

Api

FAQ