Write one function dn(n) which takes a non negative integer n returns a tuple list L. Must use identical function name and parameter. dn(4) ⟶ [(5,4.0),(4,3.0),(3,2.0),(2,1.0),(1,0.0)], dn(2) ⟶ [(3,2.0),(2,1.0),(1,0.0)]

Please write a function PythQuad(n) in python that generates a list of pythagorean quadruples (x,y,z,w) such that x <= y <= z <= w < n. Please do not use a triply nested loop, use the properties of a pythagorean quadruple to write the function.

Need help with sml programming language. I need to define a function called countNegative (val countNegative = fn : int list -> int) that takes a list of integers as an argument and that returns a count of the number of negative integers in the list. For example, countNegative([3,17,~9,34,~7,2]) should return 2.

In Kotlin, Write a recursive function called myZip, with an expression body. MyZip takes two Lists and returns a List of Pairs in which each value may be any type (I suggest your start by thinking out how to represent this data type). The pairs consist of corresponding elements in the two lists (the first element of the first list and the first element of the second list, etc). The base case should be that either (or both) of the original lists has length 1, so that, if the lists have different length, the zipping stops when the first list runs out of values.

Code you provide code in python?

m = int(temp[1]) IndexError: list index out of range line 3, in <module>    m = int(temp[10])IndexError: list index out of range when i ran this test case  input: 3 jun3 Jin1 Li2 Kitty2 Josh3 Bob1 Dave2 Jose1 David3 Rob3 Anne3 Ann2 Kevin2 Lara1 ALI3 Xin expected output: Li Dave David ALI Kitty Josh Kevin Lara jun Bob Anne Ann Xin

OCAML Problem

Write a function filter_codes(list_codes) that receives a list of codes and returns another list containing those codes that:    Only have numeric characters; and Are at least 2 characters long; and At most 6 characters long Hint: remember that Python has a built-in function for determining if a string only contains numeric characters. solve using python

Python Please Define a function max_run(lst: list) -> int to find the maximum run in a list. A run is a subsequence with identifical values. For example, in [1, 1, 2, 2, 3, 4, 4, 4, 2, 4, 4], the runs are [1, 1], [2, 2], [3], [4, 4, 4], [2], and [4, 4]. The longest run is [4, 4, 4], which has 3 elements. max_run([1, 1, 2, 2, 3, 4, 4, 4, 2, 4, 4]) should return 3. max_run([]) == 0, max_run([1, 2, 3]) = 1, and max_run([1, 2, 1, 1]) = 2.

Write a function mode (numlist) that takes a single argument numlist (a non-empty list of numbers), and returns the sorted list of numbers which appear with the highest frequency in numlist (i.e. the mode, except that we want to be able to deal with the possibility of there being multiple mode values, and hence use a list ... and sort the mode values while we are at it ... obviously). For example: >>> mode ([2, 0, 1, 0, 2]) [0, 2] >>> mode([5, 1, 1, 5, 1]) [1] >>> mode ([4.0]) [4.0]