This repository has been archived by the owner on Jun 8, 2024. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathindex.js
481 lines (428 loc) · 8.75 KB
/
index.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
//prime numbers
function prime(value) {
var primes = [];
var amount = 0
for(var i = 2; i < value; i++) {
primes[i] = true;
}
var limit = Math.sqrt(value);
for(var i = 2; i < limit; i++) {
if(primes[i] === true) {
for(var j = i * i; j < value; j += i) {
primes[j] = false;
}
}
}
for(var i = 2; i < value; i++) {
if(primes[i] === true) {
console.log(i + " " + primes[i]);
amount++
}
}
console.log(amount + " primes")
}
// lowest common multiple
function lcm(x, y){
var a = x
var b = y
var e = 1
if(x > y){
var x = b
var y = a
}
var c = y * e
while(c % x !== 0){
e++
var c = y * e
}
if(c % x == 0){
console.log(c)
return;
}
}
// greatest common factors
function gcf(x, y) {
x = Math.abs(x);
y = Math.abs(y);
while(y) {
var t = y;
y = x % y;
x = t;
}
console.log(x)
return x;
}
// narcissist numbers
function narnum( value ) {
var valStr = '' + value;
var valLength = valStr.length;
var result = 0;
for (var i in valStr) {
result += Math.pow((+valStr[i]), valLength);
}
if(result === value){
console.log(value + " is a narcissistic number")
}
else{
console.log(value + " isn't a narcissistic number")
}
//return result === value;
}
//composite
function comp(value){
var primes = [];
for(var i = 2; i < value; i++) {
primes[i] = true;
}
var limit = Math.sqrt(value);
for(var i = 2; i < limit; i++) {
if(primes[i] === true) {
for(var j = i * i; j < value; j += i) {
primes[j] = false;
}
}
}
if(primes[i] === false) {
console.log(value + " composite")
}
else{
console.log(value + " prime")
}
}
//fibinacci numbers
function fibinum(max){
x = 1
m = 2
xm = x + m
xmdigits = ["12"]
console.log(1)
console.log(2)
while(xm < max){
xm = x+m
if(xm > max){
return xmdigits
}
console.log(xm)
if(x<m){
var x = xm
}
else{
var m = xm
}
xmdigits = xmdigits + xm
}
}
//find the sum of all the digits in a number
function digitsfunc(num, func){
numnum = parseInt(num)
numlength = Math.floor(Math.log10(numnum))+1;
var digits = num.toString().split('');
var realDigits = digits.map(Number)
for(var i=1; i < numlength; i++){
if(func == `+`)
digits[0] = parseInt(digits[0]) + parseInt(digits[i])
if(func == `-`)
digits[0] = parseInt(digits[0]) - parseInt(digits[i])
if(func == `*`)
digits[0] = parseInt(digits[0]) * parseInt(digits[i])
if(func == `/`)
digits[0] = parseInt(digits[0]) / parseInt(digits[i])
}
console.log("Sum of digits: " + digits[0])
}
//perfect squares
//is a certain number a perfect square
function isperfsq(max){
if (max % Math.sqrt(max) === 0) {
console.log(max + " is a perfect square");
}
}
//how many perfect sqaures
function perfsq(max){
c = 1
while(c < max+1){
if(c % Math.sqrt(c) == 0){
console.log(c)
c++
}
else{
c++
}
}
return;
}
//factors
function factors(x){
m = 1
amount = 0
while(m < x+1){
if(x % m == 0){
console.log(m)
amount++
}
m++
}
console.log(amount + " factors")
return;
}
//odd or even
function oddorevennum(num){
if(num % 2 !== 0){
console.log(num + " is an odd number")
}
else{
console.log(num + " is an even number")
}
}
//whole numbers
function wholenum(num){
if(num % 1 == 0){
console.log(num + " is a whole number")
}
else{
console.log(num + " is not a whole number")
}
}
//natural numbers
function natnum(num){
if(num > -1){
console.log(num + " is a natural number")
}
else{
console.log(num + " isn't a natural number")
}
}
//roman numeral translator
function rnt(number){
I = "I";
V = "V"
X = "X"
L = "L"
C = "C"
D = "D"
M = "M"
var Mval = Math.floor(number / 1000)
m = M.repeat(Mval)
number = number - m.length * 1000
var Dval = Math.floor(number / 500)
d = D.repeat(Dval)
number = number - d.length * 500
var Cval = Math.floor(number / 100)
c = C.repeat(Cval)
number = number - c.length * 100
var Lval = Math.floor(number / 50)
l = L.repeat(Lval)
number = number - l.length * 50
var Xval = Math.floor(number / 10)
x = X.repeat(Xval)
number = number - x.length * 10
var Vval = Math.floor(number / 5)
v = V.repeat(Vval)
number = number - v.length * 5
var Ival = Math.floor(number / 1)
i = I.repeat(Ival)
number = number - i.length
allrnt = m + d + c + l + x + v + i
console.log(allrnt)
/*
I = 1
V = 5
X = 10
L = 50
C = 100
D = 500
M = 1000
*/
}
//exponents
function exponents(num, exponent){
console.log(Math.pow(num, exponent))
}
//prime factorization
function primefac(num){
var primeFactors = [];
while (num % 2 === 0) {
primeFactors.push(2);
num = num / 2;
}
var sqrtNum = Math.sqrt(num);
for (var i = 3; i <= sqrtNum; i++) {
while (num % i === 0) {
primeFactors.push(i);
num = num / i;
console.log(num)
}
}
if (num > 2) {
primeFactors.push(num);
}
return primeFactors;
}
//factorials
function factorial(num){
var i = num
var num = num - 1
while(num > 0){
var i = i * num
num = num - 1
}
console.log(i)
}
//factorials but instead of multipling it adds
function addorial(num){
var i = num
var num = num - 1
while(num > 0){
var i = i + num
num = num - 1
}
console.log(i)
}
//factorials but instead of multipling it subtracts
function subtorial(num){
var i = num
var num = num - 1
while(num > 0){
var i = i - num
num = num - 1
}
console.log(i)
}
//factorials but instead of multipling it divides
function divorial(num){
var i = num
var num = num - 1
while(num > 0){
var i = i / num
num = num - 1
}
console.log(i)
}
//mean
function mean() {
var args = arguments;
var numbers = [];
for(var i=0; i<args.length; i++){
numbers.push(args[i])
}
function sortNumber(a, b) {
return a - b;
}
numbers.sort(sortNumber);
for(var i=0; i<args.length; i++){
numbers[0] = numbers[0] + numbers[i]
}
console.log(`Mean: ${numbers[0] / numbers.length}`)
}
//median
function median() {
var args = arguments;
var numbers = [];
for(var i=0; i<args.length; i++){
numbers.push(args[i])
}
function sortNumber(a, b) {
return a - b;
}
numbers.sort(sortNumber);
let median = []
median[0] = numbers[Math.floor(numbers.length / 2)]
if(numbers.length % 2 === 0){
median[0] = numbers[numbers.length / 2 - 1]
median[1] = numbers[numbers.length / 2]
}
console.log("Median: " + median)
}
//mode
function mode() {
var args = arguments;
var numbers = [];
for(var i=0; i<args.length; i++){
numbers.push(args[i])
}
var modeMap = {};
var maxEl = numbers[0], maxCount = 1;
for(var i = 0; i < numbers.length; i++)
{
var el = numbers[i];
if(modeMap[el] == null)
modeMap[el] = 1;
else
modeMap[el]++;
if(modeMap[el] > maxCount)
{
maxEl = el;
maxCount = modeMap[el];
}
}
}
//range
function range() {
var args = arguments;
var numbers = [];
for(var i=0; i<args.length; i++){
numbers.push(args[i])
}
function sortNumber(a, b) {
return a - b;
}
numbers.sort(sortNumber);
console.log(numbers);
console.log("Range: " + numbers[0] + " to " + numbers[numbers.length - 1])
console.log(`Difference: ${numbers[numbers.length - 1] - numbers[0]}`)
};
//sort numbers
function sort() {
var args = arguments;
var numbers = [];
for(var i=0; i<args.length; i++){
numbers.push(args[i])
}
function sortNumber(a, b) {
return a - b;
}
numbers.sort(sortNumber);
console.log(numbers);
}
function circle_circumference(radius) {
console.log("Radius: " + radius)
circ = 2 * Math.PI * radius
console.log("Circumference: " + circ)
}
function circle_area(radius){
console.log("Radius: " + radius)
area = Math.pow(radius, 2) * Math.PI
console.log("Area: " + area)
}
function help(){
console.log(`
prime(value)
lcm(x, y)
gcf(x, y)
narnum(value)
comp(value) // check if a number is composite
fibinum(max)
digitsfunc(num, func) // find the + - * / of all the digits in a number
isperfsq(value) // check if a number is a perfect square
perfsq(max) // how many perfect squares from 0 to max
factors(value)
oddorevennum(num)
wholenum(num)
natnum(num) // check if a number is natural
rnt(number) // translate from decimal to roman numeral
exponents(num, exponent)
primefac(num)
factorial(num)
addorial(num)
subtorial(num)
divorial(num)
mean(values, values)
median(values, values)
mode(values, values)
range(values, values)
sort(values, values)
circle_circumference(radius)
circle_area(radius)
`)
}
help()