answersLogoWhite

0


Best Answer

They are prime numbers.

User Avatar

Wiki User

11y ago
This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: What is the term used to describe numbers that can only make 1 array?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Related questions

Why do prime numbers only have one array?

Because they only have one factor pair.


How are all the area model of the prime numbers similar?

They only have one array.


How can you dicribe array?

An array is when you store several data items with a single name. You only use a number to distinguish the individual items. Or two or more numbers, if you use a multidimensional array.An array is when you store several data items with a single name. You only use a number to distinguish the individual items. Or two or more numbers, if you use a multidimensional array.An array is when you store several data items with a single name. You only use a number to distinguish the individual items. Or two or more numbers, if you use a multidimensional array.An array is when you store several data items with a single name. You only use a number to distinguish the individual items. Or two or more numbers, if you use a multidimensional array.


What numbers have only one array?

1,7,11,Well, it depends on what you mean by 'the array of a number'. If it has something to do with the divisors, then it's the primes, or the powers of primes.


You have only one rectangular array and you are between the numbers 12 and 16 what number are you?

13...13x1.


What is single dimensional array in c plus plus?

A one dimensional array is an array of objects that goes in one "direction". Any array with only one [] is a one dimensional array. For example: int numbers[6]; is a one dimensional array. int numbers[6][3]; is a two dimensional array.Graphical terms:One dimensional array[4]:14 - 75 - 8164 - 234Two dimensional array[2][3]:47 - 178108 - 8517 - 128It didn't come out quite how I wanted it...


How do you describe the pattern the square numbers of 12 make on the multiplication table?

Since there is only one square of 12 (= 144) there is not much of a pattern.


How do you describe if half of 37295 is a whole number?

Only even numbers will yield whole numbers when cut in half. 37295 is not even.


How can you use an array of counters to identify whether a number of counters is prime or composite?

If you can arrange the counters in the shape of a rectangle with at least two in each row and each column then the number is composite. The numbers of row and the numbers of columns are factors of the given number. If the only rectangle you can make is the "degenerate" one, with only one row or only one column, then the number is prime.


Is array is structure or not?

Array is not a struct. Array only has one datatype, struct has arbitrary different datatypes.


How would you describe the rule for determining whether the product of many natural numbers is even or odd?

I would describe the rule as one of the simplest possible.The product is odd only if each of the natural numbers is odd. If any one of them is even, the product is even.I would describe the rule as one of the simplest possible.The product is odd only if each of the natural numbers is odd. If any one of them is even, the product is even.I would describe the rule as one of the simplest possible.The product is odd only if each of the natural numbers is odd. If any one of them is even, the product is even.I would describe the rule as one of the simplest possible.The product is odd only if each of the natural numbers is odd. If any one of them is even, the product is even.


How do you write a program to find the greatest common factor of a set of numbers?

You achieve this by putting all the values in container that allows linear traversal, such as an array. If the array has no numbers at all, the greatest common factor is 0. if the array has one number, the greatest common factor is that number. For arrays with two or more numbers, pop the last two numbers and calculate their greatest common factor, pushing the result back onto the array. Repeat until there is only one number left in the array. That number is the greatest common factor of all the original numbers. To implement this, you will need a function that can return the greatest common factor of any two values. The following shows one way to implement this function: unsigned greatest_common_factor (unsigned a, unsigned b) { while (a!=b) a>b?a-=b:b-=a; return a; }