Tag: 7

Performing prime value pairs in python

Post author By Full Stack
Post date April 9, 2021
No Comments on Performing prime value pairs in python

I am currently stuck on Project Euler problem 60. The problem goes like this: The primes 3, 7, 109, and 673, are quite remarkable. By taking any two primes and concatenating them in any order the result will always be prime. For example, taking 7 and 109, both 7109 and 1097 are prime. The sum […]

Tags [109, 617 (33647 + 23003 + 16451 + 1493 + 23). It turns out that it is not the sum we're looking for. I tried the problem again using both phases., 617. Can somebody help me find a more efficient way to solving this problem. Please tell me how to solve it., 7, 7]] x = 11 #Phase 1: Create a list of length n. while getMaxLength(heap)<n: if isprime(x): m = [x], 792, and 673, are quite remarkable. By taking any two primes and concatenating them in any order the result will always be prime. For example, both 7109 and 1097 are prime. The sum of these four primes, I am currently stuck on Project Euler problem 60. The problem goes like this: The primes 3, I end up with the same wrong result. Obviously, I used and created the following functions. def isprime(n): """Primality test using 6k+-1 optimization.""" if n <= 3: return, p): tmplst.append(p) if len(tmplst)>len(m): m=tmplst heap.append(m), represents the lowest sum for a set of four primes with this property. Find the lowest sum for a set of five primes for which any two primes, taking 7 and 109, the answer is less than 74, y): b = False if b == True: li.append(y) y+=2 if len(li)>=n:, y): return isprime(int(str(x)+str(y))) and isprime(int(str(y)+str(x))) def maxList(h): result = [] for s in h: if len(s)

Mastering Development

Conversion of nested list to np.array for tensor model prediction is incorrect

Post author By Full Stack
Post date April 8, 2021
No Comments on Conversion of nested list to np.array for tensor model prediction is incorrect

I have an input array created from : initial window = ‘I have a bad feeling about this’ seq_tokens = t.texts_to_sequences(initial_window) # seq_tokens = [[4], [], [], [5], [590], [], [], [5], [], [998], [5], [], [], [], [], [], [], [4], [], [], [], [5], [998], [591], [], [], [], [], [], [4], []] […]

Tags [], []] I need to reshape seq_tokens to (1, 1, 1). But when I do the following: X_in = numpy.array(seq_tokens) X_in = np.reshape(X_in, 1]) I get a messed up X_in like this: [[[list([4])] [list([])] [list([])] [list([5])] [list([590])] [list([])] [list([])] [list([5])] [list, 4, 5, 590, 591, 7, 998, I have an input array created from : initial window = 'I have a bad feeling about this' seq_tokens = t.texts_to_sequences(initial_window) #

Mastering Development

indexing rows and columns in numpy

Post author By Full Stack
Post date April 6, 2021
No Comments on indexing rows and columns in numpy

a = np.array(list(range(16).reshape((4,4)) array([[ 0, 1, 2, 3], [ 4, 5, 6, 7], [ 8, 9, 10, 11], [12, 13, 14, 15]]) Say I want the middle square. It’d seem reasonable to do this: a[[1,2],[1,2]] but I get this: array([5, 10]) This works, but seems inelegant: a[[1,2],:][:,[1,2]] array([[5, 6], [9, 10]]) So my questions are: […]

Mastering Development

How do you create a long number from a List

Post author By Full Stack
Post date April 6, 2021
No Comments on How do you create a long number from a List

How do you create a long number from a List<Integer> ? From: List<Integer> ints = Arrays.asList(1,2,3,4,5,6,7,8,9) TO: long = 1234567489 Thanks

Tags 2, 3, 4, 5, 6, 7, 8, 9) TO: long = 1234567489 Thanks, How do you create a long number from a List ? From: List ints = Arrays.asList(1

Mastering Development

How to add limited hints when programming a quiz?

Post author By Full Stack
Post date April 5, 2021
No Comments on How to add limited hints when programming a quiz?

I am making a trivia quiz that allows users to solve 10 trivia questions and get a score. I am planning to provide the users 3 hints and print out Sorry! You used all the hints. when the user uses all 3 hints. How do I do that? I know I would need to use […]

Tags 'b': 10, 'C': [10, 'D': 0}}, "10"] # POINTS total_points = 0 q1 = {"A": 0, "E": 10, } # HINTS hints = {1: "h1", } hint = 0 while hint >= 1: print("*" + x + ", } q10 = {"A": 0, } q2 = {"A": 0, } q3 = {"A": 10, } q4 = {"A": 0, } q5 = {"A": 0, } q6 = {"A": 0, } q7 = {"A": 0, } q8 = {"A": 0, } q9 = {"A": 10, 10: "h10", 2: "h2", 222]], 3, 3: "h3", 4, 4: "h4", 5, 5: "h5", 6, 6: "h6", 7, 7: "h7", 8, 8: "h8", 9, 9: "h9", b = 0, c-0, d: [10, e-0*, I am making a trivia quiz that allows users to solve 10 trivia questions and get a score. I am planning to provide the users 3 hints and prin, it does not limit the number of hints the user can get... Can you please help me by looking at my code? trivia = ["111", there is {1} hint(s) left.*".format(hint)) if hint == 3: print("Sorry! You used all the hints.") #QUESTION 1 q1 = input(trivia[0] + "\

Mastering Development

Syntax Error: ‘return’ outside function: my indentations seem to be correct

Post author By Full Stack
Post date March 31, 2021
No Comments on Syntax Error: ‘return’ outside function: my indentations seem to be correct

So first of all im writing a program that will total up all of the values in a list / array and heres what i got so far def go( ann ): total = 0 for i in range(0,len(ann)): total = total+ann[i] return total print ( go( [-99,1,2,3,4,5,6,7,8,9,10,12345] ) ) print ( go( [10,9,8,7,6,5,4,3,2,1,-99] ) […]

Mastering Development

Alternative to IF Statement for deletion

Post author By Full Stack
Post date March 30, 2021
No Comments on Alternative to IF Statement for deletion

I have the following script running in a SSIS Execute SQL Task which is taking exceptionally long to execute : DECLARE @Year int DECLARE @Month int SET @Year = YEAR(GETDATE()) SET @Month = MONTH(GETDATE()) IF @Month IN (1,2,3,4,5,6,7,8,9) BEGIN SET @Year = @Year-1 DELETE FROM GLYTDMovement WHERE CGYear >= @Year AND Entity NOT LIKE ‘TT%’ […]

Tags 2, 3, 4, 5, 6, 7, 8, 9) BEGIN SET @Year = @Year-1 DELETE FROM GLYTDMovement WHERE CGYear >= @Year AND Entity NOT LIKE 'TT%' END ELSE BEGIN SET, I have the following script running in a SSIS Execute SQL Task which is taking exceptionally long to execute : DECLARE @Year int DECLARE @Mo

Mastering Development

How to get key from the value of dictionary

Post author By Full Stack
Post date March 29, 2021
No Comments on How to get key from the value of dictionary

I have the following set of rules for grading system if 25 < score <= 30, grade = A. if 20 < score <= 25, grade = B. if 15 < score <= 20, grade = C. if 10 < score <= 15, grade = D. if 5 < score <= 10, grade = E. […]

Tags -23, 'B': [21, 'C': [16, 'd': 11, 'e': 6, 'otherwise') but it will give you the values. Is there any other mechanism that does the opposite, "14", 1, 10, 12, 13, 15, 17, 18, 19, 2, 20, 22, 24, 25, 27, 28, 29, 3, 30, 4, 5] } so while checking the score with values I want to return the key In python I've learned something like dict.get(term, 7, 8, 9, else). But I want to do it in different manner. for instance I want to declare a dictionary like below: gradeDict = { 'A': [26, f = 0, grade = A. if 20 < score <= 25, grade = B. if 15 < score <= 20, grade = C. if 10 < score <= 15, grade = D. if 5 < score <= 10, grade = E. if 0 <= score <= 5, grade = F. so I have to write a function which takes score as parameter and returns letter grade. So I can do this using selections(if, I have the following set of rules for grading system if 25 < score <= 30, ie: if we can pass the value in the get method it will return the key?

Mastering Development

Pandas correlation maxtrix between float columns and string columns

Post author By Full Stack
Post date March 28, 2021
No Comments on Pandas correlation maxtrix between float columns and string columns

How can I get a correlation matrix in Pandas between float columns and string columns? Using df.corr() automatically drops the string columns. I tried pd.get_dummies(), but this "widens" the dataframe and returns 1/0 in the widened columns. The purpose is to plot a heatmap of the correlation. Of course ‘dog’ and ‘dog’ will have a […]

Tags 'category': ['dog', 'pig' and x, 'pig']} ) x category 0 3 dog 1 2 dog 2 5 cat 3 1 pig 4 1 dog 5 0 cat 6 7 pig, "dog", "pig", 0, 1, 2, 5, 7, but I want to see the correlation of 'dog' and x, but this "widens" the dataframe and returns 1/0 in the widened columns. The purpose is to plot a heatmap of the correlation. Of course 'dog', cat, etc. df = pd.DataFrame( {'x': [3, How can I get a correlation matrix in Pandas between float columns and string columns? Using df.corr() automatically drops the string columns

Mastering Development

Get/extract factorisation from SparseOpaqueFactorization using Accelerate

Post author By Full Stack
Post date March 27, 2021
No Comments on Get/extract factorisation from SparseOpaqueFactorization using Accelerate

I am writing some Linear Algebra algorithms using Apples Swift / Accelerate framework. All works and the solved Ax = b equations produce the right results (this code is from the apple examples). I would like to be able to extract the LLT factorisation from the SparseOpaqueFactorization_Double object. But there doesn’t seem to be any […]

Tags "0.00", [2.5, // col 2 3] // Col 3 // note that the Matrix representation is the upper triangular // here. Since the ma, // Col 2 6.0 ] // Column 3 var columnStarts = [0, // Column 0 1, // Column 0 12.0, // Column 0 3, // Column 1 6, // Column 1 9.5, // Column 2 8] // col 3 var attributes = SparseAttributes_t() attributes.triangle = SparseLowerTriangle attributes., 0.00 ] bValues.withUnsafeMutableBufferPointer { bPtr in xValues.withUnsafeMutableBufferPointer { xPtr in let b = DenseV, 0.3)", 1, 1 0, 1 1, 2, 2.79, 2.85, 2.87 ] var xValues = [ 0.00, 3, 7, a) } var bValues = [ 2.20, attributes: Attributes, B, blockSize: 1) let llt: SparseOpaqueFactorization_Double = values.withUnsafeMutableBufferPointer { valuesPtr in let a = SparseMatrix_Doub, column 1-2, columnCount: 4, columnStarts: &columnStarts, data: bPtr.baseAddress! ) let x = DenseVector_Double( count: 4, data: valuesPtr.baseAddress! ) return SparseFactor(SparseFactorizationCholesky, data: xPtr.baseAddress! ) SparseSolve(llt, empty cells represent zeros. var rowIndices: [Int32] = [0, I am writing some Linear Algebra algorithms using Apples Swift / Accelerate framework. All works and the solved Ax = b equations produce the, no need to store the lower // triangular. var values: [Double] = [10.0, rowIndices: &rowIndices, terminator: " ") } print("") print("Success"), val), World!") // Example of a symmetric sparse matrix, x) } } for val in xValues { print("x = " + String(format: "%.2f"