Question

$(\frac{1}{ \sqrt{3} + \sqrt{ - 1} } ) {}^{24}$
​

Answer 1

$answer$

Prove the inequality

11–√+3–√+15–√+7–√+.........+19997−−−−√+9999−−−−√>24

My work:

Rationalizing the denominator gives

3–√−12+7–√−5–√2+......+9999−−−−√−9997−−−−√2.

Now by taking two as common and separating the positive and negative terms gives

12[{3–√+7–√+⋯+9999−−−−√}−{1+5–√+⋯+9997−−−−√}].

Can we do like this please suggest. Thanks.

Answer 2

Answer:

#include <map>

#include <set>

#include <list>

#include <cmath>

#include <ctime>

#include <deque>

#include <queue>

#include <stack>

#include <bitset>

#include <cstdio>

#include <vector>

#include <cstdlib>

#include <numeric>

#include <sstream>

#include <iostream>

#include <algorithm>

using namespace std;

void partition(vector <int> ar) {

int p=ar[0];

vector <int> l, r;

for(int i=0; i<ar.size(); i++) {

int x=ar[i];

if (p>ar[i])

l.push_back(x);

else if(p<ar[i])

r.push_back(x);

}

if(!l.empty()){

for (int x = 0; x != l.size(); x++)

cout<<l[x]<<" ";}

cout<<p<<" ";

for (int x = 0; x != r.size(); x++)

cout<<r[x]<<" ";

}

int main(void) {

vector <int> _ar;

int _ar_size;

cin >> _ar_size;

for(int _ar_i=0; _ar_i<_ar_size; _ar_i++) {

int _ar_tmp;

cin >> _ar_tmp;

_ar.push_back(_ar_tmp);

}

partition(_ar);

return 0;

}