(x+k)^m=O(x^m) is true or false for x and k being constants?

James_Gosling asked Apr 24, 2023

245 views

0 votes

Algorithms
algorithms
asymptotic-notation

+ –

James_Gosling asked Apr 24, 2023

James_Gosling

245 views

See all

2 2 Comments

Kabir5454

commented Apr 25, 2023

true.

0 votes

James_Gosling

commented Apr 25, 2023

As x and k are constant and only m is variable(input variable)

so let’s take x=3,k=2

(3+2)^m=5^m which is definitely not less than/equal to 3^m i.e. 5^m != O(3^m)

So It should be false, as per this.

0 votes

Please log in or register to add a comment.

Please log in or register to answer this question.

0 Answers

Voting & Accepting an answer helps improve the community

← Previous Next →

← Previous in category Next in category →

Related questions

0 votes

3 answers

worst_engineer asked Jan 17, 2016

819 views

Let f(x), g(x) and h(x) be function which of following statement is false?
Let $f(x),g(x)$ and $h(x)$ be functions which of the following statement is false? a). if $f(x)$ is $O(g(x))$ and $g(x)$ is $O(h(x))$ then $f(x)$ is $O(h(x))$. b). if $f(x)$ ... $(b)$ I mean according to me , option (a) is correct , right ? by the rule of transitivity . Please correct me , if I am wrong.

Let $f(x),g(x)$ and $h(x)$ be functions which of the following statement is false?a). if $f(x)$ is $O(g(x))$ and $g(x)$ is $O(h(x))$ then $f(x)$ is $O(h(x))$.b). if $f...

worst_engineer

819 views

worst_engineer asked Jan 17, 2016

Algorithms
asymptotic-notation
algorithms
test-series

+ –

0 votes

1 answer

Neha Sharma 2 asked Jun 19, 2023

616 views

Write the following statements True or False (a) If f(n) = O(g(n)) then g(n) = O(f(n)) (b) f(n) + O(f(n)) = (f(n)) (c) f(n) + o(f(n)) = → (f(n)) (d) (logn)! and (loglogn)! are polynomially bounded

Neha Sharma 2

616 views

Neha Sharma 2 asked Jun 19, 2023

0 votes

1 answer

Nishikant kumar asked Sep 29, 2015

537 views

true or false?
T1(n)=O(f(n)) T2(n)=O(f(n)) then check T/F? .T1(n)+T2(n)=O(f(n)) .T1(n)=O(T2(n)) .T1(n)=$\omega$(T2(n)) .T1(n)=${\color{Red} \Theta }$(T2(n))

T1(n)=O(f(n))T2(n)=O(f(n))then check T/F?.T1(n)+T2(n)=O(f(n)).T1(n)=O(T2(n)).T1(n)=$\omega$(T2(n)).T1(n)=${\color{Red} \Theta }$(T2(n))

Nishikant kumar

537 views

Nishikant kumar asked Sep 29, 2015

Algorithms
asymptotic-notation

+ –

3 votes

3 answers

firki lama asked Jan 12, 2017

13,415 views

Time complexity of fractionak knapsack using greedy algorithm is O(n^2)??TRUE/FALSE
i know time complexity is O(nlogn) but can upper bound given in question consider as TRUE..

i know time complexity is O(nlogn) but can upper bound given in question consider as TRUE..

firki lama

13.4k views

firki lama asked Jan 12, 2017

Algorithms
greedy-algorithm
algorithms

+ –

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

2 2 Comments reply

Please log in or register to add a comment.

Please log in or register to answer this question.

0 Answers

Related questions

2 2 Comments