JavaScript Math and Numbers - Exercises, Practice, Solution

JavaScript Math [114 exercises with solution]

[An editor is available at the bottom of the page to write and execute the scripts.]

1. Write a JavaScript function to convert a number from one base to another. Go to the editor
Note : Both bases must be between 2 and 36.
Test Data :
console.log(base_convert('E164',16,8));
console.log(base_convert(1000,2,8));
"160544"
"10"
Click me to see the solution

2. Write a JavaScript function to convert a binary number to a decimal number. Go to the editor
Test Data :
console.log(bin_to_dec('110011'));
console.log(bin_to_dec('100'));
51
4
Click me to see the solution

3. Write a JavaScript function to convert a decimal number to binary, hexadecimal or octal number. Go to the editor
Test Data :
console.log(dec_to_bho(120,'B'));
console.log(dec_to_bho(120,'H'));
console.log(dec_to_bho(120,'O'));
"1111000"
"78"
"170"
Click me to see the solution

4. Write a JavaScript function to generate a random integer. Go to the editor
Test Data :
console.log(rand(20,1));
console.log(rand(1,10));
console.log(rand(6));
console.log(rand());
15
5
1
0
Click me to see the solution

5. Write a JavaScript function to format a number up to specified decimal places. Go to the editor
Test Data :
console.log(decimals(2.100212, 2));
console.log(decimals(2.100212, 3));
console.log(decimals(2100, 2));
"2.10"
"2.100"
"2100.00"
Click me to see the solution

6. Write a JavaScript function to find the highest value in an array. Go to the editor
Test Data :
console.log(max([12,34,56,1]));
console.log(max([-12,-34,0,-56,-1]));
56
0
Click me to see the solution

7. Write a JavaScript function to find the lowest value in an array. Go to the editor
Test Data :
console.log(min([12,34,56,1]));
console.log(min([-12,-34,0,-56,-1]));
1
-56
Click me to see the solution

8. Write a JavaScript function to get the greatest common divisor (gcd) of two integers. Go to the editor
Note :
According to Wikipedia - In mathematics, the greatest common divisor (gcd) of two or more integers, when at least one of them is not zero, is the largest positive integer that divides the numbers without a remainder. For example, the GCD of 8 and 12 is 4.

Test Data :
console.log(gcd_two_numbers(12, 13));
console.log(gcd_two_numbers(9, 3));
Output :
1
3
Click me to see the solution

9. Write a JavaScript function to find the GCD (greatest common divisor) of more than 2 integers. Go to the editor
Test Data :
console.log(gcd_more_than_two_numbers([3,15,27]));
console.log(gcd_more_than_two_numbers([5,10,15,25]));
Output :
3
5
Click me to see the solution

10. Write a JavaScript function to get the least common multiple (LCM) of two numbers. Go to the editor
Note :
According to Wikipedia - A common multiple is a number that is a multiple of two or more integers. The common multiples of 3 and 4 are 0, 12, 24, .... The least common multiple (LCM) of two numbers is the smallest number (not zero) that is a multiple of both.
Test Data :
console.log(lcm_two_numbers(3,15));
console.log(lcm_two_numbers(10,15));
Output :
15
30
Click me to see the solution

11. Write a JavaScript function to get the least common multiple (LCM) of more than 2 integers. Go to the editor
Test Data :
console.log(lcm_more_than_two_numbers([100,90,80,7]));
console.log(lcm_more_than_two_numbers([5,10,15,25]));
Output :
25200
150
Click me to see the solution

12. Write a JavaScript function to find out if a number is a natural number or not. Go to the editor
Note :
Natural numbers are whole numbers from 1 upwards : 1, 2, 3, and so on ... or from 0 upwards in some area of mathematics: 0, 1, 2, 3 and so on ...
No negative numbers and no fractions.
Test Data :
console.log(is_Natural(-15));
console.log(is_Natural(1));
console.log(is_Natural(10.22));
console.log(is_Natural(10/0));
Output :
false
true
false
false
Click me to see the solution

13. Write a JavaScript function to test if a number is a power of 2. Go to the editor
Test Data :
console.log(power_of_2(16));
console.log(power_of_2(18));
console.log(power_of_2(256));
Output :
true
false
true
Click me to see the solution

14. Write a JavaScript function to round a number to a given decimal places. Go to the editor
Test Data :
console.log(precise_round(12.375,2));
console.log(precise_round(-10.3079499, 3));
console.log(precise_round(10.49999,0));
console.log(precise_round(10.49999,2));
Output :
12.38
-10.308
10
10.50
Click me to see the solution

15. Write a JavaScript function to check whether a value is an integer or not. Go to the editor
Note : Integer - A number which is not a fraction; a whole number.
Test Data :
console.log(is_Int(23));
console.log(is_Int(4e2));
console.log(is_Int(NaN));
console.log(is_Int(23.75));
console.log(is_Int(-23));
Output :
true
true
false
false
true
Click me to see the solution

16. Write a JavaScript function to check to check whether a variable is numeric or not. Go to the editor
Test Data :
console.log(is_Numeric(12));
console.log(is_Numeric('abcd'));
console.log(is_Numeric('12'));
console.log(is_Numeric(' '));
console.log(is_Numeric(1.20));
console.log(is_Numeric(-200));
Output :
true
false
true
false
true
true
Click me to see the solution

17. Write a JavaScript function to calculate the sum of values in an array. Go to the editor
Test Data :
console.log(sum([1,2,3]));
console.log(sum([100,-200,3]));
console.log(sum([1,2,'a',3]));
Output :
6
-97
6
Click me to see the solution

18. Write a JavaScript function to calculate the product of values in an array. Go to the editor
Test Data :
console.log(product([1,2,3]));
console.log(product([100,-200,3]));
console.log(product([1,2,'a',3]));
Output :
6
-60000
6
Click me to see the solution

19. Create a Pythagorean function in JavaScript. Go to the editor
Note : The Pythagorean Theorem tells us that the relationship in every right triangle is : c² = a² + b², where c is the hypotenuse and a, b are two legs of the triangle.
Test Data :
console.log(pythagorean_theorem(2, 4));
console.log(pythagorean_theorem(3, 4));
Output :
4.47213595499958
5
Click me to see the solution

20. Write a JavaScript program to evaluate binomial coefficients. Go to the editor
Note :
Binomial coefficient : According to Wikipedia - In mathematics, binomial coefficients are a family of positive integers that occur as coefficients in the binomial theorem. They are indexed by two nonnegative integers; the binomial coefficient indexed by n and k. Under suitable circumstances the value of the coefficient is given by the expression :

Arranging binomial coefficients into rows for successive values of n, and in which k ranges from 0 to n, gives a triangular array called Pascal's triangle.

Test Data :
console.log(binomial(8,3));
console.log(binomial(10,2));
Output :
56
45

Click me to see the solution

21. Write a JavaScript function that Convert an integer into a Roman Numeral in javaScript. Go to the editor

Click me to see the solution

22. Write a JavaScript function that Convert Roman Numeral to Integer. Go to the editor
Click me to see the solution

23. Write a JavaScript function to create a UUID identifier. Go to the editor
Note :
According to Wikipedia - A universally unique identifier (UUID) is an identifier standard used in software construction. A UUID is simply a 128-bit value. The meaning of each bit is defined by any of several variants. For human-readable display, many systems use a canonical format using hexadecimal text with inserted hyphen characters. For example : de305d54-75b4-431b-adb2-eb6b9e546014

Click me to see the solution

24. Write a JavaScript function to round a number to a specified number of digits and strip extra zeros (if any). Go to the editor
Test Data :
var a = -4.55555;
console.log(result);
-4.5556
var a = 5.0001000;
console.log(result);
5.0001
Click me to see the solution

25. Write a JavaScript function to make currency math (add, subtract, multiply, division etc.). Go to the editor
Test Data :
n1 = '$40.24', n2 = '$21.57';
Click me to see the solution

26. Write a JavaScript function to calculate the nth root of a number. Go to the editor
Test Data :
console.log(nthroot(64, 2));
8
console.log(nthroot(64, -2));
0.125
Click me to see the solution

27. Write a JavaScript function to calculate degrees between 2 points with inverse Y axis. Go to the editor
Test Data :
console.log(pointDirection(1, 0, 12, 0));
0
console.log(pointDirection(1, 0, 1, 10));
90
Click me to see the solution

28. Write a JavaScript function to round up an integer value to the next multiple of 5. Go to the editor
Test Data :
console.log(int_round5(32));
35
console.log(int_round5(137));
140
Click me to see the solution

29. Write a JavaScript function to convert a positive number to negative number. Go to the editor
Test Data :
console.log(pos_to_neg(15));
-15
Click me to see the solution

30. Write a JavaScript function to cast a square root of a number to an integer. Go to the editor
Test Data :
console.log(sqrt_to_int(17));
4
Click me to see the solution

31. Write a JavaScript function to get the highest number from three different numbers. Go to the editor
Test Data :
console.log(highest_of_three(-5, 4, 2));
4
Click me to see the solution

32. Write a JavaScript function to calculate the percentage (%) of a number. Go to the editor
Test Data :
console.log(percentage(1000, 47.12));
471.2
Click me to see the solution

33. Write a JavaScript function to convert an angle from degrees to radians. Go to the editor
Test Data :
console.log(degrees_to_radians(45));
0.7853981633974483
Click me to see the solution

34. Write a JavaScript function to convert radians to degrees. Go to the editor
Test Data :
console.log(radians_to_degrees(0.7853981633974483));
45
Click me to see the solution

35. Write a JavaScript function for the Pythagorean theorem. Go to the editor
According to Wikipedia : In mathematics, the Pythagorean theorem, also known as Pythagoras' theorem, is a relation in Euclidean geometry among the three sides of a right triangle. It states that the square of the hypotenuse (the side opposite the right angle) is equal to the sum of the squares of the other two sides. The theorem can be written as an equation relating the lengths of the sides a, b and c, often called the "Pythagorean equation".
Test Data :
console.log(pythagorean(4, 3));
5
Click me to see the solution

36. Write a JavaScript function which will return values that are powers of two. Go to the editor
Test Data :
console.log(isPower_of_two(64));
true
console.log(isPower_of_two(94));
false
Click me to see the solution

37. Write a JavaScript function to limit a value inside a certain range. Go to the editor
Note : If the value is higher than max it will return max. and if the value is smaller than min it will return the min.
Test Data :
console.log(value_limit(7, 1, 12));
7
console.log(value_limit(-7, 0, 12));
0
console.log(value_limit(15, 0, 12));
12
Click me to see the solution

38. Write a JavaScript function to check if a number is a whole number or has a decimal place. Go to the editor
Note : Whole Numbers are simply the numbers 0, 1, 2, 3, 4, 5, ... (and so on). No Fractions!
Test Data :
console.log(number_test(25.66));
"Number has a decimal place."
console.log(number_test(10));
"It is a whole number."
Click me to see the solution

39. Write a JavaScript function to print an integer with commas as thousands separators. Go to the editor
Test Data :
console.log(thousands_separators(1000));
"1,000"
console.log(thousands_separators(10000.23));
"10,000.23"
console.log(thousands_separators(100000));
"100,000"
Click me to see the solution

40. Write a JavaScript function to create random background color. Go to the editor
Click me to see the solution

41. Write a JavaScript function to count the digits of an integer. Go to the editor
Click me to see the solution

42. Write a JavaScript function to calculate the combination of n and r. Go to the editor
The formula is : n!/(r!*(n - r)!).
Test Data :
console.log(combinations(6, 2));
15
console.log(combinations(5, 3));
10
Click me to see the solution

43. Write a JavaScript function to get all prime numbers from 0 to a specified number. Go to the editor
Test Data :
console.log(primeFactorsTo(5));
[2, 3, 5]
console.log(primeFactorsTo(15));
[2, 3, 5, 7, 11, 13]
Click me to see the solution

44. Write a JavaScript function to show the first twenty Hamming numbers. Go to the editor
Hamming Numbers are numbers whose only prime factors are 2, 3 and 5.
Click me to see the solution

45. Write a JavaScript function to subtract elements from one another in an array. Go to the editor
Click me to see the solution

46. Write a JavaScript function to calculate the divisor and modulus of two integers. Go to the editor
Click me to see the solution

47. Write a JavaScript function to calculate the extended Euclid Algorithm or extended GCD. Go to the editor
In mathematics, the Euclidean algorithm[a], or Euclid's algorithm, is an efficient method for computing the greatest common divisor (GCD) of two numbers, the largest number that divides both of them without leaving a remainder. It is named after the ancient Greek mathematician Euclid, who first described it in Euclid's Elements. It is an example of an algorithm, a step-by-step procedure for performing a calculation according to well-defined rules, and is one of the oldest algorithms in common use. It can be used to reduce fractions to their simplest form, and is a part of many other number-theoretic and cryptographic calculations.
Click me to see the solution

48. Write a JavaScript function to calculate the falling factorial of a number. Go to the editor
Let x be a real number (but usually an integer).
Let k be a positive integer.
Then x to the (power of) k falling is :

This is called the kth falling factorial power of x.
Click me to see the solution

49. Write a JavaScript function to calculate Lanczos approximation gamma. Go to the editor
In mathematics, the Lanczos approximation is a method for computing the Gamma function numerically, published by Cornelius Lanczos in 1964. It is a practical alternative to the more popular Stirling's approximation for calculating the Gamma function with fixed precision.
Click me to see the solution

50. Write a JavaScript program to add two complex numbers. Go to the editor
A complex number is a number that can be expressed in the form a + bi, where a and b are real numbers and i is the imaginary unit, that satisfies the equation i² = −1. In this expression, a is the real part and b is the imaginary part of the complex number.
Click me to see the solution

51. Write a JavaScript program to subtract two complex numbers. Go to the editor
Click me to see the solution

52. Write a JavaScript program to multiply two complex numbers. Go to the editor
Click me to see the solution

53. Write a JavaScript program to divide two complex numbers. Go to the editor
Click me to see the solution

54. Write a JavaScript program to check if a given number is a power of 10. Go to the editor
Click me to see the solution

55. Write a JavaScript program to swap two given variables. Go to the editor
Swapping two variables refers to mutually exchanging the values of the variables. Generally, this is done with the data in memory.
Click me to see the solution

56. Write a JavaScript program to calculate the volume of a Cuboid. Go to the editor
From Wikipedia -
In geometry, a cuboid is a hexahedron, a six-faced solid. Its faces are quadrilaterals. Cuboid means "like a cube", in the sense that by adjusting the length of the edges or the angles between edges and faces a cuboid can be transformed into a cube.
Click me to see the solution

57. Write a JavaScript program to calculate the volume of a Cube. Go to the editor
From Wikipedia -
In geometry, a cube is a three-dimensional solid object bounded by six square faces, facets or sides, with three meeting at each vertex. The cube is the only regular hexahedron and is one of the five Platonic solids. It has 6 faces, 12 edges, and 8 vertices.
Click me to see the solution

58. Write a JavaScript program to calculate the volume of a Cone. Go to the editor
From Wikipedia -
A cone is a three-dimensional geometric shape that tapers smoothly from a flat base (frequently, though not necessarily, circular) to a point called the apex or vertex.
A cone is formed by a set of line segments, half-lines, or lines connecting a common point, the apex, to all of the points on a base that is in a plane that does not contain the apex. Depending on the author, the base may be restricted to be a circle, any one-dimensional quadratic form in the plane, any closed one-dimensional figure, or any of the above plus all the enclosed points.
Click me to see the solution

59. Write a JavaScript program to calculate the volume of a Pyramid. Go to the editor
In geometry, a pyramid is a polyhedron formed by connecting a polygonal base and a point, called the apex. Each base edge and apex form a triangle, called a lateral face. It is a conic solid with polygonal base. A pyramid with an n-sided base has n + 1 vertices, n + 1 faces, and 2n edges. All pyramids are self-dual.
Click me to see the solution

60. Write a JavaScript program to calculate the volume of a Cylinder. Go to the editor
From Wikipedia -
A cylinder has traditionally been a three-dimensional solid, one of the most basic of curvilinear geometric shapes. In elementary geometry, it is considered a prism with a circle as its base.
A cylinder may also be defined as an infinite curvilinear surface in various modern branches of geometry and topology. The shift in the basic meaning - solid versus surface (as in ball and sphere) - has created some ambiguity with terminology. The two concepts may be distinguished by referring to solid cylinders and cylindrical surfaces. In the literature the unadorned term cylinder could refer to either of these or to an even more specialized object, the right circular cylinder.
Click me to see the solution

61. Write a JavaScript program to calculate the volume of a Triangular Prism. Go to the editor
From Wikipedia -
In geometry, a triangular prism is a three-sided prism; it is a polyhedron made of a triangular base, a translated copy, and 3 faces joining corresponding sides. A right triangular prism has rectangular sides, otherwise it is oblique. A uniform triangular prism is a right triangular prism with equilateral bases, and square sides.
Click me to see the solution

62. Write a JavaScript program to calculate the volume of a prism using only its height and one of its hexagonal sides. Go to the editor
In geometry, the pentagonal prism is a prism with a pentagonal base. It is a type of heptahedron with seven faces, fifteen edges, and ten vertices.
Click me to see the solution

63. Write a JavaScript program to calculate the volume of a Sphere. Go to the editor
From Wikipedia -
A sphere is a geometrical object that is a three-dimensional analogue to a two-dimensional circle. A sphere is the set of points that are all at the same distance r from a given point in three-dimensional space.That given point is the centre of the sphere, and r is the sphere's radius. The earliest known mentions of spheres appear in the work of the ancient Greek mathematicians
Click me to see the solution

64. Write a JavaScript program to calculate the volume of a Hemisphere. Go to the editor
Hemisphere refers to a half of a sphere:
A sphere is a geometrical object that is a three-dimensional analogue to a two-dimensional circle. A sphere is the set of points that are all at the same distance r from a given point in three-dimensional space.[2] That given point is the centre of the sphere, and r is the sphere's radius. The earliest known mentions of spheres appear in the work of the ancient Greek mathematicians.
Click me to see the solution

65. Write a JavaScript program to get the Nth Lucas Number. Go to the editor
From Wikipedia-
The Lucas numbers or Lucas series are an integer sequence named after the mathematician Francois Edouard Anatole Lucas (1842-1891), who studied both that sequence and the closely related Fibonacci numbers. Lucas numbers and Fibonacci numbers form complementary instances of Lucas sequences.
The Lucas series has the same recursive relationship as the Fibonacci sequence, where each term is the sum of the two previous terms, but with different starting values. This produces a sequence where the ratios of successive terms approach the golden ratio, and in fact the terms themselves are roundings of integer powers of the golden ratio. The sequence also has a variety of relationships with the Fibonacci numbers, like the fact that adding any two Fibonacci numbers two terms apart in the Fibonacci sequence results in the Lucas number in between.
Click me to see the solution

66. Write a JavaScript program to find the 'twin prime' of a given prime number. Go to the editor
From Wikipedia,
A twin prime is a prime number that is either 2 less or 2 more than another prime number-for example, either member of the twin prime pair (41, 43). In other words, a twin prime is a prime that has a prime gap of two. Sometimes the term twin prime is used for a pair of twin primes; an alternative name for this is prime twin or prime pair.
Usually the pair (2, 3) is not considered to be a pair of twin primes. Since 2 is the only even prime, this pair is the only pair of prime numbers that differ by one; thus twin primes are as closely spaced as possible for any other two primes.
The first few twin prime pairs are:
(3, 5), (5, 7), (11, 13), (17, 19), (29, 31), (41, 43), (59, 61), (71, 73), (101, 103), (107, 109), (137, 139), ....
Click me to see the solution

67. Write a JavaScript program to calculate the sum of a geometric progression. Go to the editor
From Wikipedia,
In mathematics, a geometric series is the sum of an infinite number of terms that have a constant ratio between successive terms. For example, the series

is geometric, because each successive term can be obtained by multiplying the previous term by 1/2. In general, a geometric series is written as a + ar + ar² + ar³ + ..., where a is the coefficient of each term and r is the common ratio between adjacent terms. The geometric series had an important role in the early development of calculus, is used throughout mathematics, and can serve as an introduction to frequently used mathematical tools such as the Taylor series, the complex Fourier series, and the matrix exponential.
Click me to see the solution

68. Write a JavaScript program to calculate the sum of the digits of a given number. Go to the editor
In mathematics, the digit sum of a natural number in a given number base is the sum of all its digits. For example, the digit sum of the decimal number 6098 would be 6+0+9+8=23.
Click me to see the solution

69. Write a JavaScript program to find all prime numbers below a given number. Go to the editor
From Wikipedia -
In mathematics, the sieve of Eratosthenes is an ancient algorithm for finding all prime numbers up to any given limit. It does so by iteratively marking as composite (i.e., not prime) the multiples of each prime, starting with the first prime number, 2. The multiples of a given prime are generated as a sequence of numbers starting from that prime, with constant difference between them that is equal to that prime. This is the sieve's key distinction from using trial division to sequentially test each candidate number for divisibility by each prime. Once all the multiples of each discovered prime have been marked as composites, the remaining unmarked numbers are primes.
Click me to see the solution

70. Write a JavaScript program to apply Reverse Polish notation in a given mathematical expression. Go to the editor
From Wikipedia -
Reverse Polish notation (RPN), also known as reverse Lukasiewicz notation, Polish postfix notation or simply postfix notation, is a mathematical notation in which operators follow their operands, in contrast to Polish notation (PN), in which operators precede their operands. It does not need any parentheses as long as each operator has a fixed number of operands. The description "Polish" refers to the nationality of logician Jan Lukasiewicz, who invented Polish notation in 1924.
Click me to see the solution

71. Write a JavaScript program to print all prime factors of a given number. Go to the editor
Test Data:
(75) -> [3, 5, 5]
(18) -> [2, 3, 3]
(101) -> [101]
Click me to see the solution

72. Write a JavaScript program to check if a given number is pronic using product of two consecutive numbers. If the number is pronic return true otherwise false. Go to the editor
From Wikipedia -
A pronic number is a number that is the product of two consecutive integers, that is, a number of the form n(n+1). The study of these numbers dates back to Aristotle. They are also called oblong numbers, heteromecic numbers, or rectangular numbers; however, the term "rectangular number" has also been applied to the composite numbers.
The first few pronic numbers are:
0, 2, 6, 12, 20, 30, 42, 56, 72, 90, 110, 132, 156, 182, 210, 240, 272, 306, 342, 380, 420, 462 ...
Test Data:
6 -> true
110 -> true
200 -> false
Click me to see the solution

73. Write a JavaScript program to check if a given positive integer can be expressed as sum of two or more consecutive positive integers. Go to the editor
Test Data:
33 can be represented as 11 + 22
10 = 1+2+3+4
but 8 cannot be represented in this way.
Click me to see the solution

74. Write a JavaScript program to convert a hexadecimal number to its binary equivalent (as a string). Go to the editor
From Wikipedia -
In mathematics and computing, the hexadecimal (also base-16 or simply hex) numeral system is a positional numeral system that represents numbers using a radix (base) of 16. Unlike the decimal system representing numbers using 10 symbols, hexadecimal uses 16 distinct symbols, most often the symbols "0"-"9" to represent values 0 to 9, and "A"-"F" (or alternatively "a"-"f") to represent values from 10 to 15.
A binary number is a number expressed in the base-2 numeral system or binary numeral system, a method of mathematical expression which uses only two symbols: typically "0" (zero) and "1" (one)
Test Data:
("7B316") -> "1111011001100010110"
("6F16") -> "110111100010110"
("4B2A16") -> "10010110010101000010110"
Click me to see the solution

75. Write a JavaScript program to swap three numbers without a third variable. Go to the editor
Test Data:
(100, 200, 300) -> 300, 100, 200
Click me to see the solution

76. Write a JavaScript program to subtract one integer from another, without using any arithmetic operators such as -, %, /, +, etc. Go to the editor
Test Data:
(200, 100) -> 100
(200, 300) -> -100
(-200, -300) -> 100
(200, 200) -> 0
Click me to see the solution

77. Write a JavaScript program to given two non-negative integers num1 and num2 represented as string, return the sum of num1 and num2. Go to the editor
Test Data:
("123", "123") -> 246
("45", "100") -> 145
Click me to see the solution

78. Write a JavaScript program that takes an integer n and return the nth Tetrahedral number. Go to the editor
A tetrahedral number, or triangular pyramidal number, is a figurate number that represents a pyramid with a triangular base and three sides, called a tetrahedron. The formula for the nth tetrahedral number is represented by the 3rd rising factorial of n divided by the factorial of 3:

The tetrahedral numbers are:
1, 4, 10, 20, 35, 56, 84, 120, 165, 220, ...
Test Data:
(1) -> 1
(2) -> 4
(3) -> 10
(4) -> 20
(5) -> 35
Click me to see the solution

79. Write a JavaScript program program to get the number of dots based on the triangular number of the sequence. Go to the editor
From Wikipedia -
A triangular number or triangle number counts objects arranged in an equilateral triangle. Triangular numbers are a type of figurate number, other examples being square numbers and cube numbers. The nth triangular number is the number of dots in the triangular arrangement with n dots on each side, and is equal to the sum of the n natural numbers from 1 to n. The sequence of triangular numbers, starting with the 0th triangular number, is
0, 1, 3, 6, 10, 15, 21, 28, 36, 45, 55, 66, 78, 91, 105, 120, 136, 153, 171, 190, 210, 231, 253, 276, 300, 325, 351, 378, 406, 435, 465, 496, 528, 561, 595, 630, 666...
Test Data:
(1) -> 1
(2) -> 3
(3) -> 6
(7) -> 28
(11) -> 66
Click me to see the solution

80. Write a JavaScript program to check whether a given integer is a Repdigit or not. Go to the editor
From Wikipedia -
In recreational mathematics, a repdigit or sometimes monodigit is a natural number composed of repeated instances of the same digit in a positional number system (often implicitly decimal). The word is a portmanteau of repeated and digit. Examples are 11, 666, 4444, and 999999.
Test Data:
(11) -> true
(66) -> true
(336) -> false
(444) -> true
(1151) -> false
Click me to see the solution

81. Write a JavaScript program to multiply every digit of a number three times. Go to the editor
Test Data:
(11) -> 11
(66) -> 216216
(336) -> 2727216
(444) -> 646464
(1151) -> 111251
Click me to see the solution

82. Write a JavaScript program to calculate the mean of all digits of a given number. Go to the editor
What is a Mean?
In mathematics, the mean represents the simple average of two or more numbers. There are several methods available for computing the mean of a set of numbers, including the arithmetic mean method, which uses the sum of the numbers in the series, and the geometric mean method, which is the average of a set of products.
Test Data:
(11) -> 1
(66) -> 6
(336) -> 4
(444) -> 4
(1151) -> 2
Click me to see the solution

83. Write a JavaScript program to find the missing number from a given array. There are no duplicates in the list. Go to the editor
Test Data:
([1,2,3,5,6,7]) -> 4
([2,3,4,5]) -> 1
Click me to see the solution

84. Write a JavaScript program to calculate the sum of the two highest positive numbers from a given array. Go to the editor
Test Data:
([1,2,6,3,4,5,6,7]) ->13
([2,3,4,5]) -> 9
Click me to see the solution

85. Write a JavaScript program to compute the sum of the main diagonal elements of a square matrix. Go to the editor

In mathematics, a matrix (plural matrices) is a rectangular array or table of numbers, symbols, or expressions, arranged in rows and columns, which is used to represent a mathematical object or a property of such an object.
An m x n matrix: the m rows are horizontal and the n columns are vertical

In mathematics, a square matrix is a matrix with the same number of rows and columns. An n-by-n matrix is known as a square matrix of order n. Any two square matrices of the same order can be added and multiplied.
Test Data:
([ [1, 2, 3], [4, 5, 6], [7, 8, 9] ]) -> 15
( [ [-1, -2], [-4, -5] ]) -> -6
Click me to see the solution

86. Write a JavaScript program to get the middle character(s) from a given string. Go to the editor
Test Data:
("abcd") -> "bc"
("abc") -> "b"
("JavaScript") -> "Sc"
Click me to see the solution

87. Write a JavaScript program to check a number (positive integer) is Sastry number or not. Go to the editor
The number N is a Sastry number when it is concatenated with N+1 and gives a perfect squares. Some Sastry numbers are 183, 328, 528, 715, 6099, 13224, 40495, 106755, 453288, 2066115, 2975208, 22145328, 28027683, 110213248...
Test Data:
(27) -> false
(328) -> true
(28027683) -> true
Click me to see the solution

88. Write a JavaScript program to check two given vectors are orthogonal or not. Go to the editor
Two vectors are orthogonal if they are perpendicular to each other. i.e. the dot product of the two vectors is zero.
Let u and v are two vectors. The vectors u, v will be orthogonal if they are perpendicular, i.e., they form a right angle, or if the dot product they yield is zero.
Test Data:
([2, 4, 1], [2, 1, -8]) -> true
([1, 0, 1], [0, 0, 1]) -> false
([1, 0, 0], [0, 1, 0]) -> true
Click me to see the solution

89. Write a JavaScript program that takes three arguments x, y, n and calculate the sum of the numbers that are oddly divided by n from the range x, y inclusive. Go to the editor
Test Data:
(1,5,3) -> 3
(100, 1000, 5) -> 99550
Click me to see the solution

90. Write a JavaScript program to check whether a number is a Harshad Number or not. Go to the editor
In recreational mathematics, a harshad number in a given number base, is an integer that is divisible by the sum of its digits when written in that base.
Test Data:
(113) -> false
(171) -> true
(200) -> true
Click me to see the solution

91. Write a JavaScript program to calculate the sum of all odd elements in a square matrix. Go to the editor
Test Data:
([ [1, 2, 3], [4, 5, 6], [7, 8, 9] ]) -> 25
( [ [-1, -2], [-4, -5] ]) -> -6
Click me to see the solution

92. Write a Python program that takes a positive integer and calculate the cube root of the number until the number is less than three. Return the number of steps to complete the said process. Go to the editor
Test Data:
(27) -> 2
(10000) -> 2
(-100) -> "Not a positive number!"
Click me to see the solution

93. Write a JavaScript program to check if an array of integers has an downward trend or not. Go to the editor
Test Data:
([1, 3, 4, 7, 9, 10, 11]) -> false
([11, 10, 9, 7, 4, 3, 2, 0]) -> true
([1, 0, -2, -3, -12]) -> true
Click me to see the solution

94. Write a JavaScript program to calculate the sum and count of even and odd numbers in an array. Go to the editor
Test Data:
([1,2,3,4,5,6,7]) -> 3,12, 4,16
([2,3,5,1,2,0,3,4,2,3,4)] -> 6,14, 5,15
Click me to see the solution

95. Write a JavaScript program that takes an string and returns the last character of each word if the word is even in length or the middle character if it is odd in length. Go to the editor
Test Data:
("Number of even numbers and their sum") -> "r, f, n, b, n, e, u"
("JavaScript Math and Numbers- Exercises Practice Solution") -> "t, h, n, -, c, e, n"
Click me to see the solution

96. Write a JavaScript program that calculates the factorial of a number and return the number of trailing zeroes. Go to the editor
In mathematics, the factorial of a non-negative integer n, denoted by n!, is the product of all positive integers less than or equal to n. The factorial of n also equals the product of n with the next smaller factorial:
n! = n x (n-1) x (n-2) x (n-3)x.....x 3 x 2 x 1
= n x (n-1)!
For example 4! = 4 x 3! = 4 x 3 x 2 x 1 =24
The value of 0! is 1, according to the convention for an empty product. Test Data:
(4) -> 0
(9) -> 1
(10) -> 2
(23) -> 4
(35) -> 8
Click me to see the solution

97. Write a JavaScript program to retrieve the Excel column title associated with a given column number (integer value). Go to the editor
Test Data:
n = 4
Excel column title related with the said column number: D
n = 27
Excel column title related with the said column number: AA
n = 151
Excel column title related with the said column number: EU
Click me to see the solution

98. Write a JavaScript program to get the column number (integer value) that related to a column title as appear in an Excel sheet. Go to the editor
Test Data:
Original text: C
Excel column title related with the said column number: 3
Original text: AD
Excel column title related with the said column number: 30
Original text: ZX
Excel column title related with the said column number: 700
Click me to see the solution

99. Write a JavaScript program to add repeatedly all digits of a given non-negative number until the result has only one digit. Go to the editor
Test Data:
(47) -> 2
(9) -> 9
Click me to see the solution

100. Write a JavaScript program to check a given number is an ugly number or not. Go to the editor
Test Data:
(12) -> true
(18) -> true
(19) -> false
Click me to see the solution

101. Write a JavaScript program to find the n^th ugly number. Go to the editor
Test Data:
(4) -> 4
(10) -> 12
Click me to see the solution

102. Write a JavaScript program to count the number of times the digit 1 appears from 1 to an given integer. Go to the editor
Test Data:
(11) -> 4
(305) -> 161
(0) -> false
Click me to see the solution

103. Write a JavaScript program to calculate the product of non-negative integers n1 and n2 represented as strings. The product is also returned as a string. Go to the editor
Test Data:
("11", "10") -> "110"
("17", "19") -> "323"
("1", "0") -> "0"
("0", "0") -> "0"
Click me to see the solution

104. A staircase consists of N steps, and you are given the choice of climbing one step at a time or two steps at a time.
Write a JavaScript program to find the distinct ways you can climb the staircase. Go to the editor
Test Data:
(2) -> 2
(3) -> 3
Click me to see the solution

105. Write a JavaScript program that converts a given non-negative integer number to its English representation. Go to the editor
Test Data:
(1002) -> One Thousand Two.
(1279) -> One Thousand Two Hundred Seventy Nine.
(127900) -> One Hundred Twenty Seven Thousand Nine Hundred.
(1279000) -> One Million Two Hundred Seventy Nine Thousand.
Click me to see the solution

106. Write a JavaScript program that accepts an integer (n) as input and calculate the lowest number of perfect square numbers that sum to n. Go to the editor
In mathematics, a square number or perfect square is an integer that is the square of an integer; in other words, it is the product of some integer with itself. For example, 9 is a square number, since it equals 32 and can be written as 3 x 3.
Test Data:
(12) -> 3
(13) -> 2
(63) -> 4
Click me to see the solution

107. Write a JavaScript program to check whether a given integer is a power of three or not. Go to the editor
In mathematics, a power of three is a number of the form 3ⁿ where n is an integer - that is, the result of exponentiation with number three as the base and integer n as the exponent.
Test Data:
(27) -> true
(9) -> true
(36) -> false
Click me to see the solution

108. Write a JavaScript program to check whether a given integer is a power of four or not. Go to the editor
In arithmetic and algebra, the fourth power of a number n is the result of multiplying four instances of n together. So: n⁴ = n x n x n x n
Fourth powers are also formed by multiplying a number by its cube. Furthermore, they are squares of squares.
The sequence of fourth powers of integers (also known as biquadrates or tesseractic numbers) is:
0, 1, 16, 81, 256, 625, 1296, 2401, 4096, 6561, 10000, 14641, 20736, 28561, 38416, 50625, 65536, 83521, 104976, 130321, 160000, 194481, 234256, 279841, 331776, 390625, 456976, 531441, 614656, 707281, 810000, ...
Test Data:
(16) -> true
(4096) -> true
(36) -> false
Click me to see the solution

109. Write a JavaScript program that accepts a number (n) and counts all numbers with unique digits of length p within a specified range. Go to the editor
Range: 0 <= p < 10ⁿ
Test Data:
(1) -> 10
(2) -> 91
Click me to see the solution

110. Write a JavaScript program to check whether the sum of two square integers is equal to another given integer. Go to the editor
For example a² + b² = c where c is the given integer.
Test Data:
(2) -> true
(5) -> true
(13) -> true
(15) -> false
Click me to see the solution

111. Write a JavaScript program that creates a multiplication table of size m x n using integers where 1 <= k <= m * n. Return the k^th smallest element in the said multiplication table. Go to the editor
In mathematics, a multiplication table is a mathematical table used to define a multiplication operation for an algebraic system.
The decimal multiplication table was traditionally taught as an essential part of elementary arithmetic around the world, as it lays the foundation for arithmetic operations with base-ten numbers. Many educators believe it is necessary to memorize the table up to 9 x 9.
The illustration below shows a table up to 12 x 12, which is a size commonly used nowadays in English-world schools.

112. Write a JavaScript program to get the maximum value swapping two digits in a given integer. Go to the editor
Test Data:
(100) -> 100
(120) -> 210
(129) -> 921
Click me to see the solution

113. Write a JavaScript program to calculate the smallest number whose digits multiply to a given number. Go to the editor
Test Data:
(100) -> 455
(120) -> 358
(16) -> 28
(129) -> 0
Click me to see the solution

114. Write a JavaScript program to check a given number is self-dividing number or not. Go to the editor
In mathematics, a self-dividing number is one that can be divided by every digit (except digit zero) within it.
Test Data:
(48) -> true
(22) -> true
(63) -> false
Click me to see the solution

More to Come !

* To run the code mouse over on Result panel and click on 'RERUN' button.*

Live Demo:

See the Pen javascript-common-editor by w3resource (@w3resource) on CodePen.

Do not submit any solution of the above exercises at here, if you want to contribute go to the appropriate exercise page.