tanh, tanhf, tanhl — hyperbolic tangent function
#include <math.h>
double tanh( |
double x) ; |
float tanhf( |
float x) ; |
long double tanhl( |
long double x) ; |
Note | ||||
---|---|---|---|---|
|
Note | |
---|---|
Link with |
The tanh
() function returns
the hyperbolic tangent of x
, which is defined
mathematically as:
tanh(x) = sinh(x) / cosh(x)
On success, these functions return the hyperbolic tangent
of x
.
If x
is a NaN, a
NaN is returned.
If x
is +0
(−0), +0 (−0) is returned.
If x
is positive
infinity (negative infinity), +1 (−1) is returned.
This page is part of release 3.24 of the Linux man-pages
project. A
description of the project, and information about reporting
bugs, can be found at
http://www.kernel.org/doc/man-pages/.
Copyright 1993 David Metcalfe (davidprism.demon.co.uk) and Copyright 2008, Linux Foundation, written by Michael Kerrisk <mtk.manpagesgmail.com> Permission is granted to make and distribute verbatim copies of this manual provided the copyright notice and this permission notice are preserved on all copies. Permission is granted to copy and distribute modified versions of this manual under the conditions for verbatim copying, provided that the entire resulting derived work is distributed under the terms of a permission notice identical to this one. Since the Linux kernel and libraries are constantly changing, this manual page may be incorrect or out-of-date. The author(s) assume no responsibility for errors or omissions, or for damages resulting from the use of the information contained herein. The author(s) may not have taken the same level of care in the production of this manual, which is licensed free of charge, as they might when working professionally. Formatted or processed versions of this manual, if unaccompanied by the source, must acknowledge the copyright and authors of this work. References consulted: Linux libc source code Lewine's _POSIX Programmer's Guide_ (O'Reilly & Associates, 1991) 386BSD man pages Modified 1993-07-24 by Rik Faith (faithcs.unc.edu) Modified 2002-07-27 by Walter Harms (walter.harmsinformatik.uni-oldenburg.de) |