formatting: why can't numbers be formatted as numbers in Google Sheets?

On this sample sheet, the numbers are actually text.

I tried Format-> Number, then Number, Percentage, and Scientific, and they still appear as text.

As experiments: I can't add 1 to these, and I can't pass them to value() function. They don't have an apostrophe at first, which would make them text.

How can I format these numbers as numbers?
enter the image description here

C # How to remove characters, numbers and blanks from an array of strings?

Remove characters, numbers, and blanks from
current string [] = "a] 773 b"; "e] 1597 t"; "z] 0 c"
so that the result is string [] result = "a, b"; "e, t"; "z, c"?
note: deleted items must be replaced with ",".

Fourier analysis and complex numbers.

In Fourier analysis, why do we transform real variables into complex variables, why can't we transform the real into the real? Why use complex numbers?

What natural numbers are interesting? [closed]

Is each natural number interesting?

watch this video at the following link:

What is your idea? is the test correct?

java – How to print only the odd numbers in the form of a pyramid?

How could I print the odd pyramid numbers and the sum between them?

In order to add the odd ones we need to know the index and the maximum and final position of each row of the pyramid.

For example, these could be the initial indices:

             1     <- i = 0    

          3        <- i = 1 

       7           <- i = 3

   13              <- i = 6

21                 <- i = 10

So the variable i represents the initial index of each element of the pyramid ({1, 3, 7, 13, 21}).

However, we need to know what the final index of X pyramid row.

The final indices would be:

           Indice:           Inicial   Final
             1               (i = 0,   n = 1)

          3     5            (i = 1,   n = 3)

       7     9    11         (i = 3,   n = 6)

   13    15    17    19      (i = 6,   n = 10)

21    23    25    27    29   (i = 10,  n = 15)

What is the use of knowing these indices?

It helps us to go through each row of the pyramid and in this way we can know which are the odd or even numbers. An analogy would be an array of integers, each row has X elements, in which, we could get the sum of all the even numbers. This is similar to a pyramid of elements. The difference is that in a matrix the final index is always constant (the size of the column is the same for each row) and in a pyramid of elements it varies.

The million dollar question: How on earth do I get the final index of each row?

With this simple formula:

N = row + i;

Where:

  • N is the final index.
  • row is the number of the row.
  • i is the initial index.

Let's start evaluating some rows:

  • In the 1st row i = 0 Y row = 1, at the time of replacing in the formula gives us as a result: N = 1 + 0 = 1.

  • In the 2nd row i = 1 Y row = 2, when replacing gives us: N = 2 + 1 = 3.

  • In the 3rd i = 3 Y row = 3, when replacing, N = 3 + 3 = 6.

And so on we are replacing the values ​​in each row.

With this we already have the problem solved. Now let's start modeling our classes.

The first class we will have will be PyramidRow. In this class we will have the necessary attributes to be able to store the initial and final index of X row.

Example:

class PyramidRow
{
    private int begin; //índice inicial
    private int max;//índice final

    public PyramidRow(int begin, int max)
    {
        this.begin = begin;
        this.max = max;
    }

    public int getBegin()
    {
        return begin;
    }

    public void setBegin(int begin)
    {
        this.begin = begin;
    }

    public int getMax()
    {
        return max;
    }

    public void setMax(int max)
    {
        this.max = max;
    }
}

Then we will create another class called PyramidRowList in which it will serve to create a list of objects of type PyramidRow. In this way we will have the information (initial and final index) of each row in a list.

class PyramidRowList
{
    private List listRows;

    public PyramidRowList()
    {
        listRows = new ArrayList<>();
    }

    public List getListRows()
    {
        return listRows;
    }

    public void setListRows(List listRows)
    {
        this.listRows = listRows;
    }
    //El parámetro length es para guardar el tamaño del vector
    public void calculateRow(int length)
    {
        int i = 0, n, row = 1;
        while(true)
        {
            n = row + i;
            if(n > length)
                break;
            listRows.add(new PyramidRow(i, n));
            for(; i < n; i++){}
            row++;
        }
    }
}

In the method calculateRow is where we are going to calculate the starting and ending index of each row of the pyramid and then we will save it as an object in the list.

Finally, we only need to go through the list of objects and have access to the initial and final index of each row:

public class Program 
{
    public static void main(String() arg)
    {
        int impares = 0;
        int lengthPyramid;
        int() nums = new int(){1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29};
        //Creamos el objeto
        PyramidRowList listRows = new PyramidRowList();
        //Calculamos los índice iniciales y finales de cada fila
        listRows.calculateRow(nums.length);
        //Almacenamos la cantidad de filas que tenga la piramide
        lengthPyramid = listRows.getListRows().size();
        //Recorremos la lista
        for(PyramidRow row : listRows.getListRows())
        {
            for(int i = lengthPyramid - 1; i != 0; i--)
                System.out.print("t");
            for(int i = row.getBegin(); i < row.getMax(); i++)
            {
                System.out.print(nums(i) + "tt");
                if(nums(i) % 2 != 0)
                    impares += nums(i);
            }
            System.out.print("= "+ impares);
            System.out.println("");
            lengthPyramid--;
            impares = 0;
        }
    }
}


class Program 
{
    public static void main(String() arg)
    {
        int suma = 0;
        int() nums = new int(){1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29};
        for(int i = 0; i != nums.length; ++i)
        {
            if(nums(i) % 2 != 0)
            {
                suma += nums(i);
                System.out.println(nums(i));
            }
        }
        System.out.println("La suma de los numeros impares es: "+ suma);
    }
}

And ready, on the screen you should give us this:
img1

macos – How to make a scatter diagram using Apple Numbers?

I'm trying to make a scatter diagram in Numbers but I can't get it to work. If I select column A and B and have it make a scatter plot, use column A for both axes. If I click on the graph and go to Series it shows the values ​​used for x and y, see the image below.

enter the image description here

The image above is what I get when I select columns A and B to try plotting. If I go into that configuration box and manually change the y axis to column B, it changes back to A when I click trace. I tried this several times by changing the x-axis or y-axis and the same thing happens. Keep plotting the same values ​​for x and y.

I can't use a line graph because a line graph assumes that the points on the x-axis are evenly spaced and distorts your graph.

An example of the numbers I am trying to plot is given below.

Values ​​X 1,2,5,7,8,9

Y Values ​​43,56,103,156,215,300

I just want a simple plot x, y … Can anyone do this in numbers?

I have seen previous questions but none of those answers help me.

aunt

stochastic processes – Large numbers law for Harris' recurring Markov chains. (Meyn, Tweedie and Glynn)

I am trying to familiarize myself with the details of the proof that the Markov chains produced by the Metropolis-Hastings algorithm have a law of large numbers. I found half a dozen or more references to the test in the book by Meyn, Tweedie, and Glynn. I think I follow most of it, but I'm not sure in some of the steps in a part of the test where they prove that a certain function is harmonic.

I realize this may not be the research level, but I've had trouble finding alternative treatments because everyone mentions it!

Here is the relevant section:enter the image description here

Here is my "understanding" of the steps working from below:

Going from 4 to 3 implies a restatement of $ lim_ {n rightarrow infty} sum_ {k = 1} ^ n g ( Phi_k) $.

To go from 3 to 2, one applies the "conditional expectation smoothing property". In the process the $ g ( Phi_1) / n $ the term disappears because the numerator becomes a constant.

To go from 2 to 1 follow from the Markov property. Starting since $ x $ and conditioning in $ Phi_1 $ it's like starting in $ Phi_1 $. This is reflected in the conditioning of $ mathcal {F} ^ { Phi} _1 $ be dropped and $ mathrm {P} _x $ becoming $ mathrm {P} _ { Phi_1} $.

Where I'm missing is in the indexing changes between the steps. I still think maybe the index on the subscript in step 3 should be $ k $ rather than $ k + 1 $ or that the minus sign is a plus sign.

If someone could expand or write down the steps in this referral, they would be very grateful. Sorry if this is trivial (I hope it is!)

linux – duplicate serial numbers on the rack server

A Fujitsu PrimeQuest 2800e2 rack server with 4 system boards has all the hosts reporting the same serial number, which is causing management conflicts, and would require each of them to have their own unique serial number. Could anyone help on how to correct it?

How to define a function applicable to all kinds of numbers?

We can define a generic function as:

Clear(f);
f(x_) := x^2 + 1;

With this definition, we can calculate:

In():= {f(2), f(1.1), f(a), f("hello")}

Out()= {5, 2.21, 1 + a^2, 1 + ("hello")^2}

Let's say I want it to be defined only in numbers, so it returns:

Out()= {5, 2.21, f(a), f("hello")}

We can probably define f(x_Integer), f(x_Real), ..., but they will be duplicate codes, so it is not desirable. I wonder if there is a common basis Number for all numbers, so it can be defined as f(x_Number) only once and it is automatically applied to all different types of numbers.

Are there infinite prime numbers that satisfy this congruence?

I am curious to know if there are infinite prime numbers p, q, r such that:

$ p cdot q cdot r equiv a ^ 3-1 pmod {(b ^ 3 + 1)} $, for p, q, r, a, b coprime and a, b> 0, with $ a ^ 3-1 $ Y $ b ^ 3 + 1 $<$ p cdot q cdot r $