In Google Sheets, I need to find a string and return true / false or even a number in a cell to perform an action.

In my example, I have a column with the names of the signs we produce in our store and I have to be able to isolate similar named signs. Suppose I have to return a value if the cell is Bud Light and only Bud Light among the following:

Light bud
Bud Light Platinum
Bud Light Lime
Bud Light NFL

Performed more than 100 times at random.

I'm trying to determine the cost of signage and promotions.

Link to the Google card

The sheet above is an example of what I'm trying to do.

Number Theory – Can We Reformulate the ABC Guess

The ABC conjecture says that:

Conjecture: Given $ ε> 0 $, then there is a constant $ C_ {ε}> $ 0 as for each triple positive integer $ x, y, z $satisfactory $ x + y = z $ and $ gcd (x, y, z) = $ 1 we have

$$ z <C_ {ε} (rad (xyz)) ^ {1 + ε} $$

or $ rad (xyz) $ means the product of all the divisors of $ xyz $.

Let $ D $ to be the set of $ xyz $triples checking

$$ z> rad (xyz) ^ {1 + ε} $$

This conjecture is equivalent to:

Conjecture: For each $ ε> 0 $, $ D $ has a finite number of elements

My question is this: can we rephrase the last version of the conjecture as follows:

Conjecture: For each $ ε> 0 $, $ S $ has a infinite number of elements

or $ S $ is another set according to $ x, y, z $ and $ ε> 0 $.

Why do I have to deposit BTC as a missing business number?

I accidentally transferred BTC into a non-excising portfolio. The wallet is being created and I need to activate it and check it. To activate and check, I need to deposit 4.9 BTC. Does it works? Why do I have to deposit so many BTCs? There is already 7.3 BTC on this portfolio when it was created

What is determining the number of Adsense ads in a page?

I have a blog about raising chickens. My blog is doing very well in terms of traffic. My problem is that I get one ad per page. I have a lot of content. I've seen other blogs with less content, but more ads are showing. I've checked on a chicken breeding page that there were 5 different ads. What can I do to get more ads?

Grammar without context, how to have the same number of variables in one language

I'm trying to get a CFG for the language:

L & # 39; together $ A $ odd-length strings in $ {a, b } ^ * $ whose first, second and last symbols are all identical.

(Some examples of correct answers would be: a, aaa, ababa, aababba, some incorrect answers include: ɛ, aaaa, abbaa)

That's what I've done so far:

S = a|b|aTaTa|bTbTb
T = aT|bT|ɛ

However, the problem is that I need T to be a string of any combination of "a" and "b" but of the same length, but I'm not sure how to express that. As you can see above, I can get strings composed of any combination, but they will not have the same length when they are passed to S.
Any help is appreciated!

Elementary Number Theory – List 1 to N for N> = 10

I solve Python3 practice problems in HackerRank to learn Python coding. I'm stuck on some of the mathematical logic.

Goal: Read an Integer N. Without using any string method, try printing the following: 123 …. N

My approach: I've listed the numbers, found their position position. I've multiplied the numbers with their position value positions (10 ** position value) and summed them to get the desired result. It works for a value of N = 9 where the output is 123456789.

My problem: When N = 10, my mathematical logic fails and the program too! What mathematical logic should I use to deal with the extra digit once N changes by a factor of 10?

My defective python3 code is provided below. Please note that I am asking for mathematical logic and not a python code solution.

Thank you very much.


"" "
Started on Saturday, October 12 at 00:05:37 2019

@author: deep
"" "

Read an integer N.
Without using any string methods, try to prin the following:

Example: N=3
output: 123

Not working for N > 9. So N=10 should give an output 12345678910 instead my program gives 123456790. I understand why this is happening as far as coding is concerned but I cannot figure out what mathematical logic I need to employ to tackle to address the additional digit once N changes by a factor of 10

# Creating function to reverse a list
def Reverse(lst)
new_lst = lst(::-1)
return new_lst

# Enter number
N= int(input('Enter a number: '))
Nabs= abs(N)
x=() # List of numbers starting from 0 to N-1
y=() # Reverse of list x()
z=() # List of numbers from 1 to N+1

# Populating list x by appendng with numbers from 0 to N-1.
for i in range(Nabs):

# Length of list
print('length: ', lx)

# Creating a reverse list by calling Reverse function for which function has been defined in the beginning of the program. This list will act as the place value calculator as a multiple of 10


# Creating list raning from 1 to N+1 which will act as the list of coefficients that will be multiplied to the elements in the place value list
for j in range(1, Nabs+1):

# Defining parameters: a is used to calculate the product of the coefficients and the place value. b is used to calculate the sum

for k in range(lx):

# Negative sign check
if N<0:


number theory – integral cuboid problem

Find a "brick" of integral dimensions a, b, c such that the 3 diagonals centered on the faces are based on (a, b), (b, c), (a, c) AND the diagonal "body" Is (a, b, c) an integral part? Progress: theoretical or experimental.

combinatorial – Count the number of unique combinations

I recently came across a programming problem and wonder if there is a closed solution to this problem.

There is a band with squares of unit length each. The total length of the strip is N (that is, there are N squares). You have M painters of length K units each. You can paint on the squares with these painters as many times as you like. How many unique combinations can you do?

Ex. N = 3, M = 2, K = 2 gives 6 unique combinations
(000, 111, 011, 100, 001, 110)

I currently have a brute force algorithm to solve this problem, but I'm sure there must be a more elegant solution.

I am not a student and it is not a matter of homework. I'm just doing it for fun.

Algorithms – How to solve the following tree problem with a number assigned to each node and respond to queries?

I have a tree whose nodes have numbers that were originally assigned to them. A series of $ Q $ questions are asked from $ n = $ 0 at $ n = Q-1 $ seconds. At the end of each second, the numbers of a node (which are not sheets) are deleted and are transferred to each direct child node. is possible that a new number be added to a node. How to solve this problem effectively?

Example: Suppose I have a tree 1 —– 2 —— 3 ——- 4 (1 is parent). Suppose at the beginning that the numbers on the nodes are 1,2,3,4 respectively.

At zero, the second end 5 is added to the zero node. At the end of 0 seconds, the number on the node is (note 1 is not added to 5 because it is removed ).

At a second end, 1 is added to node 4, then the numbers are 0.5,1,3. The fourth node is number three since it has received 2 of the parent node and 1 is added.

Now, suppose that, two seconds from the end, I am asked to say the number on the second node?

I mean that in each query, a number can be added on a node or a question can be asked as – what is the number on $ ith $ node?
How to solve this problem in less than $ O (nQ) $. Or $ n $ is the number of nodes and $ Q $ is the number of requests?

How to treat the data pasted into Google Sheets as a number and not text and sort accordingly?

I've pasted a table in Google Sheets (which is part of Google Docs), and a column is


and, when sorted by this column, the data in the column is treated as "text" and sorted accordingly, which means that 1/102 and 1/1222 both appear at the beginning of the table . Is it possible to sort them into numbers?