JSFiddle - React, Tailwind, and code Playground

by Vladimir

JavaScript

var prime = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499,503,509,521,523,541,547,557,563,569,571,577,587,593,599,601,607,613,617,619,631,641,643,647,653,659,661,673,677,683,691,701,709,719,727,733,739,743,751,757,761,769,773,787,797,809,811,821,823,827,829,839,853,857,859,863,877,881,883,887,907,911,919,929,937,941,947,953,967,971,977,983,991,997,1009];
var actions = [ '-', '/','+', '*'];

function isPrime(val) {
	var valIsPrime = false;
	prime.map(function(a) {
		if(val == a) {
			valIsPrime = true;
		}
	});
	return valIsPrime;
}

function part(val, isPretty) {
	console.log('Val: '+ val+'; pretty: ' + isPretty);
	var max = 4,
		actInd = Math.floor(4*Math.random()),
		result = {},
		goodNumber = false;

	if(val < 7 || isPrime(val)) {
		max = 2;
	}
	actInd = Math.floor(max*Math.random());
	result.act = actions[actInd];
	console.log('Action: ' + result.act);
	switch(actInd) {
		//* sum
		case 2:
			while(!goodNumber) {
				result.op2 = Math.floor(Math.random() * (val - 1)) + 1;
				result.op1 = val - result.op2;
				if(!isPretty || !isPrime(result.op1)) {
					goodNumber = true;
				}
			}
		break;
		//* 
		case 0:
			while(!goodNumber) {
				result.op2 = Math.floor(Math.random() * 20) + 1;;
				result.op1 = val + result.op2;
				if(!isPretty || !isPrime(result.op1)) {
					goodNumber = true;
				}
			}
		break;
		//*
		case 1:
			while(!goodNumber) {
				result.op2 = 1;
				while(result.op2 == 1) {
					result.op2 = Math.floor(Math.random() * 4) + 1;
				}
				result.op1 = val * result.op2;
				if(!isPretty || !isPrime(result.op1)) {
					goodNumber = true;
				}
			}
		break;
		//* mult
		case 3:
			while(!goodNumber) {
				var finded =...