Differences

This shows you the differences between two versions of the page.

--- notes:discrete:fall2022:projects:cnv0 [2022/09/20 01:37] – [VERIFICATION] abarbcal
+++ notes:discrete:fall2022:projects:cnv0 [2022/09/22 01:56] (current) – [PROGRAM] dmuck
@@ Line 26: / Line 26: @@
 The n-ary value of something is determined by the number of "factor pairs" it possesses. For those who may have forgotten, a number's factors are the lesser numbers that multiply together to equal the number. For example, 2 has 1 factor pair, namely (1,2). Therefore, 2 has a n-ary value of 1 (or is a prime number). 4 would have two factor pairs, being (1,2 and 2,4). Thus an n-ary value of 2.
 =====ALGORITHM: trial by division=====
+Somewhere in the algorithm you may need to make use of the modulo (%) operator. The modulo operator gives you the remainder after a division. For example 5 % 2 would give you 1, since there is a remainder of 1 after dividing 5 by 2. This operator can be used to check if the result of two numbers being divided is a whole number (divider % divisor == 0).
 =====SPECIFICATIONS=====
@@ Line 69: / Line 69: @@
 The start argument is the lower bound of where the program will begin to check for n-ary numbers.
-The end argument is the upper bound of where the program will stop to check for n-ary values.
+The end argument is the upper bound of where the program will stop checking for n-ary values.
 Hence, if you have the following case:
@@ Line 87: / Line 87: @@
 <cli>
+lab46:~/src/SEMESTER/DESIG/PROJECT$ ./cnv0 7 1 0 16
+2 3 5 7 11 13
+  x.xxxx (Time)
+</cli>
+<cli>
+lab46:~/src/SEMESTER/DESIG/PROJECT$ ./cnv0 7 2 0 16
+6 8 9 10 14 15
+  x.xxxx (Time)
 </cli>
+<cli>
+lab46:~/src/SEMESTER/DESIG/PROJECT$ ./cnv0 7 3 0 16
+16
+  x.xxxx (Time)
+</cli>

Lab46 Wiki

User Tools

Site Tools

Differences

Page Tools