{"id":53098,"date":"2021-08-28T03:01:53","date_gmt":"2021-08-27T17:01:53","guid":{"rendered":"http:\/\/www.rjmprogramming.com.au\/ITblog\/?p=53098"},"modified":"2021-08-28T11:55:34","modified_gmt":"2021-08-28T01:55:34","slug":"prime-numbers-primer-tutorial","status":"publish","type":"post","link":"https:\/\/www.rjmprogramming.com.au\/ITblog\/prime-numbers-primer-tutorial\/","title":{"rendered":"Prime Numbers Primer Tutorial"},"content":{"rendered":"
\"Prime<\/a>

Prime Numbers Primer Tutorial<\/p><\/div>\n

We’ve been itching to do a “Prime Numbers Primer Tutorial” but haven’t found an interesting enough “in”. But I had occasion to want to count down an hour long period of time the other day, and wondered at the number patterns, or not, as the case may be that thinking about the positive integers involved, and whether they represent a prime number<\/a> …<\/p>\n

\nA prime number (or a prime) is a natural number greater than 1 that is not a product of two smaller natural numbers. A natural number greater than 1 that is not prime is called a composite number. For example, 5 is prime because the only ways of writing it as a product, 1 \u00d7 5 or 5 \u00d7 1, involve 5 itself. However, 4 is composite because it is a product (2 \u00d7 2) in which both numbers are smaller than 4. Primes are central in number theory because of the fundamental theorem of arithmetic: every natural number greater than 1 is either a prime itself or can be factorized as a product of primes that is unique up to their order.Prime Numbers Primer Tutorial\n<\/p><\/blockquote>\n

… or not. That whiled away that hour and made me think to involve fractions as well as these “prime number” considerations might make for a slightly interesting “take” on this “well worn” subject (or the uncharitable might say … “looking for patterns where there are none”)<\/font>. Our major Javascript function goes like …<\/p>\n


\nfunction fcalc() {
\n var assessment=' is a prime number.';
\n var innards='', facline='<tr id=tr2><\/tr>', divline='<tr id=tr3><\/tr>', diffsline='<tr id=tr4><td colspan=' + divisors.length + '><table style=\"width:100%;text-align:center;\" border=1><tr><td id=td0><\/td><\/TR><\/table><\/td><\/tr>';
\n var lastii=-1;
\n var huhti=1, rect=null, lastrect=null;
\n for (var ii=mynum; ii>=1; ii--) {
\n if (('' + eval(mynum \/ ii)).indexOf('.') == -1) {
\n divisors.push(ii);
\n if (eval('' + divisors.length) > 2) { assessment=' is not a prime number.'; }
\n facline=facline.replace('<\/tr>', '<td>1\/' + ii + '<\/td><\/tr>');
\n divline=divline.replace('<\/tr>', '<td id=dt' + divisors.length + '>' + eval(mynum \/ ii) + '<\/td><\/tr>');
\n if (('' + lastii).indexOf('-') != -1) {
\n lastii=eval(mynum \/ ii);
\n } else {
\n diffs.push(eval(eval(mynum \/ ii) - lastii));
\n diffsline=diffsline.replace('<\/TR>', '<td id=td' + diffs.length + '>' + eval(eval(mynum \/ ii) - lastii) + '<\/td><\/TR>');
\n lastii=eval(mynum \/ ii);
\n }
\n }
\n }
\n innards+='<tr id=tr1><td colspan=' + divisors.length + '><a onclick=ask(); style=\"cursor:pointer;text-decoration:underline;\">' + mynum + '<\/a><span id=shuh>' + assessment + '<\/span><\/td><\/tr>' + facline + divline + diffsline.replace(' colspan=0', ' colspan=' + divisors.length).replace('<\/TR>','<td id=xxx><\/td><\/tr>');
\n document.getElementById('mytable').innerHTML=innards;
\n while (document.getElementById('dt' + huhti)) {
\n rect=document.getElementById('dt' + huhti).getBoundingClientRect();
\n if (huhti == 1) {
\n document.getElementById('td0').style.width='' + eval(eval('' + rect.width) \/ 2) + 'px';
\n document.getElementById('xxx').style.width='' + eval(eval('' + rect.width) \/ 2) + 'px';
\n }
\n if (document.getElementById('dt' + eval(1 + huhti))) {
\n if (lastrect) {
\n \/\/alert( eval(eval(eval('' + rect.x) - eval('' + lastrect.x)) \/ 2));
\n \/\/document.getElementById('td' + huhti).style.left='' + eval(eval(eval('' + rect.left) - eval('' + lastrect.left)) \/ 2) + 'px';
\n document.getElementById('td' + huhti).style.width='' + lastrect.width + 'px';
\n } else {
\n document.getElementById('td' + huhti).style.width='' + rect.width + 'px';
\n }
\n }
\n lastrect=rect;
\n huhti++;
\n }
\n}
\n<\/code><\/p>\n

… for a “proof of concept” fractional_prime.html<\/a> live run<\/a> link for you to try, should you be curious.<\/p>\n

If this was interesting you may be interested in this<\/a> too.<\/p>\n