Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Materials:
Functions
Recent questions tagged functions
0
votes
1
answer
241
How many relation are there on n to n ? I don't get what it means while I know its result .
hem chandra joshi
383
views
hem chandra joshi
asked
Nov 1, 2017
Mathematical Logic
functions
+
–
2
votes
1
answer
242
Inverse of a function
Consider a function f from A to B such that f : A → B is bijective. f–1 represents inverse of f. Than could we say that f-1 :B->A is also bijective..Please give proper reasoning thanks
Consider a function f from A to B such that f : A → B is bijective.f–1 represents inverse of f.Than could we say that f-1 :B->A is also bijective..Please give proper ...
Shivi rao
819
views
Shivi rao
asked
Oct 7, 2017
Set Theory & Algebra
discrete-mathematics
functions
+
–
2
votes
0
answers
243
Kenneth Rosen Edition 6th Exercise Question 18 c (Page No. 147)
Question Determine whether the following function from R to R is a bijection f(x) = $\frac{(x+1)}{(x+2)}$ Solution: First of all, this is not a function because f(-2) is not defined. So, if the ... } then this function is onto. So, the given function is bijection but with two above mentioned conditions. can someone please confirm?
Question Determine whether the following function from R to R is a bijectionf(x) = $\frac{(x+1)}{(x+2)}$Solution:First of all, this is not a function because f(-2) is not...
Manu Thakur
644
views
Manu Thakur
asked
Sep 18, 2017
Set Theory & Algebra
discrete-mathematics
kenneth-rosen
functions
+
–
0
votes
1
answer
244
Function Composition
For gof to be one-to-one, f must be one-to-one but reverse is not true. Is the above statement correct? According to me both f and g must be one-to-one for gof to be one-to-one. I took below examples: (i) f is one-to-one and g is onto Let A = {1 ... . Here, g(f(1)) and g(f(2)) both gives α which implies that gof is one-to-one. Are above examples correct? If yes, please explain.
For gof to be one-to-one, f must be one-to-one but reverse is not true.Is the above statement correct?According to me both f and g must be one-to-one for gof to be one-to...
aishwarydewangan
1.3k
views
aishwarydewangan
asked
Sep 18, 2017
Set Theory & Algebra
discrete-mathematics
functions
+
–
1
votes
3
answers
245
One to one function
Following is the way of checking the one to one function or Can i use bi implication in between these?If not,then why?
Following is the way of checking the one to one functionorCan i use bi implication in between these?If not,then why?
rahul sharma 5
784
views
rahul sharma 5
asked
Jul 27, 2017
Mathematical Logic
functions
+
–
0
votes
0
answers
246
Kenneth Rosen Edition 6th Exercise 2.3 Question 7 b (Page No. 147)
Find range and domain:- The function that assigns to each positive integer the number of the digits 0,1,2,3,4,5,6,7,8,9 that do not appear as digits in the decimal representation of the integer
Find range and domain:- The function that assigns to each positive integer the number of the digits 0,1,2,3,4,5,6,7,8,9 that do not appear as digits in the decimal repres...
rahul sharma 5
308
views
rahul sharma 5
asked
Jun 9, 2017
Set Theory & Algebra
discrete-mathematics
kenneth-rosen
set-theory&algebra
functions
+
–
8
votes
4
answers
247
ISRO2017-64
What is the output of the following program? #include<stdio.h> int tmp=20; main() { printf("%d", tmp); func(); printf("%d", tmp); } func() { static int tmp=10; printf("%d", tmp); } 20 10 10 20 10 20 20 20 20 10 10 10
What is the output of the following program?#include<stdio.h int tmp=20; main() { printf("%d", tmp); func(); printf("%d", tmp); } func() { static int tmp=10; printf("%d",...
sh!va
5.5k
views
sh!va
asked
May 7, 2017
Programming in C
isro2017
programming-in-c
functions
output
+
–
0
votes
1
answer
248
No of one to one function
No of one to one function from set A={1,2,3,4,5,6,7,8,9} to set B ={x1,x2,x3,x4,x5,x6,x7,.....,xn}
No of one to one function from set A={1,2,3,4,5,6,7,8,9} to set B ={x1,x2,x3,x4,x5,x6,x7,.....,xn}
dragonball
794
views
dragonball
asked
May 2, 2017
Set Theory & Algebra
discrete-mathematics
functions
iiith-pgee
+
–
1
votes
1
answer
249
Find the output of C program
What will be the output of the program? #include<stdio.h> int addmult(int ii, int jj) { int kk, ll; kk = ii + jj; ll = ii * jj; return (kk, ll); } int main() { int i=3, j=4, k, l; k = addmult(i, j); l = addmult(i, j); printf("%d %d\n", k, l); return 0; }
What will be the output of the program?#include<stdio.h int addmult(int ii, int jj) { int kk, ll; kk = ii + jj; ll = ii * jj; return (kk, ll); } int main() { int i=3, j=4...
Archies09
3.3k
views
Archies09
asked
Apr 23, 2017
Programming in C
programming-in-c
functions
+
–
5
votes
1
answer
250
ISI2004-MIII: 23
If $\textit{f}(x)=x^{2}$ and $g(x)=x \sin x +\cos x$ then $f$ and $g$ agree at no point $f$ and $g$ agree at exactly one point $f$ and $g$ agree at exactly two point $f$ and $g$ agree at more then two point
If $\textit{f}(x)=x^{2}$ and $g(x)=x \sin x +\cos x$ then$f$ and $g$ agree at no point$f$ and $g$ agree at exactly one point$f$ and $g$ agree at exactly two point$f$ and ...
Tesla!
1.5k
views
Tesla!
asked
Apr 5, 2017
Calculus
isi2004
engineering-mathematics
functions
+
–
6
votes
1
answer
251
ISI2004-MIII: 22
If $\textit{f}(x)=\frac{\sqrt{3}\sin x}{2+\cos x}$ then the range of $\textit{f}(x)$ is the interval $\left[-1,\frac{\sqrt{3}}{2}\right]$ the interval $\left[\frac{-\sqrt{3}}{2},1\right]$ the interval $\left[-1,1\right]$ none of the above
If $\textit{f}(x)=\frac{\sqrt{3}\sin x}{2+\cos x}$ then the range of $\textit{f}(x)$ isthe interval $\left[-1,\frac{\sqrt{3}}{2}\right]$the interval $\left[\frac{-\sqrt{3...
Tesla!
723
views
Tesla!
asked
Apr 5, 2017
Calculus
isi2004
engineering-mathematics
functions
+
–
2
votes
2
answers
252
ISI 2004 MIII
Let $X$ be a nonempty set and let $\mathcal{P}(X)$ denote the collection of all subsets of $X.$ Define $\textit{f}:\textit{X$\times$ $\mathcal{P}$(X)}\rightarrow \mathbb{R}$ by $f(x,A) = \begin{cases} 1 \text{ if } x \in A & \\ 0 \text{ if } x \notin A & \end{cases}$ ... $f(x,A)+f(x,B) - f(x,A) \cdot f(x,B)$ $f(x,A)+ \mid f(x,A) - f(x,B) \mid$
Let $X$ be a nonempty set and let $\mathcal{P}(X)$ denote the collection of all subsets of $X.$ Define $\textit{f}:\textit{X$\times$ $\mathcal{P}$(X)}\rightarrow \mathbb{...
Tesla!
689
views
Tesla!
asked
Apr 5, 2017
Set Theory & Algebra
isi2004
functions
+
–
0
votes
1
answer
253
ISRO 2006-ECE Functions
$x^3$ + $x$ sin $x$ is a) Constant function b) Odd function c) Even function d) Periodic function
$x^3$ + $x$ sin $x$ isa) Constant functionb) Odd functionc) Even functiond) Periodic function
sh!va
1.9k
views
sh!va
asked
Mar 4, 2017
Linear Algebra
isro-ece
engineering-mathematics
linear-algebra
functions
+
–
7
votes
1
answer
254
Test by Bikram | Mock GATE | Test 2 | Question: 10
Consider a binary function $g :P \times P \to \left \{ true,false \right \}$, where $P$ is a non-empty subset of the natural numbers that contains an even number of distinct elements. Which of the following statements ... equivalence classes $g$ defines a total order but not a partial order $g$ is reflexive and antisymmetric but not a surjection
Consider a binary function $g :P \times P \to \left \{ true,false \right \}$, where $P$ is a non-empty subset of the natural numbers that contains an even number of disti...
Bikram
1.0k
views
Bikram
asked
Jan 24, 2017
Set Theory & Algebra
tbb-mockgate-2
discrete-mathematics
set-theory&algebra
functions
relations
+
–
1
votes
0
answers
255
Functions fog, gof [GateBook]
biranchi
638
views
biranchi
asked
Jan 24, 2017
Set Theory & Algebra
functions
discrete-mathematics
+
–
9
votes
2
answers
256
functions-combinations
Assume an almost injective function is a function in which exactly two element from domain maps to a single element in co-domain, otherwise function is injective. $S$ and $R$ are sets with cardinality $m$ and $n$ respectively. $(m<n)$ and $m\geq 2$. Number of almost injective ... $\frac{( n-m)!}{ 2}$ put m=2 and n=5. we get almost injective functions=5 shudnt it be C?
Assume an almost injective function is a function in which exactly two element from domain maps to a single element in co-domain, otherwise function is injective. $S$ and...
Anusha Motamarri
970
views
Anusha Motamarri
asked
Jan 23, 2017
Mathematical Logic
combinatory
functions
+
–
3
votes
1
answer
257
No. of injective functions ( TestBook Test Series 2 )
biranchi
461
views
biranchi
asked
Jan 23, 2017
Set Theory & Algebra
functions
discrete-mathematics
+
–
1
votes
1
answer
258
composition of function
Let f : A → B and g : B → C denote two functions. Consider the following two statements: S1 : If both f and g are injections then the composition function gof: A → C is an injection. S2 : If the function gof: A → C is surjection and g is an ... a)) and h(a) is onto then g must be onto, where ∀a, a ∈ A. Which of the above statements are valid? please give explanation
Let f : A → B and g : B → C denote two functions. Consider the following two statements:S1 : If both f and g are injections then the composition function gof: A → C...
Pankaj Joshi
936
views
Pankaj Joshi
asked
Jan 20, 2017
Set Theory & Algebra
discrete-mathematics
functions
+
–
17
votes
2
answers
259
GATE2016 ME-2: GA-10
Which of the following curves represents the function $y=\ln \left( \mid e^{\left[\mid \sin \left( \mid x \mid \right) \mid \right]} \right)$ for $\mid x \mid < 2\pi$? Here, $x$ represents the abscissa and $y$ represents the ordinate.
Which of the following curves represents the function $y=\ln \left( \mid e^{\left[\mid \sin \left( \mid x \mid \right) \mid \right]} \right)$ for $\mid x \mid < 2\pi$? He...
makhdoom ghaya
3.7k
views
makhdoom ghaya
asked
Jan 20, 2017
Quantitative Aptitude
gate2016-me-2
functions
quantitative-aptitude
+
–
0
votes
1
answer
260
Functions
Çșȇ ʛấẗẻ
461
views
Çșȇ ʛấẗẻ
asked
Jan 18, 2017
Mathematical Logic
functions
+
–
4
votes
2
answers
261
Testbook Test Series 2017: Calculus - Functions
The function defined for positive integers by $F\left ( 1 \right )=1 F\left ( 2 \right )=1 F\left ( 3 \right )=-1$ and by identites $F\left ( 2k \right )=F\left ( k \right ), F\left ( 2k+1 \right )=F\left ( k \right ) for\; k>=2$ ... is___ ??
The function defined for positive integers by$F\left ( 1 \right )=1 F\left ( 2 \right )=1 F\left ( 3 \right )=-1$and by identites$F\left ( 2k \right )=F\left ( k \right )...
Sheshang
1.0k
views
Sheshang
asked
Jan 16, 2017
Calculus
testbook-test-series
engineering-mathematics
calculus
functions
+
–
0
votes
1
answer
262
Mathss
Let f : A → B and g : B → C denote two functions. Consider the following three statements: S1 : If both f and g are injections then the composition function : A → C is an injection. S2 : If the function : A → C is surjection and g is an injection then the function f is a ... (a) = g(f(a)) and h(a) is onto then g must be onto, where ∀a, a ∈ A. Which of the above statements is/are valid?
Let f : A → B and g : B → C denote two functions. Consider the following three statements:S1 : If both f and g are injections then the composition function : A → C...
thor
1.2k
views
thor
asked
Jan 10, 2017
Mathematical Logic
functions
+
–
–1
votes
0
answers
263
Simple Doubt in Functions
How to find identity element of a function ? Ex : f(x)= x+y-3 How to find identity element of fog(x) ? please take an example and explain for fog(x)
How to find identity element of a function ? Ex : f(x)= x+y-3How to find identity element of fog(x) ? please take an example and explain for fog(x)
PEKKA
619
views
PEKKA
asked
Jan 6, 2017
Set Theory & Algebra
functions
+
–
1
votes
2
answers
264
CMI2016-B-7ai
Consider the funciton $M$ defined as follows: $M(n) = \begin{cases} n-10 & \text{ if } n > 100 \\ M(M(n+11)) & \text{ if } n \leq 100 \end{cases}$ Compute the following$: M(101)$
Consider the funciton $M$ defined as follows:$M(n) = \begin{cases} n-10 & \text{ if } n 100 \\ M(M(n+11)) & \text{ if } n \leq 100 \end{cases}$Compute the following$: M(...
go_editor
526
views
go_editor
asked
Dec 31, 2016
Calculus
cmi2016
calculus
functions
descriptive
+
–
1
votes
1
answer
265
CMI2016-B-7b
Consider the funciton $M$ defined as follows: $M(n) = \begin{cases} n-10 & \text{ if } n > 100 \\ M(M(n+11)) & \text{ if } n \leq 100 \end{cases}$ Give a constant time algorithm that computes $M(n)$ on input $n$. (A constant-time algorithm is one whose running time is independent of the input $n$)
Consider the funciton $M$ defined as follows:$M(n) = \begin{cases} n-10 & \text{ if } n 100 \\ M(M(n+11)) & \text{ if } n \leq 100 \end{cases}$Give a constant time algor...
go_editor
384
views
go_editor
asked
Dec 31, 2016
Calculus
cmi2016
calculus
functions
descriptive
+
–
0
votes
1
answer
266
CMI2016-B-7aiii
Consider the funciton $M$ defined as follows: $M(n) = \begin{cases} n-10 & \text{ if } n > 100 \\ M(M(n+11)) & \text{ if } n \leq 100 \end{cases}$ Compute the following$: M(87)$
Consider the funciton $M$ defined as follows:$M(n) = \begin{cases} n-10 & \text{ if } n 100 \\ M(M(n+11)) & \text{ if } n \leq 100 \end{cases}$Compute the following$: M(...
go_editor
487
views
go_editor
asked
Dec 31, 2016
Calculus
cmi2016
calculus
functions
descriptive
+
–
2
votes
2
answers
267
CMI2016-B-7aii
Consider the funciton $M$ defined as follows: $M(n) = \begin{cases} n-10 & \text{ if } n > 100 \\ M(M(n+11)) & \text{ if } n \leq 100 \end{cases}$ Compute the following$: M(99)$
Consider the funciton $M$ defined as follows:$M(n) = \begin{cases} n-10 & \text{ if } n 100 \\ M(M(n+11)) & \text{ if } n \leq 100 \end{cases}$Compute the following$: M(...
go_editor
465
views
go_editor
asked
Dec 31, 2016
Calculus
cmi2016
calculus
functions
descriptive
+
–
26
votes
4
answers
268
TIFR CSE 2017 | Part A | Question: 11
Let $f \: \circ \: g$ denote function composition such that $(f \circ g)(x) = f(g(x))$. Let $f: A \rightarrow B$ such that for all $g \: : \: B \rightarrow A$ and $h \: : \: B \rightarrow A$ ... ) $f$ is one-to-one (injective) $f$ is both one-to-one and onto (bijective) the range of $f$ is finite the domain of $f$ is finite
Let $f \: \circ \: g$ denote function composition such that $(f \circ g)(x) = f(g(x))$. Let $f: A \rightarrow B$ such that for all $g \: : \: B \rightarrow A$ and $h \: :...
go_editor
4.0k
views
go_editor
asked
Dec 22, 2016
Set Theory & Algebra
tifr2017
set-theory&algebra
functions
+
–
14
votes
2
answers
269
TIFR CSE 2017 | Part A | Question: 10
For a set $A$ define $P(A)$ to be the set of all subsets of $A$. For example, if $A = \{1, 2\}$ then $P(A) = \{ \emptyset, \{1, 2\}, \{1\}, \{ 2 \} \}$. Let $A \rightarrow P(A)$ be a function and $A$ is not ... be onto (surjective) $f$ is both one-to-one and onto (bijective) there is no such $f$ possible if such a function $f$ exists, then $A$ is infinite
For a set $A$ define $P(A)$ to be the set of all subsets of $A$. For example, if $A = \{1, 2\}$ then $P(A) = \{ \emptyset, \{1, 2\}, \{1\}, \{ 2 \} \}$. Let $A \rightarro...
go_editor
2.2k
views
go_editor
asked
Dec 22, 2016
Set Theory & Algebra
tifr2017
set-theory&algebra
functions
easy
+
–
1
votes
2
answers
270
Write C Program using Recursive Funtions for the Problem Described below and Analyse the Complexity Of the Code
Write C Program using Recursive Funtions for the Problem Described below and Analyse the Complexity Of the CodeProblemGiven an unordered array arr[] which contains n di...
Anjana Babu
547
views
Anjana Babu
asked
Dec 21, 2016
Programming in C
programming-in-c
algorithms
functions
time-complexity
+
–
Page:
« prev
1
...
4
5
6
7
8
9
10
11
12
13
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register