




"""simple docstring"""

def 		lowercase_      (		_UpperCAmelCase = 100_0000	):




	"""simple docstring"""






	A_  :				Tuple	   =		limit + 1
	A_  :				Dict	   =		[0] * limit
	for first_term in range(1  ,      _UpperCAmelCase	):
		for n in range(_UpperCAmelCase  ,      _UpperCAmelCase  ,      _UpperCAmelCase	):
			A_  :				Tuple	   =		first_term + n / first_term
			if common_difference % 4:  # d must be divisble by 4
				continue
			else:
				common_difference /= 4
				if (
				    first_term > common_difference
				    and first_term < 4 * common_difference
				):  # since x,y,z are positive integers
					frequency[n] += 1  # so z>0 and a>d ,also 4d<a

	A_  :				List[str]	   =		sum(1 for x in frequency[1:limit] if x == 10	)

	return count


if __name__ == "__main__":
		print(f'{solution() = }')











"""simple docstring"""

from typing import Any

import numpy as np

def 		lowercase_      (		_UpperCAmelCase	):




	"""simple docstring"""






	return np.array_equal(_UpperCAmelCase  ,      matrix.conjugate().T	)

def 		lowercase_      (		_UpperCAmelCase  ,      _UpperCAmelCase	):




	"""simple docstring"""






	A_  :				Tuple	   =		v.conjugate().T
	A_  :				Tuple	   =		v_star.dot(_UpperCAmelCase	)
	assert isinstance(_UpperCAmelCase  ,      np.ndarray	)
	return (v_star_dot.dot(_UpperCAmelCase	)) / (v_star.dot(_UpperCAmelCase	))

def 		lowercase_      (		):




	"""simple docstring"""






	A_  :				Optional[Any]	   =		np.array([[2, 2 + 1J, 4], [2 - 1J, 3, 1J], [4, -1J, 1]]	)
	A_  :				str	   =		np.array([[1], [2], [3]]	)
	assert is_hermitian(_UpperCAmelCase	), f"""{a} is not hermitian."""
	print(rayleigh_quotient(_UpperCAmelCase  ,      _UpperCAmelCase	)	)

	A_  :				int	   =		np.array([[1, 2, 4], [2, 3, -1], [4, -1, 1]]	)
	assert is_hermitian(_UpperCAmelCase	), f"""{a} is not hermitian."""
	assert rayleigh_quotient(_UpperCAmelCase  ,      _UpperCAmelCase	) == float(3	)


if __name__ == "__main__":
		import doctest

		doctest.testmod()
		tests()





